OJ Board

I got AC in this problem not checking termination case 0 0 but EOF.Can not the problem description or input file be corrected?
Sorry for my poor english.

CAN ANYBODY TELL ME WHAT IS THE MAXIMUM VALUE OF K?
I AM GETTING TLE

to kollol->
you totally misunderstood the problem.

in the probelm description says
"The following q lines contain one query each, consisting of two integers i and j (1 ≤ i ≤ j ≤ n), which indicate the boundary indices for the query."
that is the boundary of position.

suppose for test case


10 1 ...

to darkos32
i tested that the char array is enough with size murid[10001][20]
donot worry abt it.

check this segment of code again

if(posmurid[i]!=max-1 && posmurid[i]!=-1){

-----------------------------------------------------------------
LIFE IS COMBINED WITH JOY AND SORROW.IT IS NOT ONLY ...

i donot know whats wrong with the code

can any one please tell me?
i have tried many input and output .
but got the correct output.
but the judge solution does not like it.
whY?

code removed after got ac------->

sorry it was a silly mistake that should not have done during the contest time.
I ...

BETOVSKY

use your array a[27][27] as char and try to input as

for(i=1;i<=n;i++)
{
scanf("%s", &a[i][1]);
}


instead of
for(i=1;i<=n;i++)
{
scanf("%d", &linha);
for(j=1;j<=n;j++){
a[i][j]=linha%10;
linha=linha/10;
}

}

because int is not sufficient of input as a number of 25 ...

if any one have any critical inputs.
i have getting wa.

for the input:
40000 3
40000 9
50000 3
60000 7
60000 9
60000 11
0 0
output:
6667
2222
8333
4286
3333
2727
Darko

BUT MY AC PROGRAM GIVES THE FOLLOWING OUTPUT:
6666
2222
8333
4285
3333
2727


for the input:

Try the following input:

Code:
36584 8
8134 363
45029 46
47250 24
10545 ...

AC.BUT almost 3.8 seconds.
Terrible

PLEASE CAN ANY ONE GIVE ME SOME I/O.
I'm GETTING WA

cut

[quote="JuaingFall"]who can help me? Thanks

[code
deleted

I'm bored of wrong answer....
I get wa many times.
whats the wrong here????


#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<memory.h>
#define MAX 10000
char X[MAX],Y[MAX],string[MAX],store[MAX];
int i,j,m,n,c[MAX][MAX],b[MAX][MAX],k=0;
int LCSlength()
{
m=strlen(X);
n=strlen(Y ...

yeah---------
It's a great mistake............
I have edited the code......
now whats the wrong????????????

I don't know whats wrong with this.....
I need some sample input output.............
#include<stdio.h>
#include<math.h>
#define LIMIT 1000000
#define SIZE 1000000
#define BLOCK sizeof(long)
long prime_num,primes[SIZE],temp[LIMIT/BLOCK/2+1];
long is_prime(long num)
{
num=(num-1)/2;
if(num%BLOCK==0 ...