Codeforces Beta Round #49 (Div. 2)-C. Little Frog
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mounds is one meter. Vasya wants to visit all the mounds in one day; besides, he wants to visit each one exactly once. For that he makes a route plan, to decide the order in which to jump on the mounds. Vasya can pick any mound as the first one. He thinks it boring to jump two times at the same distance. That's why he wants any two jumps on his route to have different lengths. Help Vasya the Frog and make the plan for him.
The single line contains a number n (1 ≤ n ≤ 104) which is the number of mounds.
Print n integers pi (1 ≤ pi ≤ n) which are the frog's route plan.
- All the pi's should be mutually different.
- All the |pi–pi + 1|'s should be mutually different (1 ≤ i ≤ n - 1).
If there are several solutions, output any.
2
1 2
3
1 3 2
水题:只需前后交替输出
1 /****************************** 2 AC 3 date£º2013-10-9-17:00 4 *********************************/ 5 6 7 #include <iostream> 8 #include<stdio.h> 9 #include<string.h> 10 #include<math.h> 11 12 using namespace std; 13 14 int main() 15 { 16 int n; 17 scanf("%d",&n); 18 int i; 19 for(i=1;i<=n/2;i++) 20 { 21 if(i==(int)(n/2)) 22 printf("%d %d",i,n-i+1); 23 else 24 printf("%d %d ",i,n-i+1); 25 } 26 if(n%2==0) 27 printf("\n"); 28 else if(n==1) 29 printf("1\n"); 30 else 31 printf(" %d\n",n/2+1); 32 return 0; 33 }
作者: 点A点C
出处: http://www.cnblogs.com/ACshasow/>
关于作者:游戏开发、算法研究,请多多赐教!
本文版权归作者(点A点C)和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出, 原文链接 如有问题, 可邮件(572779130@qq.com)咨询.