Help with test cases. [Pascal]

[HeavenAgain]

UHHH no ideaaaaa what the heck is 216 (thank god java have this short note on the error for easy debug), but just a tip when doing that question, the 2 number x and y which are being inputed, x and be bigger than y and y can be bigger than x, that should not affect your answer tho

[CodeMonkey2000]

Apparently there are two cases that give you an infinite loop, they are 113383 and 134379.

[HeavenAgain]

hey codemonkey i just found this :p check it out
http://acm.uva.es/problemset/pascalgpc.html

and no they dont give you infinte loop, if they do, you'll be rich! it is been proven that any sets of number under 1 million are possibile
and result for 113383 and 134379 should give you 349

Ps. if you use brute force for this question (3n+1), IT may require some bitwise operator, just to speed up the calculation, or else you might exceed the time limit, altho pascal and c/c++ are quite fast at these, so it shouldnt be a big problem

[CodeMonkey2000]

I finally got AC for the 3n+1 problem. I just had to rewrite the code in c++ But the minesweeper problem is still giving me WA. I really don't know what's wrong. Did you get AC?

Cplusplus:

#include<iostream> bool inBounds(long x,long y, long highX,long highY) {         return ((x>0)&&(x<=highX)&&(y>0)&&(y<=highY)); } int main() {         long n,m,mines,field;         char input[1001][101],tmp;         field=1;         while ((std::cin>>n>>m)&&((n!=0)||(m!=0)))         {                 for (int x=1; x<=n; x++)                         for (int y=1; y<=m; y++)                         {                                 std::cin>>tmp;                                 while(tmp=='\n')                                         std::cin>>tmp;                                 input[x][y]=tmp;                         }                 std::cout<<std::endl<<std::endl;                 std::cout<<"Field #"<<field<<":"<<std::endl;                 field++;                 for (int x=1; x<=n; x++)                 {                         for (int y=1; y<=m; y++)                         {                                 if (input[x][y]=='.')                                 {                                         mines=0;                                         if ((inBounds(x+1,y,n,m))&&(input[x+1][y]=='*'))                                                 mines++;                                         if ((inBounds(x-1,y,n,m))&&(input[x-1][y]=='*'))                                                 mines++;                                         if ((inBounds(x,y+1,n,m))&&(input[x][y+1]=='*'))                                                 mines++;                                         if ((inBounds(x,y-1,n,m))&&(input[x][y-1]=='*'))                                                 mines++;                                         if ((inBounds(x+1,y+1,n,m))&&(input[x+1][y+1]=='*'))                                                 mines++;                                         if ((inBounds(x+1,y-1,n,m))&&(input[x+1][y-1]=='*'))                                                 mines++;                                         if ((inBounds(x-1,y-1,n,m))&&(input[x-1][y-1]=='*'))                                                 mines++;                                         if ((inBounds(x-1,y+1,n,m))&&(input[x-1][y+1]=='*'))                                                 mines++;                                                                                 std::cout<<mines;                                 }                                 else                                         std::cout<<"*";                         }                         std::cout<<std::endl;                 }                              } }

EDIT: never mind, it works now. Just a formating problem