2015.cpp

杭州电子科技大学ACM-OJ系统的部分代码

/*#include<iostream>
using namespace std;
int a[100];
int main()
{
	int n,m;
	while(cin>>n>>m)
	{
		if(n<m||n<=0||m<=0)
		{
			exit(0);
		}
		int i,j,k,p=0,ave=0;
		for(i=1;i<=n;i++)
		{
			a[i]=2*i;
		}
	    j=n/m;
		k=n%m;
	//	if(k==0)
	//	{
			while(j)
			{
				p+=m;
			    ave=2*p-1;
			    j--;
				cout<<ave<<" ";
			}
	//	}
		else
		{
            while(j)
			{
				p+=m;
			    ave=2*p-1;
			    j--;
				cout<<ave<<" ";	
			}
		if(k!=0)
			cout<<" "<<2*n-k+1;
	//	}
		
		cout<<endl;
	}
	return 0;
}*/



#include<iostream>
using namespace std;
int a[100]={2,4};
int b[100];
int main()
{
	int i,n,m;
	while(cin>>n>>m)
	{
		for(i=1;i<n;i++)
			a[i]=a[i-1]+2;
		if(n%m==0)
		{
        for(i=0;i<n/m-1;i++) 
		{
			b[i]=(a[i*m]+a[i*m+m-1])/2;
            cout<<b[i]<<" ";
		}
            b[n/m-1]=(a[n-m]+a[n-1])/2;
		cout<<b[n/m-1]<<endl;
		}
		else
		{
			for(i=0;i<n/m;i++) 
		{
			b[i]=(a[i*m]+a[i*m+m-1])/2;
            cout<<b[i]<<" ";
		}
            b[n/m]=(a[n/m*m]+a[n-1])/2;
		cout<<b[n/m]<<endl;
		}
	}
	return 0;
}