Search found 162 matches

by newton
Thu Apr 02, 2009 6:14 pm
Forum: Volume 7 (700-799)
Topic: 793 - Network Connections
Replies: 102
Views: 31039

Re: 793 - Network Connections

Why WA plz help #include <cstdio> #include <algorithm> #define MAX 10000 using namespace std; int set[MAX]; void setSet(int n){ int i; for(i = 0; i < n; i++) set[i] = i; } int findSet(int n){ return set[n]; } void setReset(int a,int b,int max){ int i; int t = set[a]; for(i = 0; i < max; i++){ if(set...
by newton
Thu Apr 02, 2009 4:54 pm
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21933

Re: 494 WA

Though i got accepted earlier the problem 494. but i submit today and got WA. Why please check my code. #include <cstdio> #include <cstring> #define MAX 1000 int main(){ //freopen("in.txt","rt",stdin); char str[MAX],*p; int c; while(gets(str)){ c = 0; p = strtok(str," !.,;~!@#$%^&*()\t_\?/\n"); whil...
by newton
Wed Jan 07, 2009 4:47 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 13926

Re: 481 Runtime Error!!

what do u mean by the line:

Code: Select all

 vector <vector <long long> > seq;
by newton
Tue Jan 06, 2009 8:59 pm
Forum: Volume 7 (700-799)
Topic: 724 - Reverse
Replies: 14
Views: 5033

Re: 724 - Reverse

Why in same line?
by newton
Mon Jan 05, 2009 5:22 pm
Forum: Bugs and suggestions
Topic: 10391 - Compound Words
Replies: 4
Views: 3201

Re: 10391 - Compound Words

because two other words (substring) may be identical,
that means
"aa" = "a" + "a";

hope it help u.
by newton
Mon Jan 05, 2009 5:16 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 183014

Re: Why WA???

What was the problem number?
by newton
Mon Jan 05, 2009 5:13 pm
Forum: Volume 7 (700-799)
Topic: 724 - Reverse
Replies: 14
Views: 5033

Re: 724 - Reverse

May u submit ur code?
by newton
Wed Nov 12, 2008 9:05 am
Forum: Volume 114 (11400-11499)
Topic: 11479 - Is this the easiest problem?
Replies: 48
Views: 17640

Re: 11479 - Is this the Easiest Problem?

You have declared variables as long int but you are taking input with %lld as long long int.
How can you hope that you will get Accepted.

The problem is really Easy if you think a little before post.
by newton
Tue Nov 11, 2008 7:28 pm
Forum: Volume 100 (10000-10099)
Topic: 10023 - Square root
Replies: 121
Views: 27623

Re: 10023 - Square Root

But some of my friends had got Acc
think judge has fixed it.
by newton
Mon Nov 10, 2008 7:40 pm
Forum: Volume 114 (11400-11499)
Topic: 11479 - Is this the easiest problem?
Replies: 48
Views: 17640

Re: 11479 - Is this the Easiest Problem?

What should be the output for:

Code: Select all

1
1 1 2
think you got the point.
by newton
Mon Nov 10, 2008 8:46 am
Forum: Volume 104 (10400-10499)
Topic: 10496 - Collecting Beepers
Replies: 19
Views: 10033

Re: 10496 - Collecting Beepers

Nobody here to see my code?
Humm?
by newton
Mon Nov 10, 2008 8:29 am
Forum: Volume 114 (11400-11499)
Topic: 11479 - Is this the easiest problem?
Replies: 48
Views: 17640

Re: 11479 - Is this the Easiest Problem?

Your code even does not pass the sample input.
What do you mean by

Code: Select all

else if(t1+t2<t3||t1+t3<t2||t2+t3<t1)
         puts("Scalene");
by newton
Wed Nov 05, 2008 10:39 pm
Forum: Volume 104 (10400-10499)
Topic: 10496 - Collecting Beepers
Replies: 19
Views: 10033

Re: 10496 - Collecting Beepers

i think there is no need to use BFS. as the limit is at most 20x20. My algorithm: 1. Take all the points to a structure. 2. store source 3. get next close point from source for this i count the ( abs(sx - node .x) + abs(sy - node .y) ) upto all beepers point and return the expected pont. 4. next i u...
by newton
Sun Nov 02, 2008 9:05 am
Forum: Volume 109 (10900-10999)
Topic: 10986 - Sending email
Replies: 65
Views: 26908

Re: 10986 - Sending email

What was your problem?
by newton
Thu Oct 30, 2008 6:22 pm
Forum: Volume 104 (10400-10499)
Topic: 10450 - World Cup Noise
Replies: 42
Views: 19986

Re: 10450 - World Cup Noise

Its a simple Java code but ONLINEJUDGE says me RE!! why can u find plz. import java.util.*; import java.io.*; import java.math.BigInteger; class WorldCup{ WorldCup(){}; public static void main(String args[]){ int i,n,num; BigInteger B[] = new BigInteger[55]; Scanner sc = new Scanner(System.in); B[0]...

Go to advanced search