OJ Board

please give me some I/O.
Thanks in advance.

Thanks a lot that was the only problem.
Got accepted.

hi

i passed all the test cases found in the board.but WA.
please help.

#include<stdio.h>
#include<string.h>

#define YES 1
#define NO 0



int gcd(int a,int b)
{
int c;
for(;a%b;c=b,b=a%b,a=c);
return b;
}


void main()
{
int x,y,found,z,ans,digit[3001],temp[3001],a,b;

/*freopen("d:\\out202 ...

can someone help me.
I got WA.


#include<stdio.h>
#include<stdlib.h>
#include<math.h>

#define SIZE 100001
#define EPS 1e-6

typedef struct {
double l,r;
char one[17];
char two[17];

}point;



point arr[SIZE];
int pos[SIZE];

void refresh()
{
long i;
for(i=0;i<SIZE;i++){arr[i].l=arr[i].r ...

what is happening here

here is the code.it gets wrong answer.help please.


#include<stdio.h>
#include<string.h>
#include<stdlib.h>

#define SIZE 500005

typedef struct{
long a,b;

}pair;

pair arr[SIZE];
int fnd[SIZE];

int comp(const pair * a,const pair *b)
{
if(a->a > b->a)return 1;
else if(a->a < b->a)return -1 ...

here is my got.got wrong answer.help

#include<stdio.h>
#include<string.h>
#include<assert.h>
#include<stdlib.h>

#define SIZE 1000001

long pos[SIZE];
char val[SIZE][30];
char inp[SIZE*12];

void main()
{
long i,j,N;
char *q;

gets(inp);
sscanf(inp,"%ld",&N);
while(N--)
{
gets(inp);
q ...

thanks a lot.
that little thing didnt came to my mind.
i thought there was problem in my implementation.

hi ,i used KMP for this problem(10679).
it gets lime limit exceeded.

is my implementation wrong.please help

#include<stdio.h>
#include<malloc.h>
#include<string.h>

char p[100010],q[1100];
long f[1100];
long lenp,lenq;

void refresh()
{
int i;
q[0]=0;
for(i=0;i<1100;i++)
{
f =0;
}
}

void ...