Search found 52 matches

by lovemagic
Sat Sep 18, 2004 11:27 am
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 22925

147 why CE!

here is my code.anyone tell me why compile error? //code start #include <stdio.h> #define max 30100 long long coin[]={5,10,20,50,100,200,500,1000,2000,5000,10000}; double input,copy; long long matrix[11][max],i,j; void main(){ for(i=0;i<11;i++)matrix [0]=1; for(i=5;i<max;i+=5)matrix[0] =1; for(i=1;i...
by lovemagic
Tue Sep 14, 2004 10:46 pm
Forum: Volume 2 (200-299)
Topic: 271 - Simply Syntax
Replies: 46
Views: 12812

p271 WA

Can anybody give me some sample input & output for p271?
by lovemagic
Tue Sep 14, 2004 4:34 pm
Forum: Volume 3 (300-399)
Topic: 338 - Long Multiplication
Replies: 59
Views: 7645

338

i have some questions.
1.Is their any negetive integer?
2.is their any superfluous 0s at the beginning of the integer?
3.if input is 1010,1010 what's the output?
by lovemagic
Tue Sep 14, 2004 4:33 pm
Forum: Volume 100 (10000-10099)
Topic: 10096 - The Richest Man of the Universe
Replies: 42
Views: 16742

10096

i don't know why my 10096 gets WA after rejudging! my code gives these output for the inputs. plz tell me are these right or wrong && if wrong what's the right? input 48 S 0 0 0 S 2 2 0 S 2 0 0 S 3 0 1 S 10 10 5 S 8.48 6 3 S 8.49 6 3 S 9 2 1 S 9 1.999999 1 S 4 2 1 S 3.999999 2 1 S 3.999999 1.999999 ...
by lovemagic
Sun Sep 12, 2004 9:43 pm
Forum: Volume 101 (10100-10199)
Topic: 10183 - How Many Fibs?
Replies: 66
Views: 24175

Thanks.Ac now
by lovemagic
Fri Sep 10, 2004 10:15 pm
Forum: Volume 101 (10100-10199)
Topic: 10183 - How Many Fibs?
Replies: 66
Views: 24175

10183

i try a lot but i can't understand why my code is wrong.
e.g. i generate first 500 fibs & do a normal search
by lovemagic
Sat Oct 18, 2003 12:16 pm
Forum: Volume 101 (10100-10199)
Topic: 10107 - What is the Median?
Replies: 74
Views: 19390

10107 TLE

why my program gets TLE? #include <stdio.h> #include <stdlib.h> long input[10050]; int sort(const void *a,const void *b){ long p =*(long *)a,q =*(long *)b; return p-q; } void main(){ long i=0; while(scanf("%ld",&input )!=EOF){ i++; qsort(input,i,sizeof(long),sort); if(i%2==0) printf("%ld\n",(input[i...

Go to advanced search