OJ Board

Thank you. The problem was caused by an overflow.

Hello everyone. Would anyone mind helping me out? What I do is run KMP over the given string searching for the longest occurence of "rev" ( the reverse of the string given ). After I find the max overlap, I take the first longitud - max_occurence characters of the string given, proceed to reverse ...

Could someone help me find the reason why this fails? It has passes all the test cases on this thread but is wrong according to the judge.

Algorithm:
1. Receive max value (t)
2. Checks whether it is necessary to print the extra line to seperate test cases.
3. Recieves first value of permutation ...

thanks for the help. my code was accepted.

hello all. could one of you help me find the cause of a runtime error with my code? i ran all the test cases on this thread succesfully on my computer (im running windows 7, not quite sure if that's important).

hey guys, any suggestions on what i could do to correct my code?
#include <stdio.h>
#include <math.h>

long long int a,p;
int prime[40000],arr[40000];

long long int sq(long long int n);
long long int mod(long long int m);
int isprime();

int main()
{
int l,i,j,k,f;
long long int q;
for(i=3 ...