Search found 12 matches

by abhijit
Tue Mar 22, 2005 12:48 pm
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 163
Views: 17939

A) The header file math.h only has the prototypes for the functions, and not the definition. The function definitions are in binary in the library. B) "C", i believe, doesn't necessarily ask you to specify prototypes before you call functions. C) MOST IMPORTANT : My program DID NOT receive a compile...
by abhijit
Mon Mar 21, 2005 4:45 pm
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 163
Views: 17939

I am shocked by the fact that this "C" code is AC if i include the math.h header file and is a WA if i do not. Don't believe me ? Try it out. Can anyone explain this ? I find that pow and floor are both proper functions and not macros. #include<math.h> int main(){ double n,p; while(scanf("%lf %lf",&...
by abhijit
Mon Mar 21, 2005 4:32 pm
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 163
Views: 17939

don't use the @begin... and @end.... I hear they don't work too well.
More importantly, i guess they should be without the quotes, which is why you could be getting a compile error.

Try the Submit-o-matic.
by abhijit
Thu Feb 17, 2005 9:33 am
Forum: Volume 3 (300-399)
Topic: 339 - SameGame Simulation
Replies: 26
Views: 11855

can't understand sample i/o

I can't understand the sample i/o for this problem.
According to me the output for the 1st sample input is :

Code: Select all

      3
      3   1
    3 5 2 2

What's wrong in my understanding of the problem ?
by abhijit
Fri Feb 11, 2005 8:31 am
Forum: Volume 4 (400-499)
Topic: 423 - MPI Maelstrom
Replies: 17
Views: 9835

Yes, with floyds, one must never set no-link to INT_MAX-1 or somewhere close.
Since, the algo has a line like :
mat[k]+mat[k][j]
This will lead to an overflow in range, and will wrap to a negetive value, making your algo fail.

So make sure that 2*YOUR_MAX <= INT_MAX.
by abhijit
Tue Feb 08, 2005 6:52 pm
Forum: Volume 4 (400-499)
Topic: 468 - Key to Success
Replies: 33
Views: 4463

i get an ouput-limit-exceeded on this.
isn't it always the case for each input set, the output line is as long as the 2nd line in the input set ?
by abhijit
Fri Feb 04, 2005 11:46 am
Forum: Volume 2 (200-299)
Topic: 245 - Uncompress
Replies: 40
Views: 9405

Maybe you are asking about words like :
i'm
etc.

Consider a word to be a sequence ONLY of upper and lowercase letters.
You leave the "m" as "m" and don't change it to "am".
by abhijit
Fri Feb 04, 2005 11:45 am
Forum: Volume 2 (200-299)
Topic: 245 - Uncompress
Replies: 40
Views: 9405

Change the subject of your post, or if thats not possible, try reposting. You seem to want the answer to 254 and not 245.
by abhijit
Sat Oct 23, 2004 5:48 am
Forum: Volume 104 (10400-10499)
Topic: 10424 - Love Calculator
Replies: 137
Views: 40997

cin.getline(b,25);
scanf("%s",b);

Have u submitted these two lines as-is ? Then, that might be the problem.
by abhijit
Wed Oct 20, 2004 1:22 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 15278

Ok, thanks.
i'll try to change my program as you say.

Abhijit
by abhijit
Mon Oct 18, 2004 12:57 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 15278

But how can they expect us to know this when its not mentioned in the problem description. Its just an assumption on our part which we can't make.

If indeed it is so, the problem setters are requested to mention it in the problem description.
by abhijit
Sat Oct 16, 2004 12:49 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 15278

Let me know whether this problem has multiple input sets.
Also, a lot of sample I/O please.

" If a team has multiple submissions at the same contest time, consider all off the Y's to happen after the N's. "

Is this really important ??

Go to advanced search