zoj 1879 || poj 2575 Jolly Jumpers(水~)
2010-07-21 18:08
253 查看
意思就是,输入一个数n,然后输入n个数,两两之差的绝对值是不是从1到n-1。。。把1到n-1出现一遍就OK了。刚开始还以为得按顺序出现。。。查了查那个take on。。。米有这含义。。。这个博客纯粹当作业本了。。。好水的都发到这。。。就这样吧~~~~~
#include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> int diff[3002]; int main(void) { int n,x,y,check,i; while(scanf("%d",&n)!=EOF) { check = 1; memset(diff,0,sizeof(diff)); if( n==1 ) { scanf("%d",&x); printf("Jolly/n"); continue; } scanf("%d",&x); for(i=1; i<n; i++) { scanf("%d",&y); diff[abs(x-y)] = 1; x = y; } for(i=1; i<n; i++) if(diff[i] == 0) check = 0; if( check ) printf("Jolly/n"); else printf("Not jolly/n"); } system("pause"); return 0; }
相关文章推荐
- POJ 2575 && ZOJ 1879 Jolly Jumper(整数序列)
- POJ 2575 Jolly Jumpers(我的水题之路——数组绝对差值为1到n-1)
- poj2575-Jolly Jumpers
- poj解题报告——poj 2575 Jolly Jumpers
- ZOJ 1879 Jolly Jumpers
- poj 2575 Jolly Jumpers
- zoj 1879 Jolly Jumpers
- ZOJ Problem Set–1879 Jolly Jumpers
- ZOJ 1879 — Jolly Jumpers(C++)
- POJ2575 ZOJ1879 UVA10038 Jolly Jumpers【序列】
- zoj 1879 Jolly Jumpers
- poj 2575 Jolly Jumpers
- POJ2575 Jolly Jumpers
- POJ 2575 Jolly Jumpers(简单题)
- POJ 2575 Jolly Jumpers(水~)
- ZOJ 1879 Jolly Jumpers
- ZOJ 1879 Jolly Jumpers
- zoj 1879 Jolly Jumpers
- poj 2575 Jolly Jumpers
- POJ 2575 Jolly Jumpers 解题报告