UVa 10038 - Jolly Jumpers

每相邻的两个数之间求差，若这n个数的所有的差值正好满足1~(n-1)，则输出“Jolly”，否则输出“Not Jolly”。

代码如下：

#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>using namespace std;bool vis[3000];int a[3000], num;bool Judge(){    for(int i=1; i<num; i++)        if(!vis[i])            return false;    return true;}int main(){#ifdef test    freopen("sample.txt", "r", stdin);#endif    while(scanf("%d", &num) != EOF)    {        memset(vis, false, sizeof(vis[0])*num);        scanf("%d", &a[0]);        for(int i=1; i<num; i++)        {            scanf("%d", &a[i]);            vis[abs(a[i]-a[i-1])] = true;        }        if(Judge())            printf("Jolly\n");        else            printf("Not jolly\n");    }    return 0;}