Search found 14 matches
- Thu Nov 02, 2006 6:53 am
- Forum: Volume 6 (600-699)
- Topic: 627 - The Net
- Replies: 18
- Views: 9309
627 - The Net
I cant understand why i got RE? #include<stdio.h> #include<string.h> #include<stdlib.h> #include<vector> #include<queue> #include<stack> using namespace std; #define MAXV 300 #define WHITE 0 #define GRAY 1 #define BLACK 2 #define NIL -1 #define INF -99 int color[MAXV+1]; int discover[MAXV+1]; int pa...
- Sun Jul 02, 2006 8:33 pm
- Forum: Volume 4 (400-499)
- Topic: 498 - Polly the Polynomial
- Replies: 73
- Views: 20418
- Thu Jun 29, 2006 6:26 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10892 - LCM Cardinality
- Replies: 25
- Views: 11495
- Thu Jun 29, 2006 2:42 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10892 - LCM Cardinality
- Replies: 25
- Views: 11495
10892why WA need i/o
it seems all right.but got WA.
Can anyone help?
Can anyone help?
Code: Select all
code deleted.
- Tue Jun 27, 2006 10:19 am
- Forum: Volume 4 (400-499)
- Topic: 453 - Intersecting Circles
- Replies: 84
- Views: 25343
- Mon Jun 19, 2006 9:08 pm
- Forum: Volume 4 (400-499)
- Topic: 453 - Intersecting Circles
- Replies: 84
- Views: 25343
- Mon Jun 19, 2006 2:37 pm
- Forum: Volume 4 (400-499)
- Topic: 498 - Polly the Polynomial
- Replies: 73
- Views: 20418
498-why WA
I checked all i/o that i got from previous topic.
But i m getting WA.Can anyone help?
But i m getting WA.Can anyone help?
Code: Select all
code deleted after got ac
- Mon Jun 12, 2006 1:05 pm
- Forum: Volume 4 (400-499)
- Topic: 453 - Intersecting Circles
- Replies: 84
- Views: 25343
453 why WA need i/o
i think my math is correct.but it got WA.please help me. need i/o . so that i can fix my problem. it does not output -0.000.but for what input it does not work? #include<stdio.h> #include<math.h> #include<stdlib.h> #define M 1e-8 void main() { double x1,x2,y1,y2,r1,r2,p,m,n,a,b,c,h1,h2,k1,k2,t; freo...
- Thu Apr 27, 2006 11:11 am
- Forum: Volume 8 (800-899)
- Topic: 834 - Continued Fractions
- Replies: 20
- Views: 20833
more input output
thank you. but can you give me some extra input output,like
-5 3
1 3
3 1
-25 6
0 2
2 0
more like this. in question says: To ensure uniqueness, make bn > 1.
can you explain with example?
![:wink:](./images/smilies/icon_wink.gif)
-5 3
1 3
3 1
-25 6
0 2
2 0
more like this. in question says: To ensure uniqueness, make bn > 1.
can you explain with example?
![:wink:](./images/smilies/icon_wink.gif)
- Sun Apr 23, 2006 2:25 pm
- Forum: Volume 8 (800-899)
- Topic: 834 - Continued Fractions
- Replies: 20
- Views: 20833
834 nedd i/o
can anyone give me huge input/output for this problem.
- Sat Apr 15, 2006 2:17 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10006 - Carmichael Numbers
- Replies: 66
- Views: 27722
- Thu Apr 13, 2006 6:07 am
- Forum: Volume 100 (10000-10099)
- Topic: 10006 - Carmichael Numbers
- Replies: 66
- Views: 27722
10006-WA why
Is there anyone to help me.
code deleted.
although it outputs correctly judge says wrong answer.please help.![:cry:](./images/smilies/icon_cry.gif)
code deleted.
although it outputs correctly judge says wrong answer.please help.
![:cry:](./images/smilies/icon_cry.gif)
- Mon Mar 27, 2006 4:37 pm
- Forum: Volume 5 (500-599)
- Topic: 583 - Prime Factors
- Replies: 171
- Views: 56171
- Mon Mar 27, 2006 4:16 pm
- Forum: Volume 5 (500-599)
- Topic: 583 - Prime Factors
- Replies: 171
- Views: 56171
583 how can i make it faster
The code is accepted but how can i make it faster.Please help me. #include<stdio.h> #include<math.h> #define MAX 5000 #define P 46401 long factor[MAX]; long prime[P]; long p[MAX]; void main() { long n,count,i; long j; /*freopen("in.txt","r",stdin);*/ prime[0]=prime[1]=1; for(i=2;...