K - After Training CodeForces 195B-找规律

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
	int n,m;
	cin>>n>>m;
	int i;
	if (m%2==1)
	{
		int mid=m/2+1;
		for (i=1;i<=n;i++)
		{
			int yushu=i%m;
			if (yushu==0)
				yushu=m;
			if (yushu%2==0)
			{
				int num=yushu/2;
				printf("%d\n",mid-num);
			}
			else
				if (yushu%2==1)
				{
					int num=yushu/2;
					printf("%d\n",mid+num);
				} 
		}
	}
	else
		if (m%2==0)
		{
			int mid=m/2;
			for (i=1;i<=n;i++)
			{
				int yushu=i%m;
				if (yushu==0)
				yushu=m;
				if (yushu%2==0)
				{
					int num=yushu/2;
					printf("%d\n",mid+num);
				}
				else
					if (yushu%2==1)
					{
						int num=yushu/2;
						printf("%d\n",mid-num);
					} 
			}
			
		}
		
		
		
		
		
		return 0;
}