## Search found 141 matches

Wed Jun 24, 2009 4:34 pm
Forum: Volume 116 (11600-11699)
Topic: 11608 - No Problem
Replies: 25
Views: 9602

### Re: 11608 - No Problem

Accepted.
Tue Jun 23, 2009 5:16 am
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 33430

### Re: 727 - Equation

Hello,
Someone please tell how to take input for this problem.
Tue Jun 23, 2009 3:30 am
Forum: Volume 102 (10200-10299)
Topic: 10297 - Beavergnaw
Replies: 13
Views: 6704

### Re: 10297 - Beavergnaw

Hello,
Can anyone give some hint for this problem?
volume=1/3*(D/2)^2*D
Sat Jan 31, 2009 9:28 am
Forum: Volume 1 (100-199)
Replies: 135
Views: 21160

### Re: 111 Why WA??

@lnr.. Have you checked your messages. I sent you a pm earlier this month regarding the problem. check your pms. I modified my input taking code. This time I used "strtok(char *)" function and got accepted. Many thanks for your reply because your input taking code was better, (no need to cast the s...
Fri Jan 30, 2009 12:36 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 21160

### Re: 111 Why WA??

Code removed.
Fri Jan 02, 2009 1:49 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 21160

### 111 History Grading Runtime error

Code removed.
Wed Dec 31, 2008 7:21 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 21160

### Re: 111 Why WA??

Would someone please tell me how to take input for this problem? How to check end of input for this problem after taking integer n? Did you read the complete problem and thread ? n= read first integer for(j=0;j<n;j++) { read the ranking into an array; } for(i=0;i<n-1;i++) { for(k=0;k<n;k++) { read ...
Wed Dec 31, 2008 4:38 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 21160

### Re: 111 Why WA??

Would someone please tell me how to take input for this problem?
How to check end of input for this problem after taking integer n?
Sun Dec 07, 2008 10:06 am
Forum: Volume 7 (700-799)
Topic: 711 - Dividing up
Replies: 25
Views: 11530

### Re: 711 - Dividing up

To little joey The problem asks wether it is possible to divide the balls in two sets with equal amounts of points. We can characterise every possible collection of balls according to this divisibility by saying it is 'divisible' or 'non-divisible'. Now in reducing the number of balls in a particula...
Tue Nov 18, 2008 1:44 pm
Forum: Volume 113 (11300-11399)
Topic: 11367 - Full Tank?
Replies: 13
Views: 7785

### Re: 11367 - Full tank?

andmej wrote:
But your state must contain the amount of fuel that you currently have in the tank.
Would you please explain it with calculation in detail?
pls.........................................................................
Fri Nov 14, 2008 12:52 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 21063

### Re: 406 - Prime Cuts

To peterwen1990 for loop upto n. It is a slow process. You can check upto sqrt(n). for(i=2;i<=n;i++) { for(j=2;j<=sqrt(i);j++) if(i%j==0 && j!=i) { break; } else if(i%j==0 && j==i) { prime[num]=i; num++; } } May be this is the reason. Precalcution for prime number with seive method will be faster.
Fri Nov 14, 2008 10:10 am
Forum: Volume 113 (11300-11399)
Topic: 11367 - Full Tank?
Replies: 13
Views: 7785

### Re: 11367 - Full tank?

Is it related to this problem?
Fri Oct 17, 2008 8:37 pm
Forum: Volume 4 (400-499)
Topic: 424 - Integer Inquiry
Replies: 96
Views: 18999

### Re: 424 Got a WA...Pls help!!!!!

To theharshest.
Try this.
Input:

Code: Select all

``````46457567568
3564567756756
2342343
0
``````
Output:

Code: Select all

``````3611027666667
``````
Fri Oct 17, 2008 8:24 pm
Forum: Volume 4 (400-499)
Topic: 484 - The Department of Redundancy Department
Replies: 103
Views: 7972

### Re: problem 484 WA plz help

To calicratis19.
Try this.
Input:

Code: Select all

``````9 5 1 -1 -8 -6 0 34 -12
``````
Output:

Code: Select all

``````9 1
5 1
1 1
-1 1
-8 1
-6 1
0 1
34 1
-12 1
``````
Fri Oct 17, 2008 8:10 pm
Forum: Volume 4 (400-499)
Topic: 488 - Triangle Wave
Replies: 270
Views: 28742

### Re: 488 TLE

To vinocit
Problem says:
NOTE: There is a blank line after each separate waveform, excluding the last one.
See the output format.