OJ Board

/*
ACM uva 10038 - JollyJumper
Note: !!!!Don't forget to initialize array to 0
*/

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

void Jolly(int size)
{
int i = 0;
int val = 0;
int val2 = 0;
int counter = 0;
int isJolly = 1;
int diff[size];
scanf(" %d",&val);
for (i = 0;i<size ;i++ )
diff = 0 ...

Why my code give wa? I have tried lots of sample input but it's still wa

/* ACM uva 10038 - JollyJumper */

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

void Jolly(int size)
{
int i = 0;
int val = 0;
int val2 = 0;
int counter = 0;
int isJolly = 1;
int diff[size];
scanf(" %d",&val);
while ...

I always got tle when i submit my code, anyone know better algorithm to solve this problem?



#include <stdio.h>
#include <math.h>
int isPrime(int num)
{
int j;
for (j = 2 ;j<num ;j++ )
{
if (num%j == 0)
return 0;
if (j>sqrt(num))
{
return 1;
}
}
return 0;
}

void primeFact(int x ...