Search found 16 matches
- Sat Sep 09, 2006 9:29 pm
- Forum: Bugs and suggestions
- Topic: stats not updating II
- Replies: 2
- Views: 2296
- Sun Aug 27, 2006 9:27 am
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
- Fri Aug 25, 2006 12:08 pm
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
- Wed Aug 23, 2006 9:29 am
- Forum: Off topic (General chit-chat)
- Topic: I win !!
- Replies: 361
- Views: 155668
- Sun Aug 20, 2006 8:40 pm
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
Java support is mentioned here. It will be greatly improved in the coming new Judge.
- Sat Aug 05, 2006 5:30 pm
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
- Mon Jul 31, 2006 8:47 am
- Forum: Algorithms
- Topic: how can i submit solutions
- Replies: 2
- Views: 1838
Re: how can i submit solutions
It is mentioned in the registration confirmation e-mail. You should have used it for account validation. Don't you remember it?kamalkishore wrote:i dont know how can i get ID with suffix,
- Fri Jul 28, 2006 8:35 pm
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
- Thu Jul 27, 2006 10:51 am
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
- Tue Jul 25, 2006 8:32 pm
- Forum: Volume 1 (100-199)
- Topic: 121 - Pipe Fitters
- Replies: 36
- Views: 6643
Or use:
Code: Select all
while (cin >> a >> b)
{
// process
}
- Sat Jul 22, 2006 11:42 pm
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
- Sat Jul 22, 2006 2:25 am
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 318271
100 - Wrong assumption in the problem statement
The input description says:
You can assume that no opperation overflows a 32-bit integer.
But, actually, there is a total of 883 occurrences where a "3n + 1" operation overflows a 32-bit unsigned integer; in particular, a maximum value of 56,991,483,520 will be reached if the original n is 704,511 ...
You can assume that no opperation overflows a 32-bit integer.
But, actually, there is a total of 883 occurrences where a "3n + 1" operation overflows a 32-bit unsigned integer; in particular, a maximum value of 56,991,483,520 will be reached if the original n is 704,511 ...
- Thu Jul 20, 2006 1:54 am
- Forum: Other words
- Topic: Registration (for the Online-Judge) problem
- Replies: 2
- Views: 2945
- Sun Jul 16, 2006 11:24 am
- Forum: C
- Topic: data type... (long int, long long int)
- Replies: 8
- Views: 9370