OJ Board

thanks...i know...

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 ...

thanks..

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 ...

how to get and output long double ?

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 ...

thanks....you are right ,mf;

but how can you find that? read my code?

i think its more useful for me ...

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 ...

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 ...

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]

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 ...

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 ...

how to get GCD faster....?

thanks...
ac now.

ok .
sorry for my thoughtless