OJ Board

y rte??? :roll:

#include<stdio.h>
long dif(long a,long b);
int main()
{

long n,p,x[10099],r=0,s,m,j,min,k;
while(scanf("%ld",&n)==1)
{
for(long i=0;i<n;i++)
scanf("%ld",&x[i]);
scanf("%ld",&p);
r=0;
for(k=0;k<n-1;k++)
{
for(j=k+1;j<n;j++)
{
if(x[k]+x[j]==p)
{
min=dif(x[k],x[j ...

where is the bug???? :roll:


#include<stdio.h>
#include<string.h>
int main()
{
char x[5000];
char a[5000];
int b[5000];
int i,j,cs;
int c=1,p,pass,t,m;

while(gets(x))
{
if(cs==1)
printf("\n");
cs=1;
p=strlen(x);
int k=0;
for(i=0;i<p;i++)
{
c=1;
if(x[i]=='\0')
continue;
for(j=i ...

these are some output...where should i print "\n"?? :roll:

100 100: 1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97

100 50: 1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97

100 51: 1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 ...

cut.....acc

For each pair of lines, your program should evaluate the polynomial for all the values of x

what is meant by "evaluating" here??plz help........

still WA...
should i use array for generating output??

getting WA.plz help


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


int main()
{
long long int a,i,k,n,m;
long long int p,q;
long long int y[5000];
char x[5000];
while(scanf("%lld",&p)!=EOF)
{

scanf("%lld",&q);
scanf("%s",x);

n=strlen(x);
int f=1;
for(i=0;i<n;i++)
{
if(x ...

cut

cut

check this input && output :roll:

1 //test case
16 // the number of tests for that case.
5 //chess board with NxN squares

1 1 1 1
0
1 1 2 1
no move
1 1 1 2
no move
1 1 2 2
1
1 1 6 1
no move
1 1 1 3
2
1 1 3 1
2
2 1 3 1
no move
2 1 3 2
1
2 1 2 3
2
1 1 5 5
1
1 2 5 4
2
1 1 1 5
2
1 2 1 5
no move
2 2 ...

what will happen if the bishop or the target is placed out of the board??
you should consider the black and white cells of the chess board accurately.......
the bishop can be white and black colours too.....

check this input:

1 1 2 2

output of my acc code is:

1

hope it will help....there are more conditions than u have assumed.......

Given two strings of lowercase letters, a and b, print the longest string x of lowercase letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of

what is meant hear by "permutation" && "subsequence"??
i am totally in dark ...

code removed

thank u shiplu vai
i hv got ac