codeforces Round #261(div2) C解题报告_html/css_WEB-ITnose
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 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.
Input
The first line of input contains three space-separated integers n,?k,?d (1?≤?n,?d?≤?1000; 1?≤?k?≤?109).
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天,每天每个人可以选择任意一辆公交乘坐,最后要你求每天每个人选择的公交并输出,要求所有的d天中,不能至少有两个人一直在同一辆公交上。
解法:
把这题抽象一下,每个人,在1~K个数中选数字,组成d长度的序列,要求每个序列不能完全相同,数字可以重复选。
进一步抽象一下,每个人的乘坐公交的序列,就是d位k进制数,最多可以分配的序列个数为 k^d。如若 n
举个例子进一步说说明:
n = 8, k = 3, d = 4。 这里的0表示标记为1的公交,1为标记为2的公交,以此类推
第一个人的序列: 0, 0, 0, 0
第二个人的序列: 0, 0, 0, 1
第三个人的序列: 0, 0, 0, 2
第四个人的序列: 0, 0, 1, 0
第五个人的序列: 0, 0, 1, 1
第六个人的序列: 0, 0, 1, 2
第七个人的序列: 0, 0, 2, 0
第八个人的序列: 0, 0, 2, 1
代码:
#include <cstdio>#include <iostream>#define LL long long#define N_max 1234using namespace std;int d, n, k;int f[N_max][N_max];void init() { cin >> n >> k >> d;}bool check() { LL cnt=1; for (int i = 1; i = k) { f[i][j] -= k; tmp = 1; } else tmp = 0; } } for (int j = 1; j <p></p> </iostream></cstdio>

熱AI工具

Undresser.AI Undress
人工智慧驅動的應用程序,用於創建逼真的裸體照片

AI Clothes Remover
用於從照片中去除衣服的線上人工智慧工具。

Undress AI Tool
免費脫衣圖片

Clothoff.io
AI脫衣器

Video Face Swap
使用我們完全免費的人工智慧換臉工具,輕鬆在任何影片中換臉!

熱門文章

熱工具

記事本++7.3.1
好用且免費的程式碼編輯器

SublimeText3漢化版
中文版,非常好用

禪工作室 13.0.1
強大的PHP整合開發環境

Dreamweaver CS6
視覺化網頁開發工具

SublimeText3 Mac版
神級程式碼編輯軟體(SublimeText3)

HTML適合初學者學習,因為它簡單易學且能快速看到成果。 1)HTML的學習曲線平緩,易於上手。 2)只需掌握基本標籤即可開始創建網頁。 3)靈活性高,可與CSS和JavaScript結合使用。 4)豐富的學習資源和現代工具支持學習過程。

HTML定義網頁結構,CSS負責樣式和佈局,JavaScript賦予動態交互。三者在網頁開發中各司其職,共同構建豐富多彩的網站。

WebDevelovermentReliesonHtml,CSS和JavaScript:1)HTMLStructuresContent,2)CSSStyleSIT和3)JavaScriptAddSstractivity,形成thebasisofmodernWebemodernWebExexperiences。

GiteePages靜態網站部署失敗:404錯誤排查與解決在使用Gitee...

AnexampleOfAstartingTaginHtmlis,beginSaparagraph.startingTagSareEssentialInhtmlastheyInitiateEllements,defiteTheeTheErtypes,andarecrucialforsstructuringwebpages wepages webpages andConstructingthedom。

實現圖片點擊後周圍圖片散開並放大效果許多網頁設計中,需要實現一種交互效果:點擊某張圖片,使其周圍的...

HTML、CSS和JavaScript是Web開發的三大支柱。 1.HTML定義網頁結構,使用標籤如、等。 2.CSS控製網頁樣式,使用選擇器和屬性如color、font-size等。 3.JavaScript實現動態效果和交互,通過事件監聽和DOM操作。

網頁批註功能的Y軸位置自適應算法本文將探討如何實現類似Word文檔的批註功能,特別是如何處理批註之間的間�...
