codeforces 459C Pashmak and Buses

C. Pashmak and Buses

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school which has n students. The school planned to take the students to d different places for d days (each day in one place). Each day the company provides all the buses for the trip. Pashmak has to arrange the students in the buses. He wants to arrange the students in a way that no two students become close friends. In his ridiculous idea, two students will become close friends if and only if they are in the same buses for all d days.

Please help Pashmak with his weird idea. Assume that each bus has an unlimited capacity.

Input

The first line of input contains three space-separated integers n, k, d (1 ≤ n, d ≤ 1000; 1 ≤ k ≤ 10⁹).

Output

If there is no valid arrangement just print -1. Otherwise print d lines, in each of them print n integers. The j-th integer of the i-th line shows which bus the j-th student has to take on the i-th day. You can assume that the buses are numbered from 1 to k.

Sample test(s)

input

3 2 2

output

1 1 2  1 2 1 

input

3 2 1

output

-1

Note

Note that two students become close friends only if they share a bus each day. But the bus they share can differ from day to day

题意：输入n k d，n个人坐k辆车过d天，要求没有2个人是每天都在一辆车上的。若不可能，输出-1；否则输出每个人每天坐哪趟车。

题解：

一个人在全部d天中每天坐哪辆车，可以表示为d位k进制数x。那么2个人每天都在同一辆车上，就是两个人的x相等。所以我们只要构造出n个不同的d位k进制数就行。

先判若d^k<n则无解。

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
int f[1005];
int main()
{
	int i,j;
	int n,k,d;
	while(~scanf("%d%d%d",&n,&k,&d))
	{
		//printf("%d   %d  %d**
",n,k,d);
		ll now=1;
		int fg=0;
		for(i=1;i<=d;i++)
		{
			now=now*k;
			if(now>=n)
			{
				fg=1;
				break;
			}
		}
		if(!fg)
		{
			printf("-1
");
			continue;
		}
		for(i=1;i<=n;i++)
			f[i]=i-1;
		for(i=1;i<=d;i++)
		{
			for(j=1;j<=n;j++)
			{
				printf("%d%s",f[j]%k+1,j==n?"
":" ");
				f[j]/=k;
			}
		}
	}
}