Search found 74 matches

by sunnycare
Fri Jul 14, 2006 6:04 am
Forum: Volume 110 (11000-11099)
Topic: 11034 - Ferry Loading IV
Replies: 15
Views: 6666

thanks...i know...
by sunnycare
Mon Jul 10, 2006 9:47 am
Forum: Volume 110 (11000-11099)
Topic: 11034 - Ferry Loading IV
Replies: 15
Views: 6666

11034 - Ferry Loading IV

simple problem , but i got WA... need some test cases...(i also want to know how to generate them ) my code is here?if you have time please check it... #include <iostream> #include <cstdlib> using namespace std; //11034 int main() { int cases; cin>>cases; int l,m,cl,cnt,s; char curSide; char side[16...
by sunnycare
Mon Jul 10, 2006 6:14 am
Forum: Volume 110 (11000-11099)
Topic: 11040 - Add bricks in the wall
Replies: 9
Views: 2506

3x

thanks..
by sunnycare
Sat Jul 08, 2006 11:05 am
Forum: Volume 110 (11000-11099)
Topic: 11040 - Add bricks in the wall
Replies: 9
Views: 2506

11040 - Add bricks in the wall

who can check my code? i dont know why? i use gcc compile it on my computer ,and it works well... #include <stdio.h> int main() { int wall[9][9]; int cases; scanf("%d",&cases); int row,col; while(cases-->0) { for(row=0;row<=8;row+=2) { for(col=0;col<=row;col+=2) { scanf("%d",&(wall[row][col])); } } ...
by sunnycare
Thu Sep 01, 2005 9:47 am
Forum: C
Topic: how to get long double ?
Replies: 1
Views: 2015

how to get long double ?

how to get and output long double ?
by sunnycare
Tue Aug 30, 2005 3:20 pm
Forum: Volume 108 (10800-10899)
Topic: 10886 - Standard Deviation
Replies: 8
Views: 4999

output from my accept code: may be it is helpful Case #1: 0.00001 Case #2: 0.00000 Case #3: 0.00000 Case #4: 0.09375 Case #5: 1283729051.97967 Case #6: 0.00001 Case #7: 0.00000 Case #8: 0.00000 Case #9: 0.09375 Case #10: 76174674.36394 Case #11: 59904563.83775 Case #12: 866974033.35292 Case #13: 0.0...
by sunnycare
Sat Aug 27, 2005 4:18 pm
Forum: Volume 108 (10800-10899)
Topic: 10814 - Simplifying Fractions
Replies: 30
Views: 16363

thanks....you are right ,mf;

but how can you find that? read my code?

i think its more useful for me ...
by sunnycare
Wed Aug 24, 2005 10:26 am
Forum: Volume 5 (500-599)
Topic: 584 - Bowling
Replies: 10
Views: 5968

i got TLE,very strange... i cant find the error..... who can help me.... //584 Bowling #include <iostream> using namespace std; int main() { long frame[10]; long score; char str[100]; long f; bool nextFrame; while(cin.getline(str,100)) { if(str[0]=='G') break; long i,j; for(i=0;i<10;i++) frame[i]=0;...
by sunnycare
Wed Aug 24, 2005 10:12 am
Forum: Volume 108 (10800-10899)
Topic: 10814 - Simplifying Fractions
Replies: 30
Views: 16363

hi mf my code works ok and fast for your sample input.. so i think i should paste my whole code here...... any suggesstion is welcome...thanks //10814 Simplifying Fractions #include <iostream> #include <cmath> #include <string> using namespace std; class BigInteger { private: enum {MAXNUM=999999999,...
by sunnycare
Tue Aug 23, 2005 12:48 pm
Forum: Volume 108 (10800-10899)
Topic: 10814 - Simplifying Fractions
Replies: 30
Views: 16363

Most likely it's because your BigInteger's division is too slow. Better try to optimize that code first
i have generate a lot of input data to test my code
it works so fast...

how to optimize the BigInteger's division ?can you give me some advise?

[/code]
by sunnycare
Tue Aug 23, 2005 11:38 am
Forum: Volume 108 (10800-10899)
Topic: 10814 - Simplifying Fractions
Replies: 30
Views: 16363

i use it.. but got tle... i think the class BigInteger is correct,for i have solved many problems by it... the class is too long ,so i wont paste here now.... BigInteger gcd(BigInteger a,BigInteger b) { BigInteger tmp; if(a==0) return b; while(a!=0) { tmp=b%a; if(tmp==0) return a; else { a=a%tmp; b=...
by sunnycare
Mon Aug 22, 2005 1:07 pm
Forum: Volume 103 (10300-10399)
Topic: 10341 - Solve It
Replies: 64
Views: 34693

10341 wa

i have searched all the topics about this problem ... but i still get wa.. who can send me your accept code to me? my mail is athena_kula@msn.com i am confused about the "double" type data.... //10341 Solve It #include <iostream> #include <cmath> #define EPS (1E-8) using namespace std; long p,q,r,s,...
by sunnycare
Mon Aug 22, 2005 12:31 pm
Forum: Volume 108 (10800-10899)
Topic: 10814 - Simplifying Fractions
Replies: 30
Views: 16363

10814--TLE how to get gcd faster?

how to get GCD faster....?
by sunnycare
Sun Aug 21, 2005 1:31 pm
Forum: Volume 108 (10800-10899)
Topic: 10883 - Supermean
Replies: 30
Views: 11371

thanks...
ac now.
by sunnycare
Fri Aug 19, 2005 1:14 pm
Forum: Other words
Topic: a lot of WAs..
Replies: 7
Views: 3224

ok .
sorry for my thoughtless

Go to advanced search