Hi guys,
I'm also getting WA for this problem.
1. Should there be empty lines between every test cases in the output? The problem description doesn't say so, but some people's sample input seems so..
2. If there are multiple *correct* guesses, are these counted towards your *hangman strokes*? For ...
Search found 3 matches
- Sun Apr 04, 2004 11:33 am
- Forum: Volume 4 (400-499)
- Topic: 489 - Hangman Judge
- Replies: 52
- Views: 23859
- Thu Oct 02, 2003 8:15 am
- Forum: Algorithms
- Topic: storing large integers in C
- Replies: 1
- Views: 1637
storing large integers in C
Hi,
I need to store a large integer (64bits at the most), which is in hexadecimal format. I know unsigned long long int can store up to 8 bytes, but that's only doable with C-99 standard-compliant compilers.
Is there a way to store such large number?
Again, this is for RC5 implementation.
I need to store a large integer (64bits at the most), which is in hexadecimal format. I know unsigned long long int can store up to 8 bytes, but that's only doable with C-99 standard-compliant compilers.
Is there a way to store such large number?
Again, this is for RC5 implementation.
- Sun Sep 21, 2003 3:19 am
- Forum: Algorithms
- Topic: RC5 Algorithm - Modulus??
- Replies: 1
- Views: 1790
RC5 Algorithm - Modulus??
I have a question on the RC5 Algorithm.
The key expansion scheme states that:
S[0]=Pw
FOR i=1 TO t-1 DO
S=S[i-1] + Qw;
Now, the rule states that Addition is performed modulo 2^w.
But, what does it mean by "it's performed modulo 2^w" ??
Any help'll be appreciated
The key expansion scheme states that:
S[0]=Pw
FOR i=1 TO t-1 DO
S=S[i-1] + Qw;
Now, the rule states that Addition is performed modulo 2^w.
But, what does it mean by "it's performed modulo 2^w" ??
Any help'll be appreciated