ZOJ 1879 Jolly Jumpers
2015-03-26 23:17
120 查看
该题就是 看1到n-1 看前后差的绝对值 是否只出现过一次。、
#include<stdio.h> #include<stdlib.h> #include<string.h> int n[3005],vis[3005]; int main() { int t,i,tem; while(scanf("%d",&t)!=EOF) { memset(vis,0,sizeof(vis)); for(i=0;i<t;i++) scanf("%d",&n[i]); for(i=0;i<t-1;i++) { tem=abs(n[i+1]-n[i]); vis[tem]=1; } for(i=1;i<=t-1;i++) if(vis[i]==0) break; if(i<=t-1) printf("Not jolly\n"); else printf("Jolly\n"); } return 0; }
相关文章推荐
- ZOJ 1879 — Jolly Jumpers(C++)
- zoj 1879 Jolly Jumpers
- ZOJ Problem Set–1879 Jolly Jumpers
- ZOJ 1879 Jolly Jumpers
- ZOJ 1879 Jolly Jumpers
- zoj 1879 || poj 2575 Jolly Jumpers(水~)
- zoj 1879 Jolly Jumpers
- zoj 1879 Jolly Jumpers
- zoj 1879 Jolly Jumpers
- POJ2575 ZOJ1879 UVA10038 Jolly Jumpers【序列】
- UVa 10038 / POJ 2575 / ZOJ 1879 Jolly Jumpers (water ver.)
- ZOJ 1879题解 一道水题没啥好说的,代码贴在这,一开始WA了几次因为题意理解错误,只要报1到n-1每个数都出现一遍就行了
- 1879_Jolly Jumpers
- ZOJ-1879
- ZOJ 1879
- zoj 1879
- POJ 2575 && ZOJ 1879 Jolly Jumper(整数序列)
- ZOJ Problem Set - 1879
- zoj1879
- zoj 2326 Tangled in Cables