Search found 36 matches

by saiqbal
Thu Jun 19, 2003 4:12 pm
Forum: Volume 105 (10500-10599)
Topic: 10504 - Hidden squares
Replies: 14
Views: 6256

thanx.. that was really helpful :)

-sohel
by saiqbal
Thu Jun 19, 2003 10:17 am
Forum: Volume 105 (10500-10599)
Topic: 10504 - Hidden squares
Replies: 14
Views: 6256

10504 - Hidden squares

i don't understand the 2nd sample input. i found only 7 squares for B in the following grid, but sample output says there are 8. A B B A B B B B A B B B A B B A the squares i found for B are: 1. - B B - - B B - - - - - - - - - 2. - - - - - B B - - B B - - - - - 3. - - - - - - - - - B B - - B B - 4. ...
by saiqbal
Mon May 19, 2003 5:50 pm
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 31560

1 is not prime!!
it doesn't matter actually. problem statement says:
Assume that 1< N< 1000000.
so, 1 is not in the judge input :)

good luck
-sohel
by saiqbal
Sun Apr 27, 2003 3:49 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31874

your code seems pretty wiered to me. i solved the problem in quite straight forward way. the process i followed is: 1. i made a structure array with an integer for index and a char array for the floating number. 2. i read first line and counted the number of input in that line and store them in the ...
by saiqbal
Sat Apr 12, 2003 4:05 pm
Forum: Volume 104 (10400-10499)
Topic: 10464 - Big Big Real Numbers
Replies: 10
Views: 4315

all the special cases are included in the sample i/o i think. :)

good luck
-sohel

ps- don't forget about the length of a number :wink:
by saiqbal
Sat Apr 12, 2003 3:59 pm
Forum: Volume 104 (10400-10499)
Topic: 10407 - Simple division
Replies: 34
Views: 11835

i used int for this problem.

-sohel
by saiqbal
Tue Apr 08, 2003 3:40 pm
Forum: Volume 6 (600-699)
Topic: 633 - A Chess Knight
Replies: 10
Views: 6717

sure, you can email me the code.

-sohel
by saiqbal
Mon Apr 07, 2003 4:30 pm
Forum: Volume 6 (600-699)
Topic: 633 - A Chess Knight
Replies: 10
Views: 6717

Re: 633 - A Chess Knight

after move of type X is allowed to make moves only Y and Z (X,Y,Z are moves from description -> K,B,T) i think you are right. after making a move X you can make a move either Y or Z and if you make Y next then again you can make a move either X or Z and so on. i used bfs too. i stored the move to r...
by saiqbal
Sun Apr 06, 2003 2:08 pm
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 36580

you'll find some test i/o in previous posts. here are some links:
http://acm.uva.es/board/viewtopic.php?t=1114&start=15
and
http://acm.uva.es/board/viewtopic.php?t=1114

good luck
-sohel
by saiqbal
Tue Apr 01, 2003 3:31 pm
Forum: Volume 7 (700-799)
Topic: 750 - 8 Queens Chess Problem
Replies: 78
Views: 26691

using spaces instead of tab ('\t') might help
by saiqbal
Mon Mar 31, 2003 4:21 pm
Forum: Volume 101 (10100-10199)
Topic: 10126 - Zipf's Law
Replies: 36
Views: 8888

well, it seems quite wiered!! :o i've compiled the code you pasted above using two different compilers and tested them using the above input and got the same following output: abcd There is no such word. abcd There is no such word. and i was so confused that i carefully checked your code afterwards,...
by saiqbal
Sun Mar 30, 2003 8:44 pm
Forum: Volume 103 (10300-10399)
Topic: 10324 - Zeros and Ones
Replies: 179
Views: 43844

i found several mistakes in your code: 1. it seems that you did a mistake declaring the char array. it should be at least 1000001. 2. you don't need to store all the queries which you did using a huge array!! 3. i once gave an advice to declare large arrays global. declaring large arrays local might...
by saiqbal
Sun Mar 30, 2003 3:40 pm
Forum: Volume 101 (10100-10199)
Topic: 10126 - Zipf's Law
Replies: 36
Views: 8888

im really sorry about the confusion i caused. it was my mistake really and i forgot the input specification. :oops: i changed the input accordingly. :wink:

hope it didn't cause too much trouble :-?

thanx
-sohel
by saiqbal
Sat Mar 29, 2003 6:48 pm
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 31560

logical error i guess. modify the following code: code to modify: [cpp]if(isPrime(b)) if(a!=b) printf("%lld is emirp.\n",a); else printf("%lld is prime.\n",a); [/cpp] code to replace with: [cpp]if(isPrime(b)) { if(a!=b) printf("%lld is emirp.\n",a); else printf("%lld is prime.\n",a); } else printf("...
by saiqbal
Sat Mar 29, 2003 6:11 pm
Forum: Volume 103 (10300-10399)
Topic: 10324 - Zeros and Ones
Replies: 179
Views: 43844

no, its not. the idea is, you implement your algorithm with lower limits (which can be supported by your compiler) and increase the limits when you submit. if your algorithm is right you should get AC. its only a trick to use older compilers for this kind of problem. but i guess using a 32-bit compi...

Go to advanced search