solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int n, d, k;
vector<vector<int>> seq;
void gen(vector<int>& cur) {
if (seq.size() >= n) return;
if (cur.size() == d) {
seq.push_back(cur);
return;
}
for (int c = 1; c <= min(k, n) && seq.size() < n; c++) {
cur.push_back(c);
gen(cur);
cur.pop_back();
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> k >> d;
vector<int> cur;
cur.reserve(d);
gen(cur);
if (seq.size() < n) {
cout << -1;
return 0;
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << seq[j][i] << " ";
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, k, d;
long long arr[1011][1011];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> d;
long long tot = 1LL;
bool f = false;
for (int i = 1; i <= d; ++i) {
tot *= k;
if (tot >= n) {
f = true;
break;
}
}
if (!f) {
cout << "-1" << '\n';
return 0;
}
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= d; ++j) arr[i][j] = arr[i - 1][j];
for (int j = d; j >= 1; --j) {
arr[i][j] = (arr[i][j] + 1) % k;
if (arr[i][j]) break;
}
}
for (int j = 1; j <= d; ++j) {
for (int i = 1; i <= n; ++i) cout << arr[i][j] + 1 << " ";
cout << '\n';
}
}
| 9 | CPP |
from sys import stdin, stdout, setrecursionlimit
input = stdin.readline
# import string
# characters = string.ascii_lowercase
# digits = string.digits
# setrecursionlimit(int(1e6))
# dir = [-1,0,1,0,-1]
# moves = 'NESW'
inf = float('inf')
from functools import cmp_to_key
from collections import defaultdict as dd
from collections import Counter, deque
from heapq import *
import math
from math import floor, ceil, sqrt
def geti(): return map(int, input().strip().split())
def getl(): return list(map(int, input().strip().split()))
def getis(): return map(str, input().strip().split())
def getls(): return list(map(str, input().strip().split()))
def gets(): return input().strip()
def geta(): return int(input())
def print_s(s): stdout.write(s+'\n')
def solve():
n, k, d = geti()
num = 1
for i in range(1, d+1):
num *= k
if num >= n:
break
else:
print(-1)
return
def convert(prev):
ans = prev[:]
i = d - 1
ans[i] += 1
while ans[i] > k and i > 0:
ans[i-1] += 1
ans[i] = 1
i -= 1
return ans
ans = [[1]*d]
for i in range(1, n+1):
ans.append(convert(ans[i-1]))
# print(ans)
for i in range(d):
print(*[ans[j][i] for j in range(n)])
# 1 2 1 2 1 2 2
# 2 1 2 1 1 2 2
# 1 2 2 1 1 2 1
#
#
# 2 1 1 1 1 2 1 1
# 1 2 1 1 1 2 2 1
# 1 1 2 1 1 1 2 1
# 1 1 1 2 1 1 1 1
# 1 1 1 1 2 1 1 1
if __name__=='__main__':
solve()
| 9 | PYTHON3 |
n,k,d=map(int,input().split())
if n>k**d:print(-1);exit(0)
K=1
for j in range(d):
print(" ".join([str(i//K%k +1) for i in range(n)]))
K*=k
# Made By Mostafa_Khaled | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int bus[1001][1001];
int main() {
long long int n, k, d, o = 1, p, i, j, g, ar;
bool check = true;
cin >> n >> k >> d;
for (i = 0; i < d + 1; i++) {
ar = 0;
for (j = 0; j < n; j++) {
if (j % o == 0 && j != 0) ar = (ar + 1) % k;
bus[i][j] = ar;
}
if (o * k < n)
o *= k;
else
o = n;
}
if (k == 1) check = false;
for (i = 0; i < n - 1; i++)
if (bus[d][i] != bus[d][i + 1]) check = false;
if (!check && !(n == 1))
cout << -1 << "\n";
else
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
cout << bus[i][j] + 1 << " ";
}
cout << "\n";
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, d;
long long int k;
cin >> n >> k >> d;
int **A;
A = (int **)malloc(d * sizeof(int *));
int i, j;
for (i = 0; i < d; ++i) {
A[i] = (int *)malloc(n * sizeof(int));
}
int flag = 1;
long long int pw = 1;
for (i = 0; i < d; ++i) {
pw *= k;
if (pw >= n) {
flag = 0;
break;
}
}
if (flag) {
cout << "-1";
return 0;
}
long long int jump, count;
jump = 1;
int num;
for (i = 0; i < d; ++i) {
count = jump;
num = 0;
for (j = 0; j < n; ++j) {
A[i][j] = num;
count--;
if (count == 0) {
count = jump;
num++;
if (num == k) num = 0;
}
}
jump *= k;
}
for (i = 0; i < d; ++i) {
for (j = 0; j < n; ++j) {
cout << A[i][j] + 1 << " ";
}
cout << endl;
}
return 0;
}
| 9 | CPP |
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
def main():
# if numOfBuses >= numOfStudents: YES
# if numOfPermutations (numOfDays**numOfStudents) >= numOfStudents: YES
# at least one student will have a different permutation than
# any other
# for each student -> represent it in base numOfBuses and then
# turn it into numOfBuses'ry (like binary)
# loop -> get the mod of the number and divide it by numOfBuses
# until the result is not integer
# print the accumulated mods for each student
numOfStudents, numOfBuses, numOfDays = [ int(x) for x in input().split() ]
if numOfBuses**numOfDays >= numOfStudents:
studentSequences = [
[1] * numOfDays
for student in range(numOfStudents)
]
for student in range(numOfStudents):
number = student
for day in range(numOfDays):
remainder = number % numOfBuses
studentSequences[student][day] = remainder+1
number //= numOfBuses
if number == 0: break
for day in range(numOfDays):
print(' '.join(
[ str(studentSequences[student][day])
for student in range(numOfStudents)]
))
else:
print(-1)
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
input = lambda: sys.stdin.readline().rstrip("\r\n")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep = kwargs.pop("sep", " ")
file = kwargs.pop("file", sys.stdout)
atStart = True
for x in args:
if not atStart:
file.write(sep)
file.write(str(x))
atStart = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
main()
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int p[1000][1000];
int main() {
int n, k, d;
cin >> n >> k >> d;
k = min(k, 1000);
for (int i = 1; i <= k; i++) {
int flag = 0, tmp = 1;
for (int j = 0; j < d; j++)
if ((tmp *= i) >= n) {
flag = 1;
break;
}
if (flag) {
k = i;
break;
}
if (i == k) {
cout << -1 << endl;
return 0;
}
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) p[i][j] = p[i - 1][j];
int t = d - 1;
while (t >= 0 && p[i][t] == k - 1) {
p[i][t] = 0;
t--;
}
p[i][t]++;
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << p[j][i] + 1 << " ";
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a == 0 || b == 0) return max(a, b);
if (b % a == 0) return a;
return gcd(b % a, a);
}
int64_t arr[1001][1001];
int main() {
int64_t n, k, d;
cin >> n >> k >> d;
int cn = 1, fl = 0;
int64_t an = 1;
if (k < n) {
int64_t tmp = 1;
while (1) {
tmp *= k;
if (tmp > n) {
break;
}
if (cn == d) break;
cn++;
}
if (n > tmp) {
fl = 1;
}
}
if (fl)
cout << "-1";
else {
int x1 = 0;
for (int64_t i = 1; i < n; i++) {
for (int j = 0; j < d; j++) arr[j][i] = arr[j][i - 1];
for (int64_t j = d - 1; j >= 0; j--) {
arr[j][i] = (arr[j][i - 1] + 1) % k;
if (arr[j][i]) break;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << arr[i][j] + 1 << " ";
}
cout << "\n";
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ls[1002];
int ans[1002][1002];
int st[1002];
int fin, k, d, num;
void sol(int now) {
if (now > d) {
fin--;
for (int j = 1; j < now; j++) ans[num][j] = st[j];
num++;
return;
}
for (int j = 1; j <= k; j++) {
st[now] = j;
sol(now + 1);
if (!fin) return;
}
}
bool bigger(int a, int b, int d) {
if (a == 1) return b == 1;
int c = a;
while (--d) {
if (a >= b) return true;
a = a * c;
}
return a >= b;
}
int main() {
int n;
scanf("%d %d %d", &n, &k, &d);
if (!bigger(k, n, d))
cout << -1;
else {
fin = n;
num = 1;
sol(1);
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
printf("%d ", ans[j][i]);
}
printf("\n");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int N = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
const int INF = 2e9;
const long long BIG = 1e11;
const int P = 1000;
long long k, d, a[N], n;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
int cur = 1;
cin >> n >> k >> d;
long long res = k;
for (int i = 1; i < d; i++) {
res *= k;
if (res >= n) break;
}
if (res < n) cout << -1, exit(0);
for (int i = 0; i < n; i++) a[i] = i;
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << (a[j] % k) + 1 << ' ', a[j] /= k;
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, d;
long long int k;
vector<vector<long long int> > grid;
vector<long long int> curr;
void dfs(int D) {
if (D == d) {
grid.push_back(curr);
return;
}
for (int i = 1; i <= k; i++) {
curr.push_back(i);
dfs(D + 1);
if ((int)grid.size() >= n) return;
curr.pop_back();
}
}
int main() {
cin >> n >> k >> d;
double l = d;
l *= log(k);
double r = log(n);
if ((r - l) > 0.0000000001) {
cout << -1;
} else {
dfs(0);
for (int j = 0; j < d; j++, cout << endl) {
for (int i = 0; i < n; i++) {
cout << grid[i][j] << " ";
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > V;
int n, k, d, pos = 1, c = 0;
vector<int> tmp;
void calc(int id) {
if (id == d) {
V.push_back(tmp);
return;
}
for (int i = 1; i <= k; i++) {
tmp[id] = i;
if (V.size() == n) return;
calc(id + 1);
}
}
int main() {
scanf("%d%d%d", &n, &k, &d);
tmp.resize(d);
long long tmp1 = 1;
int c = 0;
for (int i = 0; i < d; i++) {
tmp1 *= (long long)k;
if (tmp1 >= n) {
c = 1;
break;
}
}
if (!c) {
printf("-1\n");
return 0;
}
calc(0);
for (int j = 0; j < d; j++) {
for (int i = 0; i < n; i++) {
printf("%d ", V[i][j]);
}
printf("\n");
}
return 0;
}
| 9 | CPP |
import sys
input=sys.stdin.readline
n,k,d=map(int,input().split())
if n>k**d:
print(-1)
exit()
x=1
for i in range(d):
ans=[1+i//x%k for i in range(n)]
print(*ans)
x*=k | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) { return n | (1LL << i); }
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
inline void normal(long long &a) {
a %= 1000000007;
(a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
a %= 1000000007;
b %= 1000000007;
normal(a);
normal(b);
return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
a %= 1000000007;
b %= 1000000007;
normal(a);
normal(b);
return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
a %= 1000000007;
b %= 1000000007;
normal(a);
normal(b);
a -= b;
normal(a);
return a;
}
inline long long modPow(long long b, long long p) {
long long r = 1LL;
while (p) {
if (p & 1) r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
return modMul(a, modInverse(b));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, k, d;
cin >> n >> k >> d;
long long p = 1LL;
bool ok = 0;
for (int i = 1; i <= d; ++i) {
p *= (long long)k;
if (n <= p) {
ok = 1;
break;
}
}
if (!ok) {
cout << "-1" << '\n';
return 0;
}
long long ans[n][d];
for (int i = 0; i < d; ++i) ans[0][i] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j < d; ++j) ans[i][j] = ans[i - 1][j];
for (int j = d - 1; j >= 0; --j) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) break;
}
}
for (int i = 0; i < d; ++i) {
for (int j = 0; j < n; ++j) {
if (j != 0) cout << " ";
cout << ans[j][i] + 1;
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
n,k,d=map(int,input().split())
if n>k**d:print(-1);exit(0)
r=1
for j in range(d):
print(" ".join([str(i//r%k +1) for i in range(n)]));r*=k | 9 | PYTHON3 |
n, k, d = map(int, input().split())
if k < n ** (1 / d):
print(-1)
else:
k1 = 1
for i in range(d):
print(" ".join(map(str, [(j // k1 % k) + 1 for j in range(n)])))
k1 = k * k1
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k, d;
cin >> n >> k >> d;
int t = 0;
int K = 1;
while (K <= 1000 and t < d) {
K *= k;
t++;
}
if (n > K) {
cout << -1 << "\n";
return 0;
}
vector<int> kid(n);
for (int i = 0; i < n; ++i) {
kid[i] = i;
}
for (int i = 0; i < d; ++i) {
for (int j = 0; j < n; ++j) {
cout << (kid[j] % k + 1) << " ";
kid[j] /= k;
}
cout << "\n";
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
long long int n, k, d;
int anss[1001][1001];
int main() {
bool ans = false;
cin >> n >> k >> d;
long long int temp = 1;
for (int i = 1; i <= d; ++i) {
temp *= k;
if (temp >= n) {
ans = true;
break;
}
}
if (!ans) {
cout << -1 << endl;
} else {
for (int i = 1; i <= d; ++i) anss[i][1] = 1;
for (int s = 2; s <= n; ++s) {
int carry = 1;
for (int i = 1; i <= d; ++i) {
if (carry == 1) {
anss[i][s] = (anss[i][s - 1] % k + carry);
carry = (anss[i][s - 1] == k);
} else {
anss[i][s] = anss[i][s - 1];
carry = 0;
}
}
}
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) cout << anss[i][j] << " ";
cout << endl;
}
}
}
| 9 | CPP |
n,k,d=map(int,input().split())
if(n>pow(k,d)):
print(-1)
else:
temp=[]
ans=[1]*d
temp.append(ans)
m=n
m-=1
count=1
r=1
while(m):
ans=[0 for i in range(d)]
count=r
for i in range(d):
ans[len(ans)-1-i]=count%k
count=count//k
for i in range(len(ans)):
ans[i]+=1
temp.append(ans)
r+=1
m-=1
for i in range(d):
for j in range(len(temp)):
print(temp[j][i],end=" ")
print(' ')
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, di[1000 + 10][1000 + 10];
int main() {
scanf("%d%d%d", &n, &k, &d);
for (int i = 0; i < n; ++i) {
int l = 0;
bool f = 0;
for (int j = i; j; j /= k) {
di[i][++l] = j % k;
if (l > d) {
f = 1;
break;
}
}
if (f) {
puts("-1");
return 0;
}
}
for (int i = d; i; --i)
for (int j = 0; j < n; ++j)
printf("%d%c", di[j][i] + 1, j == n - 1 ? '\n' : ' ');
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, d;
cin >> n >> k >> d;
long long tmp = 1;
bool check = false;
for (int i = 0; i < d; i++) {
tmp *= k;
if (tmp >= n) {
check = true;
break;
}
}
if (!check) {
cout << -1 << endl;
return 0;
}
int temp[d];
int ans[n][d];
int ind = d - 1;
for (int i = 0; i < d; i++) temp[i] = 1;
for (int i = 0; i < n; i++) {
for (int j = d - 1; j >= 0; j--) {
ans[i][j] = temp[j];
if (ans[i][j] > k) {
ans[i][j] = 1;
ans[i][j - 1] += 1;
}
}
int j = d - 1;
while (j >= 0 && temp[j] == k) {
temp[j] = 1;
j--;
}
if (j >= 0) {
++temp[j];
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << ans[j][i] << ' ';
cout << '\n';
}
return 0;
}
| 9 | CPP |
n,k,d=map(int,input().split(" "))
if n>pow(k,d):
print(-1)
else:
raw = [' ']*n
table = [[1]*d]
p = 1
for i in range(d):
cv = 1
for j in range(n):
if j % p == 0 and j != 0:
cv = cv + 1
if cv == k+1:
cv = 1
raw[j]= str(cv)
print(' '.join(raw))
p = p * k
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void _fill_int(int* p, int val, int rep) {
int i;
for (i = 0; i < rep; i++) p[i] = val;
}
signed long long N, K, D;
int mat[1001][1001];
void dfs(int d, int l, int r) {
if (d >= D) return;
int i;
if (r - l <= K) {
for (i = 0; i < r - l; i++) mat[d][i + l] = i;
} else {
int st = (r - l + (K - 1)) / K;
for (i = 0; i * st + l < r; i++) {
int j;
for (j = 0; j < st; j++)
if (l + i * st + j < r) mat[d][l + i * st + j] = i;
dfs(d + 1, l + i * st, min(l + (i + 1) * st, r));
}
}
}
void solve() {
int f, i, j, k, l, x, y;
cin >> N >> K >> D;
if (K >= N) {
for (i = 0; i < D; i++) {
for (j = 0; j < N; j++) (void)printf("%d ", j + 1);
(void)printf("\n");
}
return;
}
signed long long t = 1;
for (i = 0; i < D; i++) {
t *= K;
if (t >= N) break;
}
if (i == D) return (void)printf("-1\n");
dfs(0, 0, N);
for (i = 0; i < D; i++) {
for (j = 0; j < N; j++) (void)printf("%d ", mat[i][j] + 1);
(void)printf("\n");
}
}
int main(int argc, char** argv) {
string s;
if (argc == 1) ios::sync_with_stdio(false);
for (int i = 1; i < argc; i++) s += argv[i], s += '\n';
for (int i = s.size() - 1; i >= 0; i--) ungetc(s[i], stdin);
solve();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int n, k, d;
int a[1005][1005];
int main() {
n = read();
k = read();
d = read();
long long tmp = 1;
for (int i = 1; i <= d; i++) {
tmp *= k;
if (tmp >= n) break;
}
if (tmp < n) {
puts("-1");
return 0;
}
for (int i = 1; i <= d; i++) a[i][1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= d; j++) a[j][i] = a[j][i - 1];
int j = d;
while (a[j][i] == k) j--;
a[j][i]++;
for (int q = j + 1; q <= n; q++) a[q][i] = 1;
}
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
puts("");
}
return 0;
}
| 9 | CPP |
In = lambda : map(int,input().split())
n , k ,d = In()
if(n > k**d):
print (-1)
else :
k1 = 1
for i in range(d):
print(" ".join(map(str, [(j // k1 % k) + 1 for j in range(n)])))
k1 = k1 * k;
| 9 | PYTHON3 |
import sys
def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))
arr = get_ints()
n = arr[0]
k = arr[1]
d = arr[2]
maxs = pow(k,d)
if n > maxs:
print(-1)
else:
ans = []
count = 0
strs = ""
numarr = []
countarr = []
for i in range(d):
numarr.append(1)
countarr.append(0)
countarr[0] = -1
#ans.append(strs)
flag = 1
for ii in range(n):
countarr[0] += 1
flag = 0
digit = countarr[0] +numarr[0]
if digit <= k :
subsubarr = []
for i in range(d):
subsubarr.append(str(countarr[i] + numarr[i] ) )
subsubarr = subsubarr[::-1]
subans = ""
for subss in subsubarr:
subans += subss
subans += " "
#print(subans)
ans.append(subans[:-1])
else:
finalarr = []
nn = len(countarr)
for j in range(nn):
if countarr[j] + numarr[j] > k :
countarr[j] = 0
countarr[j + 1] += 1
subsubarr = []
for i in range(d):
subsubarr.append(str(countarr[i] + numarr[i] ) )
subsubarr = subsubarr[::-1]
subans = ""
for subss in subsubarr:
subans += subss
subans += " "
ans.append(subans[:-1])
# for subans in ans:
# print(subans)
# strsnum = str(count)
# strsnum = strsnum[::-1]
# carry = 0
# finalstrs = ""
# print("hhh")
# #print(strsnum)
# for j in strsnum:
# jint = int(j)
# if jint + carry == k:
# #print("hi")
# carry = 1
# finalstrs += "1"
# else:
# finalstrs += str(jint + carry)
# carry = 0
# if carry == 1 :
# finalstrs += "1"
# print(finalstrs)
# finalstrs = finalstrs[::-1]
# flag = 0
# count = int(finalstrs)
# newnumstrs = numstrs + count
# ans.append(str(newnumstrs))
# for i in range(d):
# substring = ""
# for subans in ans:
# substring += subans[i]
# substring += " "
# print(substring)
finalans = []
#print(ans)
for subans in ans:
subs = subans.split(" ")
finalans.append(subs)
for i in range(d):
substring = ""
for subans in finalans:
substring += subans[i]
substring += " "
print(substring)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
const int K = 1000000000;
long long max_power_of(long long k, int d, long long n, long long acc) {
if (acc >= n) {
return acc;
} else if (d == 0) {
return acc;
} else {
return max_power_of(k, d - 1, n, acc * k);
}
}
bool feasible(int n, int d, long long k) {
return max_power_of(k, d, n, 1) >= n;
}
void next_number(int *begin, int *end, int base) {
int *curr = begin;
while (curr != end) {
if (*curr + 1 <= base) {
*curr += 1;
break;
} else {
*curr = 1;
curr++;
}
}
}
int main() {
int n, d;
long long k;
cin >> n >> k >> d;
if (feasible(n, d, k)) {
int permutation[N];
int assignments[N * N];
for (int i = 0; i < d; i++) {
permutation[i] = 1;
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < d; i++) {
assignments[i * n + j] = permutation[i];
}
next_number(permutation, permutation + d, (int)k);
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << assignments[i * n + j] << ' ';
}
cout << endl;
}
} else {
cout << -1 << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T min3(T a, T b, T c) {
return min(a, min(b, c));
};
template <class T>
T max3(T a, T b, T c) {
return max(a, max(b, c));
};
void openFile() {
freopen("/home/khaihanhdk/MyWorkplace/cpp file/a.inp", "r", stdin);
}
vector<int> r[1010];
int n, k, d;
bool trying(int ind) {
int h = ind - 1;
for (int i = 0; i < r[h].size(); i++) {
int b = r[h][i] / k;
int c = r[h][i] % k;
for (int j = 0; j < c; j++) {
int x = b + 1;
r[ind].push_back(x);
}
if (b != 0)
for (int j = 0; j < k - c; j++) {
r[ind].push_back(b);
}
}
if ((int)r[ind].size() == n) return true;
return false;
}
int main() {
scanf("%d%d%d", &n, &k, &d);
r[0].push_back(n);
bool p = false;
for (int i = 1; i <= d; i++) {
p = (trying(i) == true || p);
}
if (!p) {
cout << -1;
return 0;
}
for (int i = 1; i <= d; i++) {
for (int j = 0; j < (int)r[i].size(); j++) {
for (int l = 0; l < r[i][j]; l++) cout << (j % k) + 1 << " ";
}
cout << endl;
}
}
| 9 | CPP |
import os
import sys
from io import BytesIO, IOBase
import math
def main():
pass
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
import os
import sys
from io import BytesIO, IOBase
def main():
pass
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
n,k,d=map(int,input().split())
if(n>k**d):
print(-1)
else:
ans=[i for i in range(0,n)]
for i in range(0,d):
for j in range(0,n):
print(ans[j]%k+1,end=" ")
ans[j]//=k
print("")
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
long long res = 1LL;
x = x % 1000000007;
while (y > 0) {
if (y & 1) res = (res * x) % 1000000007;
y = y >> 1;
x = (x * x) % 1000000007;
}
return res % 1000000007;
}
long long inv(long long n) { return power(n, 1000000007 - 2) % 1000000007; }
long long n, k, d, m[1005][1005];
void solve() {
cin >> n >> k >> d;
long long p = 1, i, j;
for (i = 1; i <= d; i++) {
p *= k;
if (p >= n) break;
}
if (p < n) {
cout << "-1\n";
return;
}
for (i = 0; i < n; i++) {
long long j = 0;
long long x = i;
for (j = 0; j < d; j++) {
m[i][j] = x % k;
x /= k;
}
}
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) cout << 1 + m[j][i] << " ";
cout << "\n";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) {
solve();
}
}
| 9 | CPP |
import math
n,k,d = map(int,input().split())
# if math.log(n)>d*math.log(k): chadar%
if n>k**d:
print(-1)
else:
# no pgh shit
t = 1
for i in range(d):
li = []
for j in range(n):
li.append((j//t)%k+1)
print(*li)
t*=k
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int st, bus, tr;
int num[1100][1100];
int main() {
cin >> st >> bus >> tr;
if (bus <= 1000) {
if (st > pow(bus, tr)) {
cout << -1 << endl;
return 0;
}
}
for (int j = 1; j < st; j++) {
num[j][0] = 1;
for (int i = 0; i < tr; i++) {
num[j][i] += num[j - 1][i];
num[j][i + 1] += num[j][i] / bus;
num[j][i] %= bus;
}
}
for (int i = 0; i < tr; i++) {
for (int j = 0; j < st; j++) {
cout << num[j][i] + 1 << " ";
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long max(long long a, long long b) { return ((a > b) ? a : b); }
inline long long min(long long a, long long b) { return ((a > b) ? b : a); }
inline long long gcd(long long a, long long b) {
if (b == 0) return a;
a %= b;
return gcd(b, a);
}
long long power(long long x, long long y) {
if (y == 0) return 1;
long long a = power(x, y / 2);
if (y % 2 == 0)
return a * a;
else
return x * a * a;
}
long long powermod(long long x, long long ex, long long md) {
long long ans = 1ll;
while (ex > 0) {
if (ex & 1ll) ans = (ans * x) % md;
ex >>= 1ll;
x = (x * x) % md;
}
return ans;
}
const long long inf = 1e18 + 9;
const long long mod = 1e9 + 7;
const long double eps = 1e-9;
const long long N = 1e6 + 1;
long long n, k, d;
void solve() {
bool flag = 0;
cin >> n >> k >> d;
long long arr[n + 1];
long long p = 1;
for (long long i = 1; i <= d; i++) {
p = p * k;
if (p >= n) {
flag = 1;
break;
}
}
if (!flag)
cout << "-1\n";
else {
for (int(i) = 0; i < (n); i++) arr[i + 1] = i + 1;
for (long long i = 1; i <= d; i++) {
for (long long j = 1; j <= n; j++) {
cout << arr[j] % k + 1 << " ";
arr[j] /= k;
}
cout << "\n";
}
}
}
int main() {
{
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
};
cout << fixed << setprecision(20);
long long NTC = 1;
long long PTC = 0;
while (PTC++ < NTC) {
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
<< "ms\n";
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void init() {}
int main() {
init();
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, k, d;
cin >> n >> k >> d;
if (pow(k, d) < n) {
cout << -1;
return 0;
}
long long ans[n][d];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
ans[i][j] = 1;
}
}
for (int i = 1; i < n; i++) {
int j = d - 1;
for (int x = 0; x < d; x++) {
ans[i][x] = ans[i - 1][x];
}
while (j >= 0 && ans[i][j] == k) {
ans[i][j] = 1;
j--;
}
ans[i][j]++;
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << ans[j][i] << " ";
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main() {
int n, k, d;
cin >> n >> k >> d;
int tmp = 1;
bool flag = false;
for (int i = 1; i <= d; i++) {
tmp *= k;
if (tmp >= n) {
flag = true;
break;
}
}
if (!flag) {
cout << -1 << endl;
return 0;
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) a[i][j] = a[i - 1][j];
for (int j = d - 1; j >= 0; j--) {
a[i][j] = (a[i][j] + 1) % k;
if (a[i][j]) break;
}
}
for (int i = 0; i < d; i++) {
cout << a[0][i] + 1;
for (int j = 1; j < n; j++) cout << ' ' << a[j][i] + 1;
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[1009][1009];
int main() {
long long n, k, d;
cin >> n >> k >> d;
for (int i = 0; i < n; i++) {
int cur = i;
for (int j = 0; j < d; j++) {
ans[j][i] = cur % k + 1;
cur /= k;
}
if (cur) {
printf("-1");
return 0;
}
}
for (int i = 0; i < d; i++)
for (int j = 0; j < n; j++)
printf("%d%c", ans[i][j], j == n - 1 ? '\n' : ' ');
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1009;
long long ans[MAXN][MAXN];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
long long n, d, k;
scanf("%lld%lld%lld", &n, &k, &d);
int ok = 0;
long long b = k;
for (int i = 0; i < d; ++i) {
if (b >= n) {
ok = 1;
break;
}
b *= k;
}
if (!ok) {
printf("-1\n");
return 0;
}
for (int i = 1; i < n; ++i) {
for (int j = 0; j < d; ++j) ans[i][j] = ans[i - 1][j];
for (int j = d - 1; j >= 0; j--) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) break;
}
}
for (int i = 0; i < d; ++i) {
for (int j = 0; j < n; ++j) {
if (j) printf(" ");
printf("%lld", ans[j][i] + 1);
}
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int limN = 1005;
int ans[limN][limN];
int main() {
int n, d, k;
scanf("%d%d%d", &n, &k, &d);
if (n == 1) {
for (int i = 0; i < d; i++) printf("1\n");
return 0;
}
if (k >= n) {
for (int i = 0; i < d; i++) {
for (int j = 1; j <= n; j++) printf("%d ", j);
printf("\n");
}
return 0;
}
if (d == 1 || k == 1) {
printf("-1\n");
return 0;
}
int num[limN];
for (int i = 0; i < d; i++) num[i] = 0;
for (int w = 0; w < n; w++) {
for (int i = 0; i < d; i++) {
ans[i][w] = num[i] + 1;
}
int xtra = 1;
for (int i = 0; i < d && xtra; i++) {
num[i] += xtra;
xtra = num[i] / k;
num[i] %= k;
}
if (xtra && w + 1 < n) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) printf("%d ", ans[i][j]);
printf("\n");
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie();
long long n, k, d;
cin >> n >> k >> d;
vector<vector<long long> > arr(n, vector<long long>(d));
long long lst = 0;
long long cur = 1;
for (long long i = 0; i < d; i++) arr[0][i] = 1;
for (long long i = 1; i < n; i++) {
arr[i] = arr[i - 1];
arr[i][d - 1]++;
for (long long j = d - 1; j > 0; j--)
if (arr[i][j] > k) {
arr[i][j] %= k;
arr[i][j - 1]++;
}
if (arr[i][0] > k) {
cout << -1 << endl;
return 0;
}
}
for (long long i = 0; i < d; i++) {
for (long long j = 0; j < n; j++) cout << arr[j][i] << " ";
cout << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > V;
int n, k, d, pos = 1, c = 0;
int main() {
scanf("%d%d%d", &n, &k, &d);
long long tmp1 = 1;
int c = 0;
for (int i = 0; i < d; i++) {
tmp1 *= (long long)k;
if (tmp1 >= n) {
c = 1;
break;
}
}
if (!c) {
printf("-1\n");
return 0;
}
long long dvv = 1;
for (int i = 1; i <= d; i++) {
long long ne = 1;
long long rem = n;
while (rem) {
for (int j = 1; j <= min(rem, dvv); j++) cout << ne << " ";
rem -= min(rem, dvv);
if (++ne == k + 1) ne = 1;
}
(dvv * k < n) ? dvv *= k : dvv = n;
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
bool check(long long a, long long b, long long n) {
long long ret = 1;
while (b) {
if (b & 1) ret = ret * a;
a = a * a;
b >>= 1;
if (ret >= n) return true;
}
return false;
}
int ans[maxn][maxn];
int main() {
int n, k, d;
scanf("%d%d%d", &n, &k, &d);
if (check(min(k, n), d, n)) {
for (int i = 1; i <= d; i++) ans[i][1] = 1;
for (int i = 2; i <= n; i++) {
int c = 0;
ans[1][i] = ans[1][i - 1] + 1;
if (ans[1][i] > k) {
ans[1][i] = 1;
c = 1;
}
for (int j = 2; j <= d; j++) {
ans[j][i] = ans[j][i - 1] + c;
c = 0;
if (ans[j][i] > k) {
ans[j][i] = 1;
c = 1;
}
}
}
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
if (j != 1) printf(" ");
printf("%d", ans[i][j]);
}
printf("\n");
}
} else
printf("-1\n");
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dig[1005][1005];
int main() {
int n, d, k;
cin >> n >> k >> d;
if (k == 1) {
if (n == 1) {
for (int i = 0; i < d; i++) {
cout << 1 << endl;
}
} else
cout << -1 << endl;
return 0;
}
int r = ceil(log(n) / log(k));
if (r > d)
cout << -1 << endl;
else {
for (int i = 0; i < n; i++) {
int j = 0;
int num = i;
while (num > 0) {
dig[i][j] = num % k;
num /= k;
j++;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << dig[j][i] + 1 << " ";
}
cout << endl;
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, d;
cin >> n >> k >> d;
long long r = 1;
for (int i = 1; i <= d; i++) {
r = r * k;
if (n <= r) break;
}
if (n > r) {
cout << -1;
return 0;
}
int a[n];
for (int i = 0; i < n; i++) {
a[i] = i;
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << (a[j] % k) + 1 << " ";
a[j] = a[j] / k;
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[2000][2000];
int main() {
long long n, k, d, f = 0;
cin >> n >> k >> d;
long long x = 1;
for (int i = 1; i <= d; i++) {
x *= k;
if (x >= n) {
f = 1;
break;
}
}
if (!f) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; i++) {
int l = i, j = 0;
while (l > 0) {
ans[j++][i] = l % k;
l /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << ans[i][j] + 1 << " ";
cout << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
os << '{';
string sep;
for (const auto &x : arr) os << sep << x, sep = ", ";
return os << '}';
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V) os << v << " ";
return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S) os << s << " ";
return os << "}";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
template <class L, class R>
ostream &operator<<(ostream &os, map<L, R> M) {
os << "{ ";
for (auto m : M) os << "(" << m.first << ":" << m.second << ") ";
return os << "}";
}
const int MAX = 1000010;
const int MOD2 = 998244353;
const int MOD1 = 1000000007;
const int INF = 0x3f;
const long long int LLINF = 0x3f3f3f3f3f3f3f3fll;
const long double EPS = 1e-7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(25);
cerr << fixed << setprecision(10);
long long int n, k, d;
cin >> n >> k >> d;
long long int a = 1;
for (int i = 1; i <= d; i++) {
a *= k;
if (a <= n) continue;
break;
}
if (a < n) {
cout << -1 << "\n";
return 0;
}
vector<vector<int>> ans(d, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int x = i;
for (int j = 0; j < d; j++) {
ans[j][i] = x % k + 1;
x /= k;
}
}
42;
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << ans[i][j] << " ";
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, ans[1010][1010];
long long l = 1, inf = 1e12;
void update(int j) {
for (int i = 0; i < d; i++) ans[j][i] = ans[j - 1][i];
ans[j][0]++;
int i = 0;
while (ans[j][i] >= k) {
ans[j][i] = 0;
ans[j][i + 1] += 1;
i++;
}
}
int main() {
cin >> n >> k >> d;
for (int i = 0; i < d; i++) {
l *= (k * 1ll);
if (l >= inf) break;
}
if (l < n) {
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < d; i++) ans[0][i] = 0;
for (int i = 1; i < n; i++) update(i);
for (int i = 0; i < d; i++, cout << endl)
for (int j = 0; j < n; j++) cout << ans[j][i] + 1 << ' ';
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, d;
cin >> n >> k >> d;
long long l = 1;
int f = 0;
for (int i = 0; i < d; i++) {
l = l * k;
if (l >= n) {
f = 1;
break;
}
}
if (f == 0) {
cout << "-1";
return 0;
}
int ans[n][d];
memset(ans, 0, sizeof(ans));
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) {
ans[i][j] = ans[i - 1][j];
}
for (int j = d - 1; j >= 0; j--) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) {
break;
}
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << ans[j][i] + 1 << " ";
}
cout << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long d1;
long long m;
long long n;
long long mas[5000][5000];
bool f = false;
void rec(long long hod, long long start, long long h) {
if (hod > d1) {
return;
}
long long m1 = 1;
for (long long i = start; i <= n; i += h) {
mas[hod][i] = m1;
m1++;
if (m1 > m) {
m1 = 1;
}
}
m1 = 1;
for (long long i = start; i <= n; i += h) {
if (m1 > m) {
break;
}
rec(hod + 1, i, h * m);
m1++;
}
}
int main() {
long long d;
cin >> n >> m >> d;
int k = 0;
int t = 1;
while (t < n) {
t *= m;
k++;
if (k > d) {
cout << -1 << endl;
return 0;
}
}
d1 = min(d, (long long)k);
d1 = max(d1, (long long)1);
rec(1, 1, 1);
for (int i = 1; i <= d; i++) {
if (i <= d1) {
for (int j = 1; j <= n; j++) {
printf("%lld ", mas[i][j]);
}
} else {
for (int j = 1; j <= n; j++) {
printf("%lld ", mas[1][j]);
}
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int g[1200][1200];
int i, j, k, l, m, n;
inline bool check() {
if (m == 1)
if (n == 1)
return false;
else
return true;
for (int i = m, j = 1; j <= l; i = i * m, j++)
if (i >= n) return false;
return true;
}
int main() {
scanf("%d%d%d", &n, &m, &l);
if (check())
puts("-1");
else {
for (i = 0; i < n; i++)
for (j = 1, k = i; j <= l; j++, k = k / m) g[j][i + 1] = k % m + 1;
for (i = 1; i <= l; i++) {
for (j = 1; j <= n; j++) printf("%d ", g[i][j]);
printf("\n");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
const int N = 1200;
using namespace std;
int a[N][N];
int main() {
int n, k, d;
while (~scanf("%d%d%d", &n, &k, &d)) {
if (double(n) > pow((double)k, d))
printf("-1\n");
else {
memset(a, 0, sizeof(a));
for (int st = 0; st < n; st++) {
int tmp = st, j = 0;
while (tmp) {
a[j][st] = tmp % k;
tmp /= k;
j++;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
printf("%d%c", a[i][j] + 1, j == n ? '\n' : ' ');
}
printf("\n");
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, d, k, ans[1010][1010];
int main() {
ios::sync_with_stdio(0);
cin >> n >> k >> d;
for (int i = 0; i < d; i++) ans[0][i] = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) ans[i][j] = ans[i - 1][j];
ans[i][0]++;
for (int j = 0; j < d; j++) {
if (ans[i][j] > k) {
ans[i][j] = 1;
ans[i][j + 1]++;
} else
break;
}
if (ans[i][d]) {
cout << -1 << '\n';
return 0;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << ans[j][i] << ' ';
cout << '\n';
}
}
| 9 | CPP |
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
ALPHA='abcdefghijklmnopqrstuvwxyz'
M=10**9+7
EPS=1e-6
def value():return tuple(map(int,input().split()))
def array():return [int(i) for i in input().split()]
def Int():return int(input())
def Str():return input()
def arrayS():return [i for i in input().split()]
#-------------------------code---------------------------#
# vsInput()
n,k,d=value()
if(n>k**d):
print(-1)
else:
each=1
for i in range(d):
key=1
c=0
for i in range(n):
print(key,end=" ")
c+=1
if(c==each):
c=0
key+=1
if(key>k): key=1
each*=k
print()
| 9 | PYTHON3 |
#!/usr/bin/python3
import sys
n, k, d = list(map(int, sys.stdin.readline().split()))
x = 1
while x ** d < n:
x += 1
if x > k:
sys.stdout.write("-1\n")
sys.exit(0)
ans = [[1 for i in range(d)] for j in range(n)]
for i in range(1, n):
for j in range(d):
ans[i][j] = ans[i - 1][j]
ans[i][d - 1] += 1
memo = 0
for j in range(d - 1, -1, -1):
ans[i][j] += memo
memo = 0
if ans[i][j] > x:
memo = ans[i][j] - x
ans[i][j] = 1
for i in range(d):
sys.stdout.write(' '.join([str(ans[j][i]) for j in range(n)]) + '\n') | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1111;
int data[maxn], sum;
int n, d, k, cnt[maxn][maxn];
void dfs(int x) {
if (sum >= n) return;
if (x >= d) {
for (int i = 0; i < d; i++) cnt[i][sum] = data[i];
sum++;
return;
}
for (int i = 1; i <= min(k, 1001); i++) {
data[x] = i;
dfs(x + 1);
}
}
int main() {
while (~scanf("%d%d%d", &n, &k, &d)) {
memset(cnt, 0, sizeof(cnt));
sum = 0;
dfs(0);
if (sum < n)
puts("-1");
else {
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) printf("%d ", cnt[i][j]);
puts("");
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(12) << fixed;
}
void solve() {
long long n, k, d;
cin >> n >> k >> d;
long long pp = 1, f = 0;
for (long long i = 1; i <= d; i++) {
pp *= k;
if (pp >= n) {
f = i;
break;
}
}
if (f == 0) {
cout << -1 << "\n";
return;
};
long long a[n];
for (long long i = 0; i < n; i++) a[i] = i;
for (long long i = 0; i < d; i++) {
for (long long j = 0; j < n; j++) {
cout << (a[j] % k) + 1 << " ";
a[j] /= k;
}
cout << endl;
}
}
int main() {
fast();
long long t = 1;
while (t--) {
solve();
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, f[1005][1005];
bool check() {
int p = 1;
for (int i = 1; i <= d; i++) {
p *= k;
if (p >= n) return true;
}
return false;
}
int main() {
cin >> n >> k >> d;
if (!check())
cout << -1;
else {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= d; j++) f[i][j] = f[i - 1][j];
for (int j = d; j >= 1; j--) {
f[i][j] = (f[i][j] + 1) % k;
if (f[i][j]) break;
}
}
for (int j = 1; j <= d; j++) {
for (int i = 1; i <= n; i++) cout << f[i][j] + 1 << ' ';
cout << endl;
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
int n, k, d;
cin >> n >> k >> d;
int temp = 1, j, i = 1, flag = 0;
while (i <= d) {
temp *= k;
i++;
if (temp >= n) {
flag = 1;
break;
}
}
if (flag == 0) {
cout << -1;
return 0;
}
int ans[n][d];
for (long long int i = 0; i < n; i++)
for (long long int j = 0; j < d; j++) ans[i][j] = 0;
for (i = 1; i < n; i++) {
for (j = 0; j < d; j++) ans[i][j] = ans[i - 1][j];
for (j = d - 1; j >= 0; j--) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) break;
}
}
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
cout << ans[j][i] + 1 << " ";
}
cout << "\n";
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int res[1010][1010];
int n, k, d;
int main() {
scanf("%d%d%d", &n, &k, &d);
bool flag = 0;
int tmp = 1;
for (int i = 1; i <= d; i++) {
tmp *= k;
if (tmp >= n) {
flag = 1;
break;
}
}
if (!flag) {
puts("-1");
return 0;
}
for (int i = 1; i <= n; i++) {
int num = i;
for (int j = 1; j <= d; j++) {
res[i][j] = num % k;
num /= k;
}
}
for (int i = 1; i <= d; i++) {
printf("%d", res[1][i] + 1);
for (int j = 2; j <= n; j++) {
printf(" %d", res[j][i] + 1);
}
puts("");
}
return 0;
}
| 9 | CPP |
n,k,d=map(int,input().split())
if n>k**d:print(-1);exit()
K=1
for j in range(d):
print(" ".join([str(i//K%k +1) for i in range(n)]))
K*=k | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const int N = 1e3 + 10;
const int M = 1e4;
int a[N][N];
int main() {
int n, k, d;
cin >> n >> k >> d;
int flag = 1;
memset((a), (0), sizeof(a));
if (n == 1) {
while (d--) cout << 1 << endl;
return 0;
}
for (int i = 1; i <= d; i++) a[1][i] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= d; j++) a[i][j] = a[i - 1][j];
a[i][d]++;
for (int j = d; j > 0; j--) {
if (a[i][j] > k)
a[i][j] = 1, a[i][j - 1]++;
else
break;
}
if (a[i][0] == 1) {
flag = 0;
break;
}
}
if (!flag) {
cout << -1 << endl;
return 0;
}
for (int j = 1; j <= d; j++) {
for (int i = 1; i <= n; i++) {
if (i > 1) cout << ' ';
cout << a[i][j];
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
long long MM = 1000000007;
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) return abs(a - b);
long long res = a % b;
while (res) {
a = b;
b = res;
res = a % b;
}
return b;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
long long numberofdiviser(long long a) {
long long ans = 0;
long long i;
for (i = 1; i * i < a; i++) {
if (a % i == 0) ans += 2;
}
if (i * i == a) ans++;
return ans;
}
void fival(long long* a, long long b, long long n) {
for (int i = 0; i < n; i++) {
a[i] = b;
}
}
long long sum, ans, l, r, x;
long long ss(vector<long long> a, vector<long long>& b, int ii) {
for (int i = ii; i < a.size(); i++) {
b.push_back(a[i]);
sum += a[i];
if (b.size() > 1 && sum >= l && sum <= r && b[b.size() - 1] - b[0] >= x)
ans++;
ss(a, b, i + 1);
sum -= b[b.size() - 1];
b.pop_back();
}
return ans;
}
unsigned long long fact(long long n) {
if (n == 0) return 1;
long long r = n * fact(n - 1);
r %= MM;
return r;
}
unsigned long long Combinations(unsigned long long n, unsigned long long r) {
if (r > n) return 0;
if (r * 2 > n) r = n - r;
if (r == 0) return 1;
unsigned long long res = n;
for (int i = 2; i <= r; ++i) {
res *= (n - i + 1);
res /= i;
}
return res;
}
long long pow(long long a, long long b, long long m = MM) {
if (b == 0) return 1;
if (b == 1) return a;
long long x = pow(a, b / 2, m);
x = (x * x) % m;
if (b % 2) x = (x * a);
return x % m;
}
int dd(string s) {
long long res = 0;
for (int i = 0; i < s.size(); i++) {
res *= 2;
res += s[i] - 48;
}
return res;
}
int solve() {
int n, k, d;
cin >> n >> k >> d;
vector<vector<long long>> v = {{n}};
vector<long long> vv;
int f = 1;
int l = 0;
if (k == 1 && n > 1) return cout << -1, 0;
if (k >= n) {
while (d--) {
for (int i = 1; i <= n; i++) {
cout << i << " ";
}
cout << "\n";
}
return 0;
}
while (f) {
f = 0;
v.emplace_back(vv);
for (int i = 0; i < v[l].size(); i++) {
if (v[l][i] == 1) {
v.back().emplace_back(1);
continue;
}
int r = v[l][i] % k;
for (int j = 0; j < k; j++) {
v.back().emplace_back(v[l][i] / k);
if (r) {
v.back().back()++;
r--;
}
if (v.back().back() > 1) f = 1;
}
}
l++;
}
if (v.size() - 1 > d) return cout << -1, 0;
for (int i = 1, n = 1; n <= d; n++) {
for (int j = 0; j < v[i].size(); j++) {
for (int m = 0; m < v[i][j]; m++) {
if (j % k == 0) {
cout << k << " ";
} else {
cout << j % k << " ";
}
}
}
cout << "\n";
if (i + 1 < v.size()) i++;
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d;
int a[1010][1010];
void solve() {
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++) {
int x = i, j = 0;
while (x) {
a[i][j++] = x % k;
x /= k;
}
}
}
int main() {
int i, j;
scanf("%d %d %d", &n, &k, &d);
if ((double)n > pow((double)k, d))
printf("-1\n");
else {
solve();
for (i = 0; i < d; i++) {
for (j = 0; j < n - 1; j++) {
printf("%d ", a[j][i] + 1);
}
printf("%d\n", a[j][i] + 1);
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1010;
long long n, k, d;
long long cnt;
long long seq[N];
long long ans[N][N];
void solve(long long day) {
if (!day) {
if (cnt == n) return;
cnt++;
for (int i = d; i > day; --i) ans[cnt][i] = seq[i];
return;
}
for (int i = 1; i <= k; ++i) {
if (cnt == n) return;
seq[day] = i;
solve(day - 1);
}
}
int main() {
cin >> n >> k >> d;
bool chk = true;
long long x = 1;
for (int i = 0; i < d; ++i) {
x *= k;
if (x >= n) {
chk = false;
break;
}
}
if (chk) {
cout << -1 << "\n";
return 0;
}
solve(d);
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) cout << ans[j][i] << " ";
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[1001][1001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, d, k;
cin >> n >> k >> d;
long long int temp = 1;
bool flag = false;
for (int i = 0; i < d; i++) {
temp *= k;
if (temp >= n) {
flag = true;
break;
}
}
if (!flag) {
cout << -1 << endl;
return 0;
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) ans[i][j] = ans[i - 1][j];
for (int j = d - 1; j >= 0; j--) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) break;
}
}
for (int i = 0; i < d; i++, cout << endl)
for (int j = 0; j < n; j++) cout << ans[j][i] + 1 << ' ';
}
| 9 | CPP |
n,k,d=map(int,input().split())
if n>k**d:print(-1);exit()
K=1
for j in range(d):
print(" ".join([str(i//K%k +1) for i in range(n)]));K*=k | 9 | PYTHON3 |
n, k, d = list( map( int, input().split() ) )
ans = []
for i in range(d):
tmp = [0]*n
ans.append( tmp )
tmp = []
def add( val ):
pos = d-1
while pos >= 0:
#print(tmp,val,pos)
tmp[pos] += val
if tmp[pos] == k:
tmp[pos] = 0
val = 1
elif tmp[pos] > k:
val = tmp[pos]-k
tmp[pos] %= k
else:
val = 0
break
pos -= 1
def fill( col ):
cnt = 0
for i in tmp:
ans[cnt][col] = i
#print( ans )
cnt += 1
if k ** d < n:
print( "-1" )
else:
tmp = [0]*(d)
for i in range(n):
#for j in tmp:
# print( j+1, end=' ' )
#print()
fill(i)
add(1)
for i in ans:
for j in i:
print( j+1, end=' ' )
print()
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed;
cout.precision(12);
solve();
return 0;
}
template <typename T>
void sc(T& x) {
cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
cin >> head;
sc(tail...);
}
template <typename T>
void pr(const T& x) {
cout << x << '\n';
}
template <typename Head, typename... Tail>
void pr(const Head& head, const Tail&... tail) {
cout << head << ' ';
pr(tail...);
}
bool can(int n, int k, int d) {
if (k == 1 && n > 1) {
return false;
}
int need = 0;
n = (n + k - 1) / k;
while (n > 1) {
need++;
n = (n + k - 1) / k;
}
return (need + 1 <= d);
}
void solve() {
int n, k, d;
sc(n, k, d);
if (!can(n, k, d)) {
pr(-1);
return;
}
int jump = 1;
while (d--) {
vector<int> cur(n, -1);
for (int j = 0; j < n; j++) {
if (cur[j] == -1) {
int step = 0;
for (int x = j; x < n; x += jump) {
cur[x] = step + 1;
step++;
step %= k;
}
}
}
jump = min(1LL * n, 1LL * k * jump);
for (int __ii = 0; __ii < ((int)cur.size()); __ii++) {
if (__ii) cout << ' ';
cout << cur[__ii];
}
cout << '\n';
}
}
| 9 | CPP |
n,k,d = [int(x) for x in input().split()]
if n <= k:
comb = [str(x+1) for x in range(n)]
for x in range(d):
print(' '.join(comb))
elif k == 1:
print(-1)
else:
base = k
exp = d
if pow(base,exp) >= n:
total = 1
while total < n:
total *= base
count = 0
while total > 0:
total = total//base
if total == 0:
break
count += 1
out = []
for y in range(n):
out.append((y//total)%base)
print(' '.join([str(z+1) for z in out]))
for x in range(d-count):
print(' '.join(['1' for x in range(n)]))
else:
print(-1)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
using namespace std;
bool great(long long int n, long long int k, long long int d) {
long long int ans = 1;
for (int i = 1; i <= d; i++) {
ans = ans * k;
if (ans >= n) return false;
}
return true;
}
bool kPoweredIMinusOneIsGreaterThanOrEqualToN(long long int base,
long long int power,
long long int x) {
long long int ans = 1;
for (int i = 1; i <= power; i++) {
ans = (ans * base);
if (ans >= x) {
return true;
}
}
return false;
}
long long int power(long long int base, long long int power) {
long long int ans = 1;
for (int i = 1; i <= power; i++) {
ans = (ans * base);
}
return ans;
}
int main() {
long long int n, k, d;
cin >> n >> k >> d;
if (great(n, k, d)) {
cout << -1 << '\n';
} else {
for (int i = 1; i <= d; i++) {
int ptr = 0;
if (i == 1) {
for (int j = 1; j <= n; j++) {
cout << ptr + 1 << ' ';
ptr = (ptr + 1) % k;
}
} else {
if (kPoweredIMinusOneIsGreaterThanOrEqualToN(k, i - 1, n)) {
for (int j = 1; j <= n; j++) {
cout << 1 << ' ';
}
} else {
long long int ans = power(k, i - 1);
int ptr = 0;
for (long long int j = 1; j <= n; j++) {
cout << ptr + 1 << ' ';
if (j % ans == 0) {
ptr = (ptr + 1) % k;
}
}
}
}
cout << '\n';
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return "\"" + s + "\""; }
template <typename T>
string to_string(vector<T>);
template <typename U, typename V>
string to_string(pair<U, V> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename T>
string to_string(vector<T> v) {
string r = "[";
for (int i = 0; i < (int)v.size() - 1; i++) r += to_string(v[i]) + ", ";
if (!v.empty()) r += to_string(v.back());
return r + "]";
}
const int N = 1010;
int n, k, d, f[N][N];
bool can() {
if (k >= n) return true;
int x = k, y = d - 1;
while (y--) {
x *= k;
if (x >= n) return true;
}
return false;
}
void fill(int s) {
if (f[0][s - 1] < k - 1) {
f[0][s] = f[0][s - 1] + 1;
for (int i = 1; i < d; i++) f[i][s] = f[i][s - 1];
} else {
int z = 0;
while (f[z][s - 1] == k - 1) z++;
for (int i = 0; i < z; i++) f[i][s] = 0;
f[z][s] = f[z][s - 1] + 1;
for (int i = z + 1; i < d; i++) f[i][s] = f[i][s - 1];
}
}
int main() {
scanf("%d%d%d", &n, &k, &d);
if (can()) {
for (int i = 0; i < d; i++) f[i][0] = 0;
for (int i = 1; i < n; i++) fill(i);
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) printf("%d ", f[i][j] + 1);
printf("\n");
}
} else
printf("-1\n");
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 * 1000 + 10;
int ans[MAXN][MAXN];
int main() {
ios::sync_with_stdio(false);
int n, d, k;
cin >> n >> k >> d;
long long tmp = 1;
bool check = false;
for (int i = 0; i < d; i++) {
tmp *= k;
if (tmp >= n) {
check = true;
break;
}
}
if (!check) {
cout << -1 << endl;
return 0;
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) ans[i][j] = ans[i - 1][j];
for (int j = d - 1; j >= 0; j--) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) break;
}
}
for (int i = 0; i < d; i++, cout << endl)
for (int j = 0; j < n; j++) cout << ans[j][i] + 1 << ' ';
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, k, d, ans = 1, f[2000];
int main() {
cin >> n >> k >> d;
for (int i = 1; i <= d && ans < n; i++) ans = ans * k;
if (ans < n)
puts("-1");
else {
for (int i = 1; i <= n; i++) f[i] = i;
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
cout << f[j] % k + 1;
if (j == n)
puts("");
else
cout << ' ';
f[j] /= k;
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-14;
const int maxn = 1E3 + 10;
int n, k, d;
int ans[maxn][maxn], arr[maxn];
int cnt = 0;
bool judge() {
long long tot = 1;
for (int i = 0; i < d; i++) {
tot *= k;
if (tot >= n) return 1;
}
return 0;
}
void solve(int u) {
if (d == u) {
memcpy(ans[cnt++], arr, sizeof arr);
return;
}
int& i = arr[u];
for (i = 1; i <= k; i++) {
solve(u + 1);
if (cnt == n) return;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> d;
if (!judge()) {
cout << "-1\n";
return 0;
}
solve(0);
for (int i = 0; i < d; i++) {
cout << ans[0][i];
for (int j = 1; j < n; j++) {
cout << " " << ans[j][i];
}
cout << "\n";
}
}
| 9 | CPP |
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
from typing import List
"""
created by shhuan at 2020/1/8 21:47
"""
def bit(val, n, l):
x = []
while val > 0:
x.append(val % n)
val //= n
return [0] * (l - len(x)) + x[::-1]
def solve(N, K, D):
if math.log(N, K) > D or K ** D < N:
print(-1)
return
a = []
for i in range(N):
x = bit(i, K, D)
a.append(x)
ans = []
for d in range(D):
ans.append(' '.join(map(str, [a[i][d] + 1 for i in range(N)])))
print('\n'.join(ans))
N, K, D = map(int, input().split())
solve(N, K, D) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1010;
int ans[MAXN][MAXN];
int N, D, K;
int main(void) {
scanf("%d%d%d", &N, &K, &D);
if (N > 1 && K == 1) {
printf("-1\n");
return 0;
}
int rep = 1;
bool possible = false;
for (int i = 0; i < D; ++i) {
int curr = 0;
int pos = 0;
bool ok = true;
while (pos < N) {
for (int j = 0; pos < N && j < rep; ++j) {
ans[i][pos++] = curr + 1;
}
++curr;
if (curr == K) {
if (pos < N) ok = false;
curr = 0;
}
}
if (rep >= N || rep * K >= N) ok = true;
possible |= ok;
if (rep >= N || rep * K >= N)
rep = N;
else
rep *= K;
}
if (!possible) {
printf("-1\n");
} else {
for (int i = 0; i < D; ++i) {
for (int j = 0; j < N; ++j) printf("%d%c", ans[i][j], " \n"[j + 1 == N]);
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int st[1001][1001];
int mem[1001];
long long int n, k, d;
int j = 0;
int cnt = 0;
void rec(int depth) {
if (cnt == n) return;
if (depth == d) {
for (int i = 0; i < d; i++) st[i][cnt] = mem[i];
cnt++;
return;
}
for (long long int i = 1; i <= k; i++) {
if (cnt == n) return;
mem[depth] = i;
rec(depth + 1);
}
}
int main(int argc, char** argv) {
cin >> n >> k >> d;
long long int save = d;
long long int p = 1;
bool ok = false;
while (save--) {
p *= k;
if (p >= n) {
ok = true;
break;
};
}
if (!ok) {
cout << -1 << endl;
return 0;
}
rec(0);
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << st[i][j] << " ";
cout << endl;
}
return 0;
}
| 9 | CPP |
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
n,k,d=I()
if n>k**d:
print(-1)
else:
ans=[[0]*d for i in range(n)]
for i in range(1,n):
for j in range(d):
ans[i][j]=ans[i-1][j]
for j in range(d-1,-1,-1):
ans[i][j]=(ans[i][j]+1)%k
if ans[i][j]:break
for i in range(d):
for j in range(n):
print(ans[j][i]+1,end=' ')
print() | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed;
cout.precision(12);
solve();
return 0;
}
template <typename T>
void sc(T& x) {
cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
cin >> head;
sc(tail...);
}
template <typename T>
void pr(const T& x) {
cout << x << '\n';
}
template <typename Head, typename... Tail>
void pr(const Head& head, const Tail&... tail) {
cout << head << ' ';
pr(tail...);
}
bool can(int n, int k, int d) {
int need = 0;
n = (n + k - 1) / k;
while (n > 1) {
need++;
n = (n + k - 1) / k;
}
return (need + 1 <= d);
}
void solve() {
int n, k, d;
sc(n, k, d);
if (d == 1 && n > k) {
pr(-1);
return;
}
if (k == 1 && n > 1) {
pr(-1);
return;
}
if (!can(n, k, d)) {
pr(-1);
return;
}
int jump = 1;
while (d--) {
vector<int> cur(n, -1);
for (int j = 0; j < n; j++) {
if (cur[j] == -1) {
int step = 0;
for (int x = j; x < n; x += jump) {
cur[x] = step + 1;
step++;
step %= k;
}
}
}
jump = min(1LL * n, 1LL * k * jump);
for (int __ii = 0; __ii < ((int)cur.size()); __ii++) {
if (__ii) cout << ' ';
cout << cur[__ii];
}
cout << '\n';
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N, D, K;
int main() {
scanf("%d%d%d", &N, &K, &D);
vector<vector<int> > A(N, vector<int>(D, 0));
for (int i = 0; i < N; i++) {
int x = i;
for (int j = D - 1; j >= 0; j--) {
A[i][j] = x % K;
x /= K;
}
if (x) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < D; i++) {
for (int j = 0; j < N; j++) printf("%d ", A[j][i] + 1);
printf("\n");
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int v[1010];
int ans[1010][1010];
int main() {
int n, k, d;
scanf(" %d %d %d", &(n), &(k), &(d));
int pot = 1;
for (int i = 0; i < (d); ++i) {
pot *= k;
if (pot >= n) {
break;
}
}
if (n > pot) {
printf("-1\n");
return 0;
}
for (int i = 0; i < (n); ++i) {
for (int j = 0; j < (d); ++j) {
ans[j][i] = v[j] + 1;
}
int carry = 1;
for (int i = 0; i < (d); ++i) {
int nval = v[i] + carry;
carry = nval / k;
v[i] = nval % k;
}
}
for (int i = 0; i < (d); ++i) {
for (int j = 0; j < (n); ++j) {
if (j) printf(" ");
printf("%d", ans[i][j]);
}
printf("\n");
}
}
| 9 | CPP |
load = [int(i) for i in input().split()]
n = load[0]
k = load[1]
d = load[2]
p = 1
for i in range(d):
p *= k
if p >= n:
break
if n > p:
print(-1)
else:
nums = [i for i in range(n)]
for i in range(d):
buff = ""
for j in range(n):
buff += str(nums[j] % k + 1) + ' '
nums[j] //= k
print(buff)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, d;
int dp[1004][1004];
int check() {
long long t = 1;
for (int i = 1; i <= d; i++) {
t = t * k;
if (t >= n) return 0;
}
printf("-1\n");
return 1;
}
int main() {
scanf("%I64d %I64d %I64d", &n, &k, &d);
if (check()) return 0;
for (int i = 1; i <= d; i++) dp[i][1] = 1;
int t = 0;
for (int i = 2; i <= n; i++) {
t = 1;
for (int j = 1; j <= d; j++) {
t = dp[j][i - 1] + t;
if (t == k + 1) {
dp[j][i] = 1;
} else {
dp[j][i] = t;
}
t = t / (k + 1);
}
}
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) printf("%d ", dp[i][j]);
printf("\n");
}
return 0;
}
| 9 | CPP |
import time,math,bisect,sys
sys.setrecursionlimit(100000)
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi=3.14159265358979323846264338327950
def II(): # to take integer input
return int(stdin.readline())
def IO(): # to take string input
return stdin.readline()
def IP(): # to take tuple as input
return map(int,stdin.readline().split())
def L(): # to take list as input
return list(map(int,stdin.readline().split()))
def P(x): # to print integer,list,string etc..
return stdout.write(str(x)+"\n")
def PI(x,y): # to print tuple separatedly
return stdout.write(str(x)+" "+str(y)+"\n")
def lcm(a,b): # to calculate lcm
return (a*b)//gcd(a,b)
def gcd(a,b): # to calculate gcd
if a==0:
return b
elif b==0:
return a
if a>b:
return gcd(a%b,b)
else:
return gcd(a,b%a)
def readTree(): # to read tree
v=int(input())
adj=[set() for i in range(v+1)]
for i in range(v-1):
u1,u2=In()
adj[u1].add(u2)
adj[u2].add(u1)
return adj,v
def bfs(adj,v): # a schema of bfs
visited=[False]*(v+1)
q=deque()
while q:
pass
def sieve():
li=[True]*1000001
li[0],li[1]=False,False
for i in range(2,len(li),1):
if li[i]==True:
for j in range(i*i,len(li),i):
li[j]=False
prime=[]
for i in range(1000001):
if li[i]==True:
prime.append(i)
return prime
def setBit(n):
count=0
while n!=0:
n=n&(n-1)
count+=1
return count
#####################################################################################
mx=10**9+7
def solve():
n,k,d=IP()
if n>pow(k,d):
print(-1)
return
elif d==1:
li=[i for i in range(1,n+1)]
print(*li)
else:
li=[[0 for j in range(n)] for i in range(d)]
student=0
for i in range(1,n):
for j in range(d):
li[j][i]=li[j][i-1]
for j in range(d):
li[j][i]=(li[j][i]+1)%k
if li[j][i]:
break
for i in range(d):
for j in range(n):
print(int(li[i][j])+1,end=" ")
print()
return
#t=II()
#for i in range(t):
solve()
#######
#
#
####### # # # #### # # #
# # # # # # # # # # #
# #### # # #### #### # #
###### # # #### # # # # # | 9 | PYTHON3 |
a = input()
b = a.split()
n = int(b[0])
k = int(b[1])
d = int(b[2])
if n > k**d:
print(-1)
exit()
table = [[1]*d]
for i in range(n - 1):
v = list(table[-1])
j = len(v)-1
while v[j]==k:
v[j]=1
j = j - 1
v[j] = v[j] + 1
table.append(v)
current_power = 1
answer = [0] * n
for m in range(0, d):
current_value = 1
for s in range(0, n):
if s % current_power == 0 and s > 0:
current_value = current_value % k + 1
answer[s] = str(current_value)
current_power *= k
print(" ".join(answer))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, ans[1005][1005], cur[1005];
int main() {
scanf("%d%d%d", &n, &k, &d);
for (int i = 1; i <= d; ++i) cur[i] = 1;
for (int j = 1; j <= n; ++j) {
for (int i = 1; i <= d; ++i) ans[i][j] = cur[i];
if (j == n) break;
int t = d;
while (t >= 1 && cur[t] == k) --t;
if (t < 1) {
printf("-1\n");
return 0;
}
++cur[t];
for (int i = t + 1; i <= d; ++i) cur[i] = 1;
}
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) printf("%d ", ans[i][j]);
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N, K, D;
cin >> N >> K >> D;
vector<vector<int>> A(N, vector<int>(D, 0));
for (int i = 1; i < N; ++i) {
int curry = 1;
for (int j = D - 1; j >= 0; --j) {
int value = A[i - 1][j] + curry;
curry = 0;
if (value == K) {
curry = 1;
value = 0;
}
A[i][j] = value;
}
if (curry == 1) {
cout << -1 << '\n';
return 0;
}
}
for (int j = 0; j < D; ++j) {
for (int i = 0; i < N; ++i) {
cout << A[i][j] + 1 << ' ';
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
import math
n,k,d=map(int,input().split())
if k>=n:
for i in range(d):
print(" ".join([str(i) for i in range(1,n+1)]))
else:
if math.log(n,k)>d:
print(-1)
else:
#arr=[[1 for i in range(n)] for j in range(d)]
pk=1
for i in range(d):
times=0
val=1
for j in range(n):
if times<pk:
print(val,end=" ")
times+=1
else:
val+=1
if val>k:
val=1
times=0
print(val,end=" ")
times+=1
pk*=k
print()
# for val in arr:
# print(" ".join([str(_) for _ in val]))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, ans[1005][1005];
void setup() {
cin >> n >> k >> d;
long long check = 1;
for (int i = 1; i <= d; i++) {
check *= k;
if (check > n) break;
}
if (check < n) {
cout << -1;
exit(0);
}
}
void xuly() {
for (int i = 1; i <= d; i++) ans[1][i] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= d; j++) ans[i][j] = ans[i - 1][j];
for (int j = d; j >= 1; j--) {
if (ans[i][j] < k) {
ans[i][j]++;
break;
}
ans[i][j] = 1;
}
}
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) cout << ans[j][i] << ' ';
cout << '\n';
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
setup();
xuly();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, d, maxx = 1;
cin >> n >> m >> d;
for (int i = 0; i < d; i++) {
maxx *= m;
if (maxx >= n) break;
}
if (maxx < n) {
cout << -1 << endl;
} else {
long long cnt = 1;
for (int i = 1; i <= d; i++) {
int k;
int num = 0;
for (int j = 0; j < n; j++) {
for (k = j; k < j + cnt && k < n; k++) {
cout << num % m + 1 << " ";
}
num++;
j = k - 1;
}
cnt *= m;
if (cnt > n) cnt = n;
cout << endl;
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, d, d1;
long long k, kpre;
long long a[1001][1001] = {};
int main() {
cin >> n >> k >> d;
long long c = 1;
d1 = d, kpre = k;
for (int i = 0; i < d; i++) {
c *= k;
if (c >= n) {
c = 0;
break;
}
}
if (c != 0) return cout << -1 << endl, 0;
k = kpre;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < d; j++) a[i][j] = a[i - 1][j];
for (int j = d - 1; j >= 0; j--) {
a[i][j] = (a[i][j] + 1) % k;
if (a[i][j]) break;
}
}
for (int i = 0; i < d; i++) {
for (int j = 1; j <= n; j++) cout << a[j][i] + 1 << " ";
cout << endl;
}
}
| 9 | CPP |
n, k, d = map(int, input().split())
def go(stu, j, ans, d, n, count):
stu.append(str(j))
if len(stu)==d:
#print('ans mein dala', end=' ')
#print(stu)
#print('ans tha ye', end=' ')
#print(ans)
count.append([1])
ans.append(' '.join(stu))
#print('ye bana ans', end = ' ')
#print(ans)
stu.pop()
return
for i in range(1, k+1):
if len(count)>=n:
break
go(stu, i, ans, d, n, count)
stu.pop()
if n>(k**d):
print(-1)
else:
ans = []
count = []
for j in range(1, k+1):
if len(count)>=n:
break
stu = []
go(stu, j, ans, d, n, count)
x = []
for i in range(n):
x.append(list(map(str, ans[i].split())))
y = [[None for i in range(n)] for j in range(d)]
for i in range(n):
for j in range(d):
y[j][i] = x[i][j]
for i in range(d):
print(' '.join(y[i])) | 9 | PYTHON3 |
n,k,d = map(int, input().split())
if (n > k ** d):
print(-1)
exit()
for i in range(d):
power = k**i
resArray = [((j // power) % k +1) for j in range(n)]
print(' '.join(map(str,resArray))) | 9 | PYTHON3 |
#!/usr/bin/env python3
n, k, d = map(int, input().split())
if k ** d < n:
print(-1)
else:
for i in range(d):
p = k ** i
arr = [j // p % k + 1 for j in range(n)]
print(' '.join(map(str, arr)))
| 9 | PYTHON3 |
n,k,d = map(int, input().split())
if (n > k ** d):
print(-1)
exit()
for i in range(d):
power = k**i
resArray = [((j // power) % k +1) for j in range(n)]
#for j in range(n//(k**i)+1):
# resArray.extend([(j % k) + 1] * (k ** i))
print(' '.join(map(str,resArray))) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long fnc(long long k, long long d) {
if (d <= 1) return k;
if (k > 1000) return 100000;
if (d % 2 == 1) {
return k * fnc(k * k, d / 2);
}
return fnc(k * k, d / 2);
}
bool fc(long long n, long long k, long long d) {
if (k >= n) return 1;
if (fnc(k, d) >= n) return 1;
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, k, d, e = 1;
cin >> n >> k >> d;
if (fc(n, k, d) == false) {
cout << -1;
return 0;
}
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
long long c = j / e;
cout << c % k + 1 << " ";
}
e %= 100000007;
e *= k;
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int Inf = 0x3f3f3f3f;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
return x * f;
}
int n, k, d, t;
int a[1005][1005];
int main() {
n = t = read();
k = read();
d = read();
for (int i = 1; i <= d; ++i) t = t / k + (int)(t % k > 0);
if (t == 1) {
memset(a, 0, sizeof(a));
for (int i = 0; i < n; ++i) {
int tmp = i, j = 1;
while (tmp) {
a[j++][i] = tmp % k;
tmp /= k;
}
}
for (int i = 1; i <= d; ++i) {
for (int j = 0; j < n; ++j) printf("%d ", a[i][j] + 1);
puts("");
}
} else
puts("-1");
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int power(int a, int b) {
int ans = 1;
while (b > 0) {
if (b % 2 == 1) {
ans *= a;
}
a *= a;
b /= 2;
}
return ans;
}
long long int max(long long int a, long long int b) { return a > b ? a : b; }
long long int min(long long int a, long long int b) { return a > b ? b : a; }
int main() {
long long int n, k, d;
cin >> n >> k >> d;
int x = 1;
for (int i = 0; i < d; i++) {
x *= k;
if (x >= n) {
x = -1;
break;
}
}
if (x != -1) {
cout << "-1\n";
return 0;
}
x = 1;
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << 1 + (j / x) % k << " ";
}
cout << endl;
if (x < n) {
x *= k;
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void read() {
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
}
int ans[1111][1111];
int main() {
ios::sync_with_stdio(false);
int n, d, k;
cin >> n >> k >> d;
if (pow(k, d) + 0.5 < (double)n) return cout << -1, 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) ans[i][j] = ans[i - 1][j];
for (int j = d - 1; j >= 0; j--) {
ans[i][j] = (ans[i][j] + 1) % k;
if (ans[i][j]) break;
}
}
for (int i = 0; i < d; i++, cout << endl)
for (int j = 0; j < n; j++) cout << ans[j][i] + 1 << ' ';
return 0;
}
| 9 | CPP |
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
# from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
# import numpy as np
starttime = time.time()
# import numpy as np
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
try:
# sys.setrecursionlimit(int(pow(10,5)))
sys.stdin = open("input.txt", "r")
# sys.stdout = open("../output.txt", "w")
except:
pass
n,k,d=L()
if n>k**d:
print(-1)
exit()
A=[]
for i in range(n):
x=[]
y=i
for j in range(d):
x.append(y%k+1)
y//=k
A.append(x)
# print(A)
for i in range(d):
for j in range(n):
print(A[j][i],end=" ")
print()
endtime = time.time()
# print(f"Runtime of the program is {endtime - starttime}")
| 9 | PYTHON3 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.