uva10038 Jolly Jumpers

简介: uva10038 Jolly Jumpers
#include <cstdio>#include <cmath>#include <cstring>usingnamespacestd;
intarray[3001];
intcount[3000];
intmain()
{
intn;
while (scanf("%d", &n) !=EOF)
    {
memset(count, 0, sizeof(count));
for (inti=0; i<n; i++)
        {
scanf("%d", &array[i]);
        }
intflag=0;
for (inti=1; i<n; i++)
        {
inttemp= (int)(fabs(array[i] -array[i-1]));
if (temp>0&&temp<n)
count[temp]++;
else            {
flag=1;
break;
            }
        }
if (flag)
printf("Not jolly/n");
else        {
for (inti=1; i<n; i++)
            {
if (count[i] !=1)
                {
flag=1;
break;
                }
            }
if (flag)
printf("Not jolly/n");
elseprintf("Jolly/n");
        }
    }
return0;
}
目录
相关文章
|
人工智能 Java
hdu 1712 ACboy needs your help
ACboy这学期有N门课程,他计划花最多M天去学习去学习这些课程,ACboy再第i天学习第j门课程的收益是不同的,求ACboy能获得的最大收益。
115 0
|
Java 人工智能 Windows
|
人工智能 Java 安全
HDU 1039 Easier Done Than Said?
Easier Done Than Said? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12751    Accepted Subm...
782 0
|
Java BI
HDU 1412 {A} + {B}
{A} + {B} Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19833    Accepted Submission(s): 8245 Problem Description 给你两个集合,要求{A} + {B}.
814 0

热门文章

最新文章