E - After Training CodeForces - 195B（模拟 数学 规律）

After a team finished their training session on Euro football championship, Valeric was commissioned to gather the balls and sort them into baskets. Overall the stadium has n balls and m baskets. The baskets are positioned in a row from left to right and they are numbered with numbers from 1 to m, correspondingly. The balls are numbered with numbers from 1 to n.

Valeric decided to sort the balls in the order of increasing of their numbers by the following scheme. He will put each new ball in the basket with the least number of balls. And if he’s got several variants, he chooses the basket which stands closer to the middle. That means that he chooses the basket for which is minimum, where i is the number of the basket. If in this case Valeric still has multiple variants, he chooses the basket with the minimum number.

For every ball print the number of the basket where it will go according to Valeric’s scheme.

Note that the balls are sorted into baskets in the order of increasing numbers, that is, the first ball goes first, then goes the second ball and so on.

Input
The first line contains two space-separated integers n, m (1 ≤ n, m ≤ 105) — the number of balls and baskets, correspondingly.

Output
Print n numbers, one per line. The i-th line must contain the number of the basket for the i-th ball.

Examples
Input
4 3
Output
2
1
3
2
Input
3 1
Output
1
1
1

这个题真的挺蒙的，一开始以为是模拟，就是那个|（m+1）/2-i|的意思是啥，就试着做了做，加了好多判定条件，结果有的可以过，有的跑不出来，有的直接wa。后来想了想，就是找规律嘛
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;

const int maxx=1e5+10;
int n,m;
int a[maxx];

int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int cnt=0;
		int ans=0;
		while(n--)//模拟球数
		{
			if((m-ans)%2)
			cout<<(m+ans+1)/2<<endl;
			else cout<<(m-ans)/2<<endl;
			++cnt;
			ans=cnt%m;
		}
	}
}

自己在纸上演算一遍。。】
努力加油a啊，(^o)/~