OJ Board

try to change

[java]
static int main()
[/java]

to

[java]
public static void main( String [] args )
[/java]

and

[java]
else if( n < 0 ) return 0;
[/java]

to

[java]
else if( n < 0 ) return ;
[/java]

this will at least let your code to run on OJ ( i believe ) ; )

hope this helps

[cpp]
for (int i=0;i<=K-1;i++)
for (int j=0;j<=N-2;j++)
for (int k=j+1;k<=N-1;k++)
if (A [j]>A [k])
{
tempI=A [j];
A [j]=A [k];
A [k]=tempI;
}
[/cpp]

this is slow.. around O(n^2) bubble * n times = O(n^3), you might want to consider using a faster sorting alrgorithm (qsort in C, or sort in ...

1.
[cpp]
numProduced.push_back(randomNum);
int first= randomNum;
int count=1;
while(1)
{
randomNum=(Z*randomNum+I)%M;
if(Search(numProduced,randomNum))
break;
numProduced.push_back(randomNum);
count++;
}
[/cpp]
this will give you a WA iff the number doesn't start at the first place..
ex. the ...

What do you mean "maybe you want to at least push the generated random number into the vector?" ? I already pushed the generated numbers into the vector!
Yeah, I tried while(!(Z==0&&I==0&&M==0&&L==0)) but there's no difference. I still get the wrong answer. Huhm!

you pushed the first generated ...

maybe you want to at least push the generated random number into the vector?

and try to change
[cpp]
while(Z!=0&&I!=0&&M!=0&&L!=0)
[/cpp]

to
[cpp]
while(!(Z==0&&I==0&&M==0&&L==0))
[/cpp]

hope this helps

ah.. good to hear =)

1. if the length is even, it is a MUTANT.
2. if the length is 1 and it is not 'A', it is a MUTANT.
3. if the length is 1 and it is 'A', it is a SIMPLE.
4. go through the string of cells from the end, also keep track of your position from the start of the string. loop until you found a MUTANT (those ...

I think the strcmpi in your code is causing the problem. Note that strcmpi is valid neither in ANSI C nor in UNIX. To avoid CE (though I myself have recieved 80 CEs to date :wink:), remember that judge uses UNIX system to compile your program.

instead of strcmpi, use strcmp (make sure you ...

195
4 9339
265
5 45254
750
3 6666
2
0 2
99
0 99
6
0 6
4000000000
1 4000000004
20
1 22
100
1 101

try this:
BBCCDD
C
AAABBBCCC

expected output:
68 2
67 2
66 2

67 1

67 3
66 3
65 3

your output:
68 2
67 2
66 2

67 1

65 3

hope this helps

But be careful: the cycle might not begin with the seed!

since the seed might not be in the cycle, you want to take note of every random number that the algorithm produce (You can use an array to keep track of everything, and check if you already found that number everytime you generate a new ...

Your code does not terminate when it reaches the End Of File, so
change your ReadCmd function to:

[cpp]
int
ReadCmd (char &Cmd)
{
do
{
if(scanf("%c",&Cmd)==EOF) return 0;
}while (Cmd=='\n');
return 1;
}
[/cpp]

[c]
for (;; ) {
if (!scanf ("%d", &n)) break;
/* change the line above to if(scanf("%d",&n)==EOF) break; */
printf ("The Fibonacci number for %d is ", n);
[/c]

hope this helps

your code does not produce the right answer for the sample data.
1. You forget to reset the value of maxc after each run.
2. You skip some numbers (and it happens that one of the number produces the maximum cycle length), eg. 1 10 (your output is 9)
3. for TLE, you might want to consider using ...