Codeforces Round #261 (Div. 2) C. Pashmak and Buses
来源:互联网 发布:java按键监听器 编辑:程序博客网 时间:2024/05/19 02:44
Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school which hasn 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 alld days.
Please help Pashmak with his weird idea. Assume that each bus has an unlimited capacity.
The first line of input contains three space-separated integers n, k, d (1 ≤ n, d ≤ 1000; 1 ≤ k ≤ 109).
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.
3 2 2
1 1 2 1 2 1
3 2 1
-1
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个d位k进制数
#include <cstdlib>#include <cctype>#include <cstring>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <string>#include <iostream>#include <map>#include <set>#include <queue>#include <stack>#include <bitset>using namespace std;#define PB push_back#define MP make_pair#define REP(i,n) for(int i=0;i<(n);++i)#define FOR(i,l,h) for(int i=(l);i<=(h);++i)#define DWN(i,h,l) for(int i=(h);i>=(l);--i)#define CLR(vis,pos) memset(vis,pos,sizeof(vis))#define PI acos(-1.0)#define INF 0x3f3f3f3f#define LINF 1000000000000000000LL#define eps 1e-8typedef long long ll;int n,k,d;int a[1234][1234];int solve(){ if((double)n>pow((double)k,d)) return 0; CLR(a,0); REP(i,n){ int x=i,j=0; while(x){ a[i][j++]=x%k; x/=k; } } return 1;}int main(){#ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);#endif while(cin>>n>>k>>d){ if(!solve()) puts("-1"); else{ REP(i,d){ printf("%d",a[0][i]+1); FOR(j,1,n-1){ printf(" %d",a[j][i]+1); } puts(""); } } } return 0;}
- Codeforces Round #261 (Div. 2) C. Pashmak and Buses
- Codeforces Round #261 (Div. 2) C. Pashmak and Buses
- Codeforces Round #261 (Div. 2) C. Pashmak and Buses
- Codeforces Round #261 (Div. 2)——Pashmak and Buses
- Codeforces #261 (Div. 2) C. Pashmak and Buses(数学)
- codeforces C. Pashmak and Buses
- 【CODEFORCES】 C. Pashmak and Buses
- codeforces #261 C题 Pashmak and Buses(瞎搞)
- Codeforces problem 459C Pashmak and Buses
- Codeforces 459C Pashmak and Buses(构造)
- C - Pashmak and Buses
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden (水题)
- Codeforces Round #261 (Div. 2) E. Pashmak and Graph
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden
- Codeforces Round #261 (Div. 2)B. Pashmak and Flowers
- Codeforces Round #261 (Div. 2) B.Pashmak and Flowers
- Codeforces Round #261 (Div. 2)——Pashmak and Graph
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden【水】
- linux下如何使用Mysql
- hda and hdb
- ubuntu 终端下快捷键
- OpenMP实现生产者消费者模型
- Hdu 4111 Alice and Bob(博弈+记忆化搜索)
- Codeforces Round #261 (Div. 2) C. Pashmak and Buses
- leetcode - Candy
- USB端口数据分析
- nextLine()和next()的区别和使用方法
- 怎样在Word中插入代码并保持样式不变
- 获取JAVA文件路径
- HDU 3371 Connect the Cities
- struts与spring整合的原理
- Java实现快速排序