solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
int n, m, k, r[N];
char g[N][N];
int main() {
cin.sync_with_stdio(0);
while (cin >> n >> m >> k) {
for (int i = 0; i < n; i++) cin >> g[i];
int d[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
char c[] = {'L', 'U', 'R', 'D'};
memset(r, 0, sizeof(r));
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
for (int k = 0; k < 4; k++) {
int x = i + i * d[k][0];
int y = j + i * d[k][1];
if (0 <= x && x < n && 0 <= y && y < m && g[x][y] == c[k]) r[j]++;
}
for (int i = 0; i < m; i++) printf("%d%c", r[i], i < m - 1 ? ' ' : '\n');
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char grid[2005][2005];
char getGrid(int row, int col) {
if (row > -1 && row < n && col > -1 && col < m) {
return grid[row][col];
} else {
return '0';
}
}
int main() {
scanf("%d", &n);
scanf("%d", &m);
scanf("%d", &k);
for (int i = (int)0; i <= (int)n - 1; i++) scanf("%s", grid[i]);
for (int c = (int)0; c <= (int)m - 1; c++) {
int count = 0;
for (int r = (int)1; r <= (int)n - 1; r++) {
if (getGrid(r + r, c) == 'U') count++;
if (getGrid(r, c + r) == 'L') count++;
if (getGrid(r, c - r) == 'R') count++;
}
printf("%d ", count);
}
}
| 8 | CPP |
n, m, k = map(int, input().split())
field = []
counts = []
for j in range(m):
counts.append(0)
for i in range(n):
row = list(input())
field.append(row)
for i in range(n):
for j in range(m):
if field[i][j] == "L":
jth = j - i
if jth >= 0:
counts[jth] += 1
elif field[i][j] == "R":
jth = i + j
if jth < m:
counts[jth] += 1
elif field[i][j] == "U":
if i % 2 == 0:
counts[j] += 1
#counts = []
#for j in range(m):
# count = 0
# for i in range(n):
# if newfield[i][j] == "S":
# count += 1
# counts.append(str(count))
#print(field)
#print(newfield)
print(" ".join(list(map(str, counts))))
| 8 | PYTHON3 |
n, m, k = map( int, input().split() )
ans = [0] * m
for i in range( n ):
field = input()
for j in range( m ):
if ( field[j] == 'U' ) and ( i % 2 == 0 ): ans[j] += 1
elif ( field[j] == 'L' ) and ( j >= i ): ans[j - i] += 1
elif ( field[j] == 'R' ) and ( j + i < m ): ans[j + i] += 1
print ( ' '.join( map( str, ans ) ) )
# Made By Mostafa_Khaled | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, K;
cin >> N >> M >> K;
char m[2003][2003];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> m[i][j];
}
}
for (int j = 0; j < M; j++) {
int cnt = 0;
for (int i = 0; i < N; i++) {
if (j - i >= 0 && m[i][j - i] == 'R') cnt++;
if (j + i < M && m[i][j + i] == 'L') cnt++;
if (i + i < N && m[i + i][j] == 'U') cnt++;
}
cout << cnt << " ";
}
cout << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
int map[2001][2001] = {0};
int ans[2001] = {0};
int n, m, k;
char ss[2001];
void show() {
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
printf("%d", map[i][j]);
}
printf("\n");
}
}
int main() {
int i, j, k;
scanf("%d %d %d", &n, &m, &k);
for (i = 0; i < n; i++) {
scanf("%s", ss);
for (j = 0; j < m; j++) {
if (ss[j] == '.') {
map[i][j] = 0;
} else if (ss[j] == 'L') {
map[i][j] = 1;
} else if (ss[j] == 'R') {
map[i][j] = 2;
} else if (ss[j] == 'U') {
map[i][j] = 4;
} else {
map[i][j] = 8;
}
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (map[i][j] == 1) {
if (i <= j) ans[j - i]++;
} else if (map[i][j] == 2) {
if (i < m - j) ans[i + j]++;
} else if (map[i][j] == 4) {
if (!(i & 1)) ans[j]++;
} else if (map[i][j] == 8) {
}
}
}
printf("%d", ans[0]);
for (i = 1; i < m; i++) {
printf(" %d", ans[i]);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int res[N];
int n, m, k;
int main() {
scanf("%d%d%d", &n, &m, &k);
char x = getchar();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
x = getchar();
switch (x) {
case 'D': {
if (i == 1) res[j]++;
break;
}
case 'U': {
if ((i - 1) % 2 == 0) res[j]++;
break;
}
case 'R': {
if (j + i - 1 <= m) res[j + i - 1]++;
break;
}
case 'L': {
if (j - i + 1 >= 1) res[j - i + 1]++;
break;
}
default: {
}
}
}
x = getchar();
}
for (int i = 1; i <= m; i++) cout << res[i] << " ";
}
| 8 | CPP |
#include <bits/stdc++.h>
int n, m, k;
char field[2009][2009];
void ReadData() {
scanf("%d %d %d%*c", &n, &m, &k);
for (int i = 0; i < n; i++) {
scanf("%s%*c", field[i]);
}
}
int answer[2009];
void Solve() {
memset(answer, 0, sizeof(answer));
for (int column = 0; column < m; column++) {
for (int row = 1; row < n; row++) {
int pos = row + row;
if (pos < n && field[pos][column] == 'U') {
answer[column]++;
}
pos = column + row;
if (pos < m && field[row][pos] == 'L') {
answer[column]++;
}
pos = column - row;
if (pos >= 0 && field[row][pos] == 'R') {
answer[column]++;
}
}
}
}
void WriteData() {
for (int i = 0; i < m; i++) {
printf("%d ", answer[i]);
}
printf("\n");
}
int main() {
int QWE = 1;
for (int T = 0; T < QWE; T++) {
ReadData();
Solve();
WriteData();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
long long n;
cin >> n;
;
long long m;
cin >> m;
;
long long k;
cin >> k;
;
char mat[n][m];
for (long long i = 0; i < (long long)n; i++) {
for (long long j = 0; j < m; j++) cin >> mat[i][j];
}
for (long long j = 0; j < m; j++) {
long long count = 0;
for (long long k = 1; k < n; k++) {
if (mat[k][j] == 'U' and (k) % 2 == 0) count++;
}
long long pos = 1, in = j;
while (pos < n and in - pos >= 0) {
if (mat[pos][in - pos] == 'R') count++;
pos++;
}
pos = 1;
while (pos < n and in + pos < m) {
if (mat[pos][in + pos] == 'L') count++;
pos++;
}
cout << count << " ";
}
cout << '\n';
;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct __s {
__s() {
if (1) {
ios_base::Init i;
cin.sync_with_stdio(0);
cin.tie(0);
}
}
~__s() {
if (!1)
fprintf(stderr, "Execution time: %.3lf s.\n",
(double)clock() / CLOCKS_PER_SEC);
long long n;
cin >> n;
}
} __S;
long long n, m, k;
string s[2222];
long long a[2222];
int main(void) {
cin >> n >> m >> k;
for (long long i = 0; i < (long long)(n); i++) {
cin >> s[i];
}
for (long long i = 0; i < (long long)(n); i++) {
for (long long j = 0; j < (long long)(m); j++) {
if (s[i][j] == 'L') {
if (j >= i) a[j - i]++;
} else if (s[i][j] == 'R') {
if (j + i < m) a[j + i]++;
} else if (s[i][j] == 'U') {
if (i % 2 == 0) a[j]++;
}
}
}
for (long long i = 0; i < (long long)(m); i++) {
cout << a[i] << " ";
}
cout << '\n';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, ans[2020];
char park[2020][2020];
int main() {
scanf("%d%d%d", &n, &m, &k);
memset(ans, 0, sizeof(ans));
for (int i = 0; i < n; i++) {
getchar();
for (int j = 0; j < m; j++) {
scanf("%c", &park[i][j]);
}
}
for (int k = 0; k < m; k++) {
for (int pos = 1; pos < n; pos++) {
if (0 <= (k - pos) && park[pos][k - pos] == 'R') {
ans[k]++;
}
if ((k + pos) < m && park[pos][k + pos] == 'L') {
ans[k]++;
}
if (2 * pos < n && park[2 * pos][k] == 'U') {
ans[k]++;
}
}
printf("%d ", ans[k]);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:16777216")
using namespace std;
const double Pi = acos(-1.0);
const int INF = 1000000000;
const int MOD = 1000000007;
string s[2005];
char buf[2005];
int res[2005];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = (0); i < (n); ++i) {
scanf("%s", buf);
s[i] = buf;
}
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (m); ++j) {
if (s[i][j] == 'U') {
if (i % 2 == 0) ++res[j];
}
if (s[i][j] == 'R') {
if (i + j < m) {
res[i + j]++;
}
}
if (s[i][j] == 'L') {
if (j - i >= 0) {
res[j - i]++;
}
}
}
}
for (int i = (0); i < (m); ++i) {
cout << res[i] << ' ';
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const int MOD = 1000000007;
const double pi = acos(-1.0);
int ans[2222];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = (0); i <= (n - 1); ++i) {
string s;
cin >> s;
for (int j = (0); j <= (m - 1); ++j) {
if (s[j] == '.') continue;
if (s[j] == 'D') continue;
if (s[j] == 'L') {
if (j >= i) ans[j - i]++;
}
if (s[j] == 'R') {
if (i + j < m) ans[i + j]++;
}
if (s[j] == 'U') {
if (i % 2 == 0) ans[j]++;
}
}
}
for (int j = (0); j <= (m - 1); ++j) cout << ans[j] << " ";
cout << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int _Int() {
char Syed_Zafrul_Lipu[1000];
scanf("%s", Syed_Zafrul_Lipu);
return atoi(Syed_Zafrul_Lipu);
}
inline string _String() {
char Syed_Zafrul_Lipu[100001];
scanf("%s", Syed_Zafrul_Lipu);
string s(Syed_Zafrul_Lipu);
return s;
}
const int M = 2000 + 10;
char ch[M][M];
int main() {
int n = _Int(), a, b, c;
int m = _Int();
int pre = _Int();
for (int i = 0; i < n; i++) scanf("%s", ch[i]);
for (int j = 0; j < m; j++) {
int ans = 0;
for (int i = 0, mv = 0; i < n; i++, mv++) {
if ((i + mv) >= 0 && (i + mv < n) && ch[i + mv][j] == 'U') ans++;
if ((j + mv) >= 0 && (j + mv < m) && ch[i][j + mv] == 'L') ans++;
if ((i - mv) >= 0 && (i - mv < n) && ch[i - mv][j] == 'D') ans++;
if ((j - mv) >= 0 && (j - mv < m) && ch[i][j - mv] == 'R') ans++;
}
printf("%d ", ans);
}
puts("");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int main() {
int n, m, k, i, j, num = 0;
scanf("%d %d %d", &n, &m, &k);
getchar();
char grid[n][m];
int a[m];
for (i = 0; i < m; i++) {
a[i] = 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
grid[i][j] = getchar();
}
getchar();
}
for (i = 0; i < m; i++) {
for (j = 1; j < n; j++) {
if (i + j < m && grid[j][i + j] == 'L') num++;
if (i - j >= 0 && grid[j][i - j] == 'R') num++;
if (j + j < n && grid[j + j][i] == 'U') num++;
}
a[i] = num;
num = 0;
}
for (i = 0; i < m; i++) {
printf("%d%s", a[i], (i == m - 1) ? "\n" : " ");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class P, class Q>
void smin(P &a, Q b) {
if (b < a) a = b;
}
template <class P, class Q>
void smax(P &a, Q b) {
if (b > a) a = b;
}
template <class P, class Q>
bool in(const P &a, const Q &b) {
return a.find(b) != a.end();
}
const int MAXN = 2222;
int n, m, k;
string s[MAXN];
int r[MAXN][MAXN], l[MAXN][MAXN], u[MAXN][MAXN], t[MAXN];
int main() {
cin >> n >> m >> k;
for (int i = (0); i < int(n); ++i) cin >> s[i];
for (int i = (0); i < int(n); ++i)
for (int j = (0); j < int(m); ++j) {
if (s[i][j] == 'R') r[i][j]++;
if (s[i][j] == 'L') l[i][j]++;
if (s[i][j] == 'U') u[i][j]++;
}
for (int i = (0); i < int(n); ++i)
for (int j = (0); j < int(m); ++j) {
if (j - i >= 0) t[j] += r[i][j - i];
if (j + i < m) t[j] += l[i][j + i];
if (i + i < n) t[j] += u[i + i][j];
}
for (int i = (0); i < int(m); ++i) cout << t[i] << " ";
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long br[1000009], i, j, k, l, m, n, sum, cnt, num, cr[1000009];
char ar[4000][4000];
int main() {
scanf("%lld %lld %lld", &n, &m, &cnt);
for (i = 0; i < n; i++) {
scanf("%s", &ar[i]);
}
for (j = 0; j < m; j++) {
for (i = 2; i < n; i = i + 2) {
{
if (ar[i][j] == 'U') cr[j]++;
}
}
}
for (i = 1; i < n; i++) {
for (j = 0; j < m; j++) {
if (ar[i][j] == 'L') {
if (j - i >= 0) cr[j - i]++;
} else if (ar[i][j] == 'R')
if (j + i < m) cr[j + i]++;
}
}
for (i = 0; i < m; i++) printf("%lld ", cr[i]);
return 0;
}
| 8 | CPP |
n, m, k = map(int, input().split())
input()
s = [0] * m
for i in range(1, n):
for j, x in enumerate(input()):
if x == 'L':
if j - i >= 0: s[j - i] += 1
elif x == 'R':
if j + i < m: s[j + i] += 1
elif x == 'U' and i & 1 == 0: s[j] += 1
print(' '.join(map(str, s))) | 8 | PYTHON3 |
#include <bits/stdc++.h>
time_t waktu = clock();
void gettime() {
printf("\nTime : %.2lf", (clock() - waktu) / double(CLOCKS_PER_SEC));
}
int comp(int a, int b) { return (a > b); }
using namespace std;
int main() {
int hasil[2002] = {}, n, m, k, x, i, j;
char data[2002];
scanf("%d %d %d", &n, &m, &k);
for (i = 0; i < n; i++) {
scanf("%s", &data);
x = strlen(data);
for (j = 0; j < x; j++) {
if (data[j] == 'R') {
if (i + j < m) {
hasil[i + j]++;
}
} else if (data[j] == 'L') {
if (j - i >= 0) {
hasil[j - i]++;
}
} else if (data[j] == 'U') {
if (i % 2 == 0) {
hasil[j]++;
}
}
}
}
for (i = 0; i < m; i++) {
printf("%d ", hasil[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, i, j, res, col;
cin >> n >> m >> k;
char park[n][m];
for (i = 0; i < n; i++)
for (j = 0; j < m; j++) cin >> park[i][j];
for (col = 0; col < m; col++) {
res = 0;
i = 1;
while (i < n && col + i < m) {
if (park[i][col + i] == 'L') res++;
i++;
}
i = 1;
while (i < n && col - i >= 0) {
if (park[i][col - i] == 'R') res++;
i++;
}
i = 2;
while (i < n) {
if (park[i][col] == 'U' && i % 2 == 0) res++;
i++;
}
cout << res << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[4005][4005];
vector<long long> rowr[2005];
vector<long long> rowl[2005];
vector<long long> col[2005];
int main() {
long long n, m, k, i, j;
cin >> n >> m >> k;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
if (a[i][j] == 'R')
rowr[i].push_back(j);
else if (a[i][j] == 'L') {
rowl[i].push_back(j);
} else if (a[i][j] == 'U') {
col[j].push_back(i);
}
}
}
n--;
m--;
long long t = 1;
long long ans = 0;
long long y;
for (i = 0; i <= m; i++) {
t = 1;
ans = 0;
for (j = 1; j <= n; j++) {
if (i + j <= m)
if (a[j][i + j] == 'L') ans++;
if (i - j >= 0)
if (a[j][i - j] == 'R') ans++;
if (j + j <= n)
if (a[j + j][i] == 'U') ans++;
}
cout << ans << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[2010];
char a[2010][2010];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = (0); i < (n); ++i) scanf("%s", a[i]);
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (m); ++j) {
if ((a[i][j] == 'D') || (a[i][j] == '.')) continue;
if (a[i][j] == 'U') {
if (i & 1) continue;
ans[j]++;
}
if (a[i][j] == 'R') {
if (i + j < m) ans[i + j]++;
}
if (a[i][j] == 'L') {
if (j - i >= 0) ans[j - i]++;
}
}
}
for (int i = (0); i < (m); ++i) {
if (i) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char a[2001][2001];
int ans[2001];
void init() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) scanf("%s", &a[i][0]);
for (int i = 1; i <= n; i++)
for (int j = 0; j < m; j++) {
if (j - i + 1 >= 0 && a[i][j - i + 1] == 'R') ans[j]++;
if (j + i - 1 < m && a[i][j + i - 1] == 'L') ans[j]++;
if (i + i - 1 <= n && a[i + i - 1][j] == 'U') ans[j]++;
}
for (int i = 0; i < m; i++) cout << ans[i] << " ";
}
int main() {
init();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char a[2001][2001];
int ans[2001];
void init() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) scanf("%s", &a[i]);
for (int i = 1; i <= n; i++)
for (int j = 0; j < m; j++) {
if (j - i + 1 >= 0 && a[i][j - i + 1] == 'R') ans[j]++;
if (j + i - 1 < m && a[i][j + i - 1] == 'L') ans[j]++;
if (i + i - 1 <= n && a[i + i - 1][j] == 'U') ans[j]++;
}
for (int i = 0; i < m; i++) cout << ans[i] << " ";
}
int main() {
init();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2005;
int N, M, K;
char row[MAX];
int ans[MAX];
int main() {
scanf("%d%d%d", &N, &M, &K);
for (int i = 1; i <= N; i++) {
scanf("%s", row + 1);
for (int j = 1; j <= M; j++) {
if (row[j] == 'U') {
ans[j] += i & 1;
}
if (row[j] == 'R') {
if (j + i - 1 <= M) ans[j + i - 1]++;
}
if (row[j] == 'L') {
if (j - i + 1 > 0) ans[j - i + 1]++;
}
}
}
for (int i = 1; i <= M; i++) {
if (i > 1) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
const double pi = 2.0 * asin(1.0), eps = 1e-12;
const int maxn = 2100, maxm = 1100000, inf = 0x3f3f3f3f;
char ch[maxn][maxn];
int ans[maxn];
int main() {
int n, m, i, j, l, x;
while (scanf("%d%d%d", &n, &m, &l) == 3) {
memset(ans, 0, sizeof(ans));
for (i = 0; i < n; i++) {
scanf("%s", ch[i]);
for (j = 0; j < m; j++) {
if (ch[i][j] == 'U') {
if (i % 2 == 0) ans[j]++;
} else if (ch[i][j] == 'L') {
x = j - i;
if (x >= 0) ans[x]++;
} else if (ch[i][j] == 'R') {
x = j + i;
if (x < m) ans[x]++;
}
}
}
for (i = 0; i < m; i++) {
if (i != 0) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char w[2010][2010];
int num[2010][2010];
int ans[2010];
int n, m, kk;
int main() {
scanf("%d %d %d\n", &n, &m, &kk);
memset(w, 0, sizeof(w));
for (int i = 0; i < n; i++) gets(w[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (w[i][j] == 'U' && !(i & 1)) num[i / 2][j]++;
if (w[i][j] == 'L' && j - i >= 0) num[i][j - i]++;
if (w[i][j] == 'R' && j + i < m) num[i][j + i]++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ans[j] += num[i][j];
}
}
for (int i = 0; i < m; i++) printf("%d ", ans[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int wynik[2001];
int n, m, k;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char a;
cin >> a;
if (a == 'U' and i % 2 == 0) wynik[j]++;
if (a == 'L' and j - i >= 0) wynik[j - i]++;
if (a == 'R' and j + i < m) wynik[j + i]++;
}
}
for (int i = 0; i < m; i++) cout << wynik[i] << " ";
return 0;
}
| 8 | CPP |
def f():
n, m, k = map(int, input().split())
a = []
for i in range(n):
a.append(list(input().strip()))
res = [0 for i in range(m)]
for j in range(m):
for i in range(1, n):
if j - i >= 0 and a[i][j - i] == 'R':
res[j] += 1
if j + i < m and a[i][i + j] == 'L':
res[j] += 1
if i + i < n and a[i + i][j] == 'U':
res[j] += 1
print(' '.join(list(map(str, res))))
f()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
using namespace std;
int n, m, k;
string a;
int b[2020];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 0; j < m; j++) {
if (a[j] == 'U' && i % 2 == 0)
b[j]++;
else if (a[j] == 'L' && j - i >= 0)
b[j - i]++;
else if (a[j] == 'R' && j + i < m)
b[i + j]++;
}
}
for (int i = 0; i < m; i++) cout << b[i] << ' ';
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string grid[2005];
vector<pair<int, int> > v[4];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int main() {
int n, m, k;
scanf("%d%d%d", &m, &n, &k);
for (int i = 0; i < m; i++) {
cin >> grid[i];
for (int j = 0; j < n; j++) {
if (grid[i][j] == 'L')
v[0].push_back(pair<int, int>(i, j));
else if (grid[i][j] == 'R')
v[1].push_back(pair<int, int>(i, j));
else if (grid[i][j] == 'U')
v[2].push_back(pair<int, int>(i, j));
else if (grid[i][j] == 'D')
v[3].push_back(pair<int, int>(i, j));
}
}
for (int i = 0; i < 4; i++) sort(v[i].begin(), v[i].end());
for (int j = 0; j < n; j++) {
if (j) putchar(' ');
int cnt = 0;
for (int i = 1; i < m; i++) {
for (int kk = 0; kk < 4; kk++) {
pair<int, int> p(i + i * dx[kk], j + i * dy[kk]);
if (p.first < 0 || p.first >= m || p.second < 0 || p.second >= n)
continue;
if (binary_search(v[kk].begin(), v[kk].end(), p)) {
cnt++;
}
}
}
printf("%d", cnt);
}
puts("");
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int num[2010] = {0};
int main() {
long long n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < m; j++) {
if (s[j] == 'R') {
if (i + j < m) num[i + j]++;
} else if (s[j] == 'L') {
if (j - i >= 0) num[j - i]++;
} else if (s[j] == 'U') {
if (i % 2 == 0) num[j]++;
} else if (s[j] == 'D') {
}
}
}
for (int i = 0; i < m; i++) {
cout << num[i] << " ";
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct spider {
int row, col;
spider() : row(0), col(0) {}
spider(int row, int col) : row(row), col(col) {}
bool operator<(const spider &rhs) const {
if (row == rhs.row) return col < rhs.col;
return row < rhs.row;
}
};
const int MAXN = 2005;
char line[MAXN];
set<spider> row_to_left[MAXN];
set<spider> row_to_right[MAXN];
set<spider> col_to_up[MAXN];
int main() {
int R, C, k;
scanf("%d %d %d", &R, &C, &k);
for (int i = 0; i < R; ++i) {
scanf("%s", line);
for (int j = 0; j < C; ++j) {
if (line[j] == 'L') row_to_left[i].insert(spider(i, j));
if (line[j] == 'R') row_to_right[i].insert(spider(i, j));
if (line[j] == 'U') col_to_up[j].insert(spider(i, j));
}
}
for (int c = 0; c < C; ++c) {
int ans = 0;
for (int r = 1; r < R; ++r) {
if (row_to_left[r].find(spider(r, c + r)) != row_to_left[r].end()) ans++;
if (row_to_right[r].find(spider(r, c - r)) != row_to_right[r].end())
ans++;
if (col_to_up[c].find(spider(2 * r, c)) != col_to_up[c].end()) ans++;
}
printf("%d ", ans);
}
return 0;
}
| 8 | CPP |
# -*- coding: utf-8 -*-
import sys
f = sys.stdin
n, m, k = map(int, f.readline().strip().split())
s = f.readline().strip()
sp = [0]*m
for i in range(1, n):
s = f.readline().strip()
for l in range(m):
if s[l]=='U':
if i % 2 == 0:
sp[l] += 1
elif s[l]=='R':
mi = l+i
if mi<m :
sp[mi] += 1
elif s[l]=='L':
mi = l-i
if mi>=0 :
sp[mi] += 1
#print(i, s, sp)
print(' '.join([str(it) for it in sp])) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, i, j, count[2002] = {0}, t;
char arr[2002][2002];
cin >> n >> m >> k;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> arr[i][j];
}
}
for (t = 1; t < n; t++) {
i = t;
for (j = 0; j < m; j++) {
if (i - t >= 0 && arr[i - t][j] == 'D') count[j]++;
if (i + t < n && arr[i + t][j] == 'U') count[j]++;
if (j - t >= 0 && arr[i][j - t] == 'R') count[j]++;
if (j + t < m && arr[i][j + t] == 'L') count[j]++;
}
}
for (i = 0; i < m; i++) cout << count[i] << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int const LIM = 2100;
int n, m, k;
char g[LIM][LIM];
int check(int x, int y, int time) {
int res = 0;
int x1 = x - time, y1 = y;
if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && g[x1][y1] == 'D') ++res;
x1 = x + time;
y1 = y;
if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && g[x1][y1] == 'U') ++res;
x1 = x;
y1 = y - time;
if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && g[x1][y1] == 'R') ++res;
x1 = x;
y1 = y + time;
if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && g[x1][y1] == 'L') ++res;
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> g[i][j];
}
}
for (int i = 0; i < m; ++i) {
int ans = 0;
for (int j = 0; j < n; ++j) ans += check(j, i, j);
cout << ans << ' ';
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int C[4100];
int main() {
int r, c, k;
cin >> r >> c >> k;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
char tmp;
cin >> tmp;
if (tmp == '.')
continue;
else if (tmp == 'D')
continue;
else if (tmp == 'U') {
if (i % 2) C[j]++;
} else if (tmp == 'R') {
C[j + i - 1]++;
} else if (tmp == 'L') {
if (j - (i - 1) < 0) {
continue;
} else {
C[j - (i - 1)]++;
}
}
}
}
for (int i = 1; i <= c; i++) {
cout << C[i];
if (i != c) cout << " ";
}
return 0;
}
| 8 | CPP |
n,m,k=map(int,input().split())
seen = [0 for _ in range(m)]
for i in range(n):
S = list(input())
for j in range(m):
if S[j] == 'U' and not i&1:
seen[j]+=1
elif S[j] == 'L' and j-i>=0:
seen[j-i]+=1
elif S[j] == 'R' and j+i<m:
seen[j+i]+=1
print(*seen, sep=" ") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int fin[4005];
int main() {
int i, t, n, x, k, h, m;
cin >> n >> m >> k;
memset(fin, 0, sizeof(fin));
for (__typeof(1) i = 1; i <= n; i++) {
for (__typeof(1) j = 1; j <= m; j++) {
char c;
cin >> c;
if (c == 'R') fin[j + i - 1]++;
if (c == 'U') {
if (i & 1) fin[j]++;
}
if (c == 'L') {
if ((j - (i - 1)) < 0)
continue;
else
fin[j - (i - 1)]++;
}
}
}
for (__typeof(1) i = 1; i <= m; i++) {
cout << fin[i] << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, tab[1000007];
char slowo[1000007];
int main() {
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++) {
scanf("%s", slowo);
for (int j = 0; j < m; j++)
if (slowo[j] == 'U') {
if ((i & 1) == 0) tab[j]++;
} else {
if (slowo[j] == 'R') {
if (i + j <= m) tab[j + i]++;
} else {
if (slowo[j] == 'L') {
if (j - i >= 0) tab[j - i]++;
}
}
}
}
for (int i = 0; i < m; i++) printf("%d ", tab[i]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, ans;
char a[2050][2050];
int go(int w) {
int cnt = 0;
for (int i = 2; i <= n; i++) {
if (w - i + 1 >= 1)
if (a[i][w - i + 1] == 'R') cnt++;
if (w + i - 1 <= m)
if (a[i][w + i - 1] == 'L') cnt++;
if (i + i - 1 <= n)
if (a[i + i - 1][w] == 'U') cnt++;
}
return cnt;
}
int main() {
char w;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cin >> a[i][j];
}
for (int i = 1; i <= m; i++) {
ans = go(i);
cout << ans;
if (i < m) cout << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T, size_t N>
int SIZE(const T (&t)[N]) {
return N;
}
template <typename T>
int SIZE(const T &t) {
return t.size();
}
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B>
string to_string(const pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0) res += '\n';
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += '\n';
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0) res += '\n';
return res;
}
void dbgm() { ; }
template <typename Heads, typename... Tails>
void dbgm(Heads H, Tails... T) {
cerr << to_string(H) << " | ";
dbgm(T...);
}
bool flag = true;
int n, k, d;
bool can() {
if (n <= k) return 1;
if (k == 1) {
if (n == 1)
return 1;
else
return 0;
}
int t = 1;
for (int i = 0; i <= d; i++) {
if (n <= t) return 1;
t = t * k;
}
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k >> d;
if (!can()) {
flag = false;
}
if (flag) {
vector<vector<int>> ans(d, vector<int>(n));
for (int i = 0; i < n; i++) {
int nw = i + 1;
for (int j = 0; j < d; j++) {
ans[j][i] = nw % k;
nw /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << ans[i][j] + 1 << " ";
}
cout << endl;
}
} else {
cout << -1 << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int n, k, d, tot, a[1010], ans[1010][1010];
void tr(int x) {
if (x > d) {
++tot;
for (int i = 1; i <= d; ++i) ans[i][tot] = a[i];
return;
}
for (int i = 1; i <= k; ++i) {
a[x] = i;
tr(x + 1);
if (tot >= n) return;
}
}
int main() {
scanf("%d%d%d", &n, &k, &d);
tr(1);
if (tot < n)
printf("-1\n");
else {
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) {
printf("%d", ans[i][j]);
if (j == n)
printf("\n");
else
printf(" ");
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1005;
int n, k, d;
int res[Maxn][Maxn];
bool Check(int n, int k, int d) {
long long cur = 1;
while (cur < n && d) {
cur *= k;
d--;
}
return n <= cur;
}
void Solve(int num) {
int j = num;
for (int i = d - 1; i >= 0; i--) {
int cur = num % k + 1;
res[i][j] = cur;
num /= k;
}
}
int main() {
scanf("%d %d %d", &n, &k, &d);
if (Check(n, k, d)) {
for (int i = 0; i < n; i++) Solve(i);
for (int i = 0; i < d; i++)
for (int j = 0; j < n; j++)
printf("%d%c", res[i][j], j + 1 < n ? ' ' : '\n');
} else
printf("-1\n");
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 1001;
int ans[MAXN][MAXN];
void solve() {
int n, k, d;
cin >> n >> k >> d;
bool possible = false;
int vv = 1;
for (int i = 1; i <= d; ++i) {
vv *= k;
if (vv >= n) {
possible = true;
break;
}
}
if (!possible) {
cout << -1 << endl;
return;
}
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] %= 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;
}
}
int main() {
int t = 1;
while (t--) solve();
return 0;
}
| 9 | CPP |
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
def base(x,k,d):
ans = []
while x:
ans.append(x%k+1)
x //= k
ans.reverse()
return [1]*(d-len(ans))+ans
def main():
n,k,d = map(int,input().split())
if n == 1:
for _ in range(d):
print(1)
exit()
if k == 1 or (d <= 10 and n > pow(k,d)):
print(-1)
exit()
arr = [base(x,k,d) for x in range(n)]
ans = [[0]*n for _ in range(d)]
for i in range(n):
for j in range(d):
ans[j][i] = arr[i][j]
for i in ans:
print(*i)
# Fast IO Region
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")
if __name__ == "__main__":
main() | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long cl(long double a) {
if (a > (long long)a) {
return (long long)a + 1;
} else {
return (long long)a;
}
}
long long flr(long double a) { return (long long)a; }
const long long M = 1010;
long long ans[M][M];
void solve() {
long long n, k, d;
cin >> n;
cin >> k;
cin >> d;
long long pos = 1;
bool flag = false;
for (long long i = 0; i < d; i++) {
pos *= k;
if (pos >= n) {
flag = true;
break;
}
}
if (!flag) {
cout << -1 << "\n";
return;
}
long long op;
long long f = 1;
for (long long i = 0; i < n; i++) {
op = f;
for (long long j = 0; j < d; j++) {
ans[i][j] = op % k;
op /= k;
}
f++;
}
for (long long j = 0; j < d; j++) {
for (long long i = 0; i < n; i++) {
cout << ans[i][j] + 1 << " ";
}
cout << "\n";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
t = 1;
while (t--) solve();
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[1010][1010];
int main() {
ios_base::sync_with_stdio(0);
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 = 1;
break;
}
}
if (!check) {
cout << -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++) {
cout << ans[j][i] + 1 << ' ';
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[1005][1005];
int main() {
long long n, k, d;
cin >> n >> k >> d;
long long l = 1, f = 1;
for (int i = 1; i <= d; i++) {
l *= k;
if (l >= n) {
f = 0;
break;
}
}
if (f) {
cout << "-1\n";
return 0;
}
for (int i = 0; i < n; i++) {
int p = i, j = 0;
while (p > 0) {
ans[j++][i] = p % k;
p /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << ans[i][j] + 1 << " ";
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[1005][1005];
int power(int a, int b) {
if (b == 0) return 1;
int p = power(a, b / 2);
if (b % 2 == 0)
return p * p;
else
return p * p * a;
}
int main() {
int n, k, d;
scanf("%d%d%d", &n, &k, &d);
double tmp = pow(2, log2(n) / d);
int tk = (int)ceil((float)tmp);
if (tk > k) {
printf("-1\n");
} else {
k = tk;
for (int i = d - 1; i >= 0; i--) {
int change = power(k, (d - 1) - i);
int cnt = 0;
int print = 1;
for (int j = 0; j < n; j++) {
if (cnt == change) {
cnt = 0;
print = (print + 1) % k;
if (print == 0) print = k;
}
ans[i][j] = print;
cnt++;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) printf("%d ", ans[i][j]);
printf("\n");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d, k;
bool flag = 1;
cin >> n >> k >> d;
long long int tem = 1;
for (int i = 0; i < d; i++) {
tem *= k;
if (tem >= n) {
flag = 0;
break;
}
}
if (flag) {
cout << -1 << endl;
return 0;
}
vector<long long int> ans[n + 5];
for (long long int i = 0; i < n; i++) {
long long int num = i;
for (long long int j = 0; j < d; j++) {
ans[i].push_back(num % k + 1);
num /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << ans[j][i] << " ";
cout << endl;
}
return 0;
}
| 9 | CPP |
import copy
inp = list(map(int, input().split()))
n, k, d = inp[0], inp[1], inp[2]
c = 0
ans = []
def rec(arr):
global c
if c >= n: return
if len(arr) == d:
c += 1
ans.append(copy.deepcopy(arr))
return
temp = copy.deepcopy(arr)
temp.append(0)
for i in range(1, k + 1):
if c >= n:
break
temp[-1] = i
rec(temp)
if (k**d < n):
print(-1)
else:
rec([])
a = [[0 for i in range(n)] for j in range(d)]
for i in range(n):
for j in range(d):
a[j][i] = ans[i][j]
for i in range(d):
print(*a[i]) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long days[1000][1000];
long long n, k, d;
int set_days(long long *cur, long long *prev) {
for (int i = 0; i < d; i++) {
cur[i] = prev[i];
}
for (int i = 0; i < d; i++) {
if (prev[i] < k - 1) {
cur[i] = prev[i] + 1;
break;
}
cur[i] = 0;
}
for (int i = 0; i < d; i++) {
if (cur[i] != 0) {
return 0;
}
}
return 1;
}
int main() {
cin >> n >> k >> d;
memset(days, 0, sizeof(days));
for (int i = 1; i < n; i++) {
int repeat = set_days(days[i], days[i - 1]);
if (repeat) {
printf("-1\n");
return 0;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
if (j != 0) {
cout << " ";
}
cout << days[j][i] + 1;
}
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int readInt() {
register int c = getchar();
int x = 0;
for (; (c < 48 || c > 57); c = getchar())
;
for (; c > 47 && c < 58; c = getchar()) {
x = x * 10 + c - 48;
}
return x;
}
int main() {
int n, k, d;
cin >> n >> k >> d;
int ans[n][d];
for (int i = 0; i < int(n); i++) {
int t = i;
for (int j = 0; j < int(d); j++) {
ans[i][j] = t % k + 1;
t /= k;
}
if (t) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < int(d); i++) {
for (int j = 0; j < int(n); j++) {
cout << ans[j][i] << " ";
}
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 100;
int n, d, k, cur;
int a[maxn][maxn];
int tianchong(int st, int ed, int cur) {
if (cur > d) {
return maxn;
}
int l = ed - st + 1;
if (l <= k) {
for (int i = st; i <= ed; i++) {
a[i][cur] = i - st + 1;
}
return 1;
}
int m = l / k;
if (l % k != 0) {
m++;
}
int ret = 0;
int i;
int cnt = 0;
for (i = st; i + m <= ed; i += m) {
cnt++;
ret = max(ret, tianchong(i, i + m - 1, cur + 1));
for (int j = i; j < i + m; j++) {
a[j][cur] = cnt;
}
}
cnt++;
if (i + m > ed && i <= ed) {
ret = max(ret, tianchong(i, ed, cur + 1));
for (int j = i; j <= ed; j++) {
a[j][cur] = cnt;
}
}
return ret + 1;
}
void print() {
for (int j = 1; j <= d; j++) {
for (int i = 1; i <= n; i++) {
if (i != 1) printf(" ");
if (a[i][j])
printf("%d", a[i][j]);
else
printf("1");
}
printf("\n");
}
return;
}
int main() {
scanf("%d %d %d", &n, &k, &d);
if (tianchong(1, n, 1) > d) {
printf("-1\n");
} else {
print();
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int arr[2][1005];
int main() {
int n, k, d, a, c = 1;
cin >> n >> k >> d;
a = n / k + (n % k != 0);
while (c <= d && a > 1) {
a = a / k + (a % k != 0);
c++;
}
if (c > d) {
puts("-1");
return 0;
}
for (int i = 0; i < n; i++) {
arr[0][i] = i % k;
printf("%d ", arr[0][i] + 1);
}
puts("");
int lim = n / k, indx;
bool t = 0;
for (int j = 1; j < d; j++) {
t = !t;
indx = 0;
for (int i = 0; i <= lim; i++) {
for (int ii = 0; ii < k && indx < n; ii++) arr[t][indx++] = arr[!t][i];
}
for (int i = 0; i < n; i++) printf("%d ", arr[t][i] + 1);
puts("");
}
return 0;
}
| 9 | CPP |
#!/usr/bin/env python3
from sys import stdin
import copy
def solve(tc):
n, k, d = map(int, stdin.readline().split())
ok = False
possibilities = 1
for i in range(d):
possibilities *= k
if possibilities>=n:
ok = True
break
if not ok:
print(-1)
return
mat = [[0 for i in range(n)] for j in range(d)]
for i in range(n):
num = i
p = 0
while p<d and num:
mat[p][i] = (num % k) + 1
num //= k
p += 1
for j in range(p, d):
mat[j][i] = mat[j][i] + 1
for i in range(d):
print(' '.join(map(lambda x : str(x), mat[i])))
tc = 1
solve(tc)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const double EPS = 1e-9;
const int MAXN = (int)1e5 + 10;
int ANS[1010][1010];
int n, k, d;
void next(int c) {
for (int i = 0; i < d; ++i) {
if (ANS[i][c] == k)
ANS[i][c] = 1;
else {
ANS[i][c]++;
break;
}
}
for (int i = 0; i < d; ++i) ANS[i][c + 1] = ANS[i][c];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k >> d;
long long t = 1;
for (int i = 0; i < d && t < n; ++i, t *= k)
;
if (t < 1LL * n) {
cout << -1 << '\n';
exit(0);
}
for (int j = 0; j < d; ++j) ANS[j][0] = ANS[j][1] = 1;
for (int i = 1; i < n; ++i) {
next(i);
}
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;
const int MAX = 1e3 + 3;
int m[MAX][MAX];
int N, K, D;
int main(int argc, char** argv) {
scanf("%d%d%d", &N, &K, &D);
for (int i = (1); i <= (D); i++) m[1][i] = 1;
for (int i = (2); i <= (N); i++) {
for (int j = (D); j >= (1); j--) {
m[i][j] += m[i - 1][j];
if (j == D) m[i][j]++;
if (m[i][j] > K) m[i][j] = 1, m[i][j - 1]++;
if (m[i][0]) {
puts("-1");
exit(0);
}
}
}
for (int j = (1); j <= (D); j++) {
for (int i = (1); i <= (N); i++) printf("%d ", m[i][j]);
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
do {
int n, k, d;
if (scanf("%d %d %d\n", &n, &k, &d) == EOF) {
break;
}
vector<vector<int>> matrix;
vector<int> row(d + 1, 0);
matrix.push_back(row);
vector<int> perm(d + 1, 1);
matrix.push_back(perm);
int count = 1;
int pos = d;
while (pos > 0) {
int v = perm[pos] + 1;
if (v > k) {
for (int i = pos; i <= d; ++i) {
perm[i] = 1;
}
--pos;
while (pos > 1 && perm[pos] + 1 > k) {
perm[pos] = 1;
--pos;
}
if (pos < 1) {
break;
}
if (pos == 1 && perm[pos] + 1 > k) {
break;
}
++perm[pos];
pos = d;
++count;
} else {
perm[pos] = v;
++count;
}
matrix.push_back(perm);
if (count >= n) {
break;
}
}
if (count >= n) {
for (int j = 1; j <= d; ++j) {
for (int i = 1; i <= n; ++i) {
if (i == 1) {
printf("%d", matrix[i][j]);
} else {
printf(" %d", matrix[i][j]);
}
}
printf("\n");
}
} else {
printf("-1\n");
}
} while (true);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (auto x : v) os << x << " ";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
for (auto it : v) os << it << " ";
return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v) {
for (auto it : v) os << it.first << " : " << it.second << "\n";
return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
os << "(";
os << v.first << ", " << v.second << ")";
return os;
}
template <typename T>
istream& operator>>(istream& in, vector<T>& v) {
for (T& it : v) in >> it;
return in;
}
map<long long, long long> counts(const vector<long long>& v) {
map<long long, long long> m;
for (auto x : v) {
m[x]++;
}
return m;
}
map<char, long long> counts(const string& s) {
map<char, long long> m;
for (auto x : s) {
m[x]++;
}
return m;
}
vector<long long> next_perm(vector<long long> a, long long k) {
for (long long i = a.size() - 1; i >= 0; i--) {
if (a[i] != k) {
a[i]++;
break;
} else {
a[i] = 1;
}
}
return a;
}
void solve() {
long long n, k, d;
cin >> n >> k >> d;
if (n > pow(k, d)) {
cout << -1;
return;
}
vector<long long> nums(d, 1);
vector<vector<long long> > seq(d, vector<long long>(n));
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < d; j++) {
seq[j][i] = nums[j];
}
nums = next_perm(nums, k);
}
for (long long i = 0; i < d; i++) {
cout << seq[i] << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solve();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, a[1005][1005], ct = 1;
int main(int argc, const char* argv[]) {
cin >> n >> k >> d;
if ((k == 1 && n != 1) || (n == 3 && k == 2 && d == 1)) {
cout << -1 << endl;
return 0;
} else if (n == 1) {
for (int i = 0; i < d; i++) {
cout << 1 << endl;
}
return 0;
}
int temp = 1;
for (int i = 0; i < d; i++) {
temp *= k;
if (temp > n) {
break;
}
}
if (temp < n) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < d; i++) {
int pnt = 0;
for (int j = 0; j < n; j++) {
int l;
for (l = j; l < n && l - j < ct; l++) {
cout << (pnt % k) + 1 << " ";
}
pnt++;
j = l - 1;
}
if (ct < 1005) {
ct *= k;
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int a[1000][1000] = {0};
int cek(int n, int k, int d) {
long long sum = 1;
for (int i = 0; i < d; i++) {
sum = sum * k;
if (sum >= n) {
return 1;
}
}
return 0;
}
void rek(int n, int i, int j, int k) {
if (n == 0) {
return;
} else {
a[i][j] = n % k;
rek(n / k, i - 1, j, k);
return;
}
}
void cetak(int n, int k, int d) {
for (int i = 0; i < n; i++) {
rek(i, d - 1, i, k);
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
printf("%d%c", a[i][j] + 1, (j == n - 1) ? '\n' : ' ');
}
}
}
int main() {
int n, k, d;
scanf("%d %d %d", &n, &k, &d);
if (cek(n, k, d) == 1) {
cetak(n, k, d);
} else {
printf("-1\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long MAX(long long a, long long b) {
if (a > b) return a;
return b;
}
long long MIN(long long a, long long b) {
if (a < b) return a;
return b;
}
long long POW(long long a, long long b) {
long long exit = 1;
for (int i = 0; i < b; i++) exit *= a;
return exit;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long n, k, d;
cin >> n >> k >> d;
long long mult = 1;
bool ok = false;
for (int i = 0; i < d; i++) {
mult *= k;
if (mult >= n) {
ok = true;
break;
}
}
if (!ok) {
cout << "-1" << endl;
return 0;
}
long long exit[d][n];
memset(exit, 0, sizeof exit);
for (long long i = 0; i < n; i++) {
exit[0][i] = 0;
}
for (long long i = 1; i < n; i++) {
for (long long j = 0; j < d; j++) exit[j][i] = exit[j][i - 1];
for (long long j = d - 1; j >= 0; j--) {
exit[j][i] = (exit[j][i] + 1) % k;
if (exit[j][i] != 0) {
break;
}
}
}
for (long long i = 0; i < d; i++) {
for (long long j = 0; j < n; j++) {
cout << exit[i][j] + 1 << " ";
}
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int n, k, d, ncomb = 1, kidn = 1;
vector<vector<int> > kidbuses;
vector<int> buses;
void bt() {
if (kidn > n) return;
if (buses.size() == d) {
kidbuses.push_back(buses);
kidn++;
} else {
for (int i = 1; i <= k; i++) {
buses.push_back(i);
bt();
if (kidn > n) break;
buses.pop_back();
}
}
}
int main() {
cin >> n >> k >> d;
bt();
if (kidbuses.size() != n || kidbuses[0].size() != d)
cout << -1 << endl;
else
for (int i = 0; i < d; i++, cout << endl)
for (int j = 0; j < n; j++) {
if (j) cout << ' ';
cout << kidbuses[j][i];
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void dbg_out() { cerr << "\b\b]\n"; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << H << ", ";
dbg_out(T...);
}
const int N = 1002;
vector<vector<int>> ans(N, vector<int>(N, -1));
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k, d;
cin >> n >> k >> d;
if (k >= n) {
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) {
cout << j << ' ';
}
cout << '\n';
}
return 0;
}
bool ok = true;
function<void(int, int, int, int)> go = [&](int l, int r, int bus, int d) {
if (d < 0) return;
if (d == 1) {
if (r - l + 1 > 1) {
ok = false;
return;
}
}
for (int i = l; i <= r; ++i) {
ans[d][i] = bus;
}
int rem = (r - l + 1) % k;
int segment = (r - l + 1) / k;
if (segment) {
int curr = l;
for (int i = 1; i <= k; ++i) {
int y = curr + segment + (i <= rem) - 1;
go(curr, y, i, d - 1);
curr = y + 1;
}
} else {
for (int i = 0; i < rem; ++i) {
go(l + i, l + i, i + 1, d - 1);
}
}
};
int l = 1, r = n;
int rem = (r - l + 1) % k;
int segment = (r - l + 1) / k;
int curr = 1;
for (int i = 1; i <= k; ++i) {
int y = curr + segment + (i <= rem) - 1;
go(curr, y, i, d);
curr = y + 1;
}
if (!ok) {
cout << -1;
return 0;
}
for (int i = d; i >= 1; --i) {
for (int j = 1; j <= n; ++j) {
cout << ans[i][j] << ' ';
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int n, k, d, inc, a[1005][1005], i, j, temp, flag;
int main() {
scanf("%lld", &n), scanf("%lld", &k), scanf("%lld", &d);
temp = 1;
flag = 0;
for (i = 1; i <= d; i++) {
temp *= k;
if (temp >= n) {
flag = 1;
break;
}
}
if (flag == 0) {
printf("-1\n");
return 0;
}
for (i = 0; i < d; i++) a[0][i] = 0;
for (i = 1; i < n; i++) {
for (j = 0; j < d; j++) a[i][j] = a[i - 1][j];
for (j = d - 1; j >= 0; j--) {
a[i][j] = (a[i][j] + 1) % k;
if (a[i][j]) break;
}
}
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) printf("%lld ", a[j][i] + 1);
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool check(long long n, long long k, long long d) {
long long t = 1;
for (int i = 0; i < d; ++i) {
if (t < n) t *= k;
}
if (n > t) return 0;
return 1;
}
int main() {
long long n, k, d;
cin >> n >> k >> d;
if (!check(n, k, d)) {
cout << -1;
return 0;
}
long long 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] /= k;
}
cout << endl;
}
return 0;
}
| 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;
const int MAXN = 1 * 1000 + 10;
int ans[MAXN][MAXN];
int main() {
int n, d, k;
scanf("%d%d%d", &n, &k, &d);
long long is = 1;
for (int i = 1; i <= d && is < n; ++i) is *= k;
if (is < n) {
puts("-1");
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;
int mat[1010][1010], d, n;
int mul(int k, int d) {
long long ans = 1;
for (int i = 1; i <= d; i++) {
ans *= k;
if (ans >= 9999) return ans;
}
return ans;
}
int main() {
int m, i, j, k;
while (scanf("%d%d%d", &n, &k, &d) != EOF) {
if (mul(k, d) < n) {
puts("-1");
continue;
}
for (i = 1; i <= d; i++) mat[i][1] = 0;
for (i = 2; i <= n; i++) {
int kk = 0;
m = mat[d][i - 1] + 1;
mat[d][i] = m % k;
kk = m / k;
for (j = d - 1; j >= 1; j--) {
m = kk + mat[j][i - 1];
mat[j][i] = m % k;
kk = m / k;
}
}
for (i = 1; i <= d; i++) {
cout << mat[i][1] + 1;
for (j = 2; j <= n; j++) printf(" %d", mat[i][j] + 1);
puts("");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int f[2000];
int main() {
int n, d, k;
scanf("%d%d%d", &n, &k, &d);
long long counter = 1;
bool ff = 0;
for (int i = 0; i < d; i++) {
counter *= k;
if (counter >= n) {
ff = 1;
break;
}
}
if (!ff) {
printf("-1\n");
return 0;
}
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)
printf("\n");
else
printf(" ");
f[j] /= k;
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1.0e-11;
const double pi = acos(-1.0);
int main() {
ios_base::sync_with_stdio(0);
long long n, k, d;
cin >> n >> k >> d;
bool ok = false;
long long tmp = 1;
for (long long i = 0; i < d; i++) {
tmp *= k;
if (tmp >= n) {
ok = true;
break;
}
}
if (!ok) {
cout << "-1\n";
return 0;
}
vector<int> curr(n);
for (long long i = 0; i < n; i++) curr[i] = i;
for (long long i = 0; i < d; i++) {
for (long long j = 0; j < n; j++) {
cout << curr[j] % k + 1 << " ";
curr[j] /= k;
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d;
int counter = 0;
void dfs(int step, vector<int> &vec, vector<vector<int> > &ans) {
if (counter == n) return;
if (step == d) {
ans[counter] = vec;
counter++;
return;
}
for (int i = 1; i < min(1 + k, 1 + n); i++) {
vec[step] = i;
dfs(step + 1, vec, ans);
}
}
int main() {
cin >> n >> k >> d;
vector<int> vec(d);
vector<vector<int> > ans(n, vector<int>(d));
bool ok = false;
int temp = 1;
for (int i = 0; i < d; i++) {
temp *= k;
if (temp >= n) {
ok = true;
break;
}
}
if (!ok) {
cout << -1;
return 0;
}
dfs(0, vec, ans);
for (int i = 0; i < d; i++, cout << endl)
for (int j = 0; j < n; j++) {
cout << ans[j][i] << " ";
}
return 0;
}
| 9 | CPP |
from math import *
n , k , d = map(int,input().split())
def ff(n,k):
if n % k !=0 :
return n%k
else: return k
def f(n,k,feed):
answer = []
if n < k :
for numbers in range(n):
answer.append(numbers)
else:
x_1 = ceil(n/k)
x_2 = floor(n/k)
y_1 = n % k
y_2 = k - n%k
counter = 1
for numbers in range(y_1):
answer+= x_1* [counter]
counter+=1
for numbers in range(y_2):
answer+= x_2 * [counter]
counter+=1
new_answer = ""
for elements in answer:
new_answer += str(ff((elements),k)) + " " ###ff((elements + feed -1),k)
return new_answer
if k == 1:
if n == 1 :
for numbers in range(d):
print(1)
else :
print(-1)
elif ceil(log(n,k)) > d :
print(-1)
elif k >= n :
answer = ""
for numbers in range(1,n+1):
answer += str(numbers) + " "
for numbers in range(d):
print(answer)
else :
list_numbers = [n]
for numbers in range(ceil(log(n,k))):
list_new = []
for elements in list_numbers:
x_1 = ceil(elements / k)
x_2 = floor(elements / k)
y_1 = elements % k
y_2 = k - elements % k
list_new += [x_1]*y_1 + [x_2]*y_2
feed = 1
answer = ""
for values in list_numbers :
answer += f(values,k,feed)
feed +=1
print(answer)
list_numbers = list_new
for numbers in range(d- ceil(log(n,k))):
print("1 "*n)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long arr[1010][1010];
int main() {
ios::sync_with_stdio(false);
long long n, k, d, x = 1;
cin >> n >> k >> d;
for (int i = (0); i < (d); i++) {
x *= k;
if (x >= n) break;
}
if (x < n) {
cout << -1 << endl;
return 0;
}
bool g = true;
for (int i = (1); i < (n); i++) {
for (int j = (0); j < (d); j++) arr[i][j] = arr[i - 1][j];
for (int j = (d - 1); j >= (0); j--) {
arr[i][j] = (arr[i][j] + 1) % k;
if (arr[i][j]) break;
}
}
for (int i = (0); i < (d); i++) {
for (int j = (0); j < (n); j++) cout << arr[j][i] + 1 << " ";
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
;
long long int fast_power(long long int a, long long int x, long long int mm) {
if (x == 0)
return 1;
else if (x == 1)
return a % mm;
else {
long long int y = fast_power(a, x / 2, mm) % mm;
y = ((y % mm) * (y % mm)) % mm;
if (x % 2 == 1)
return ((a % mm) * (y % mm)) % mm;
else
return y % mm;
}
}
long long int mod(long long int a, long long int b) {
if (a < 0) {
a = (-a) % b;
if (a != 0) a = b - a;
} else
a = a % b;
return a;
}
long long int mul(long long int a, long long int b, long long int mm) {
return (mod(a, mm) * mod(b, mm)) % mm;
}
long long int add(long long int a, long long int b, long long int mm) {
return (mod(a, mm) + mod(b, mm)) % mm;
}
long long int n, k, d;
vector<long long int> str;
vector<long long int> ans[1001];
bool check() {
long long int i, aux = k;
for (i = 0; i < d; i++, aux *= k)
if (aux >= n) return true;
return false;
}
void print(long long int index) {
for (long long int i = 0; i < d; i++) ans[index].push_back(str[i] + 1);
}
void add_one(long long int index) {
if (str[index] == k - 1) {
str[index] = 0;
add_one(index - 1);
} else
str[index]++;
}
int main() {
long long int i;
scanf("%lld", &n);
scanf("%lld", &k);
scanf("%lld", &d);
for (i = 0; i < d; i++) str.push_back(0);
if (!check())
printf("%s", "-1\n");
else {
for (i = 0; i < n; i++) {
print(i + 1);
if (i < n - 1) add_one(d - 1);
}
for (i = 0; i < d; i++) {
for (long long int j = 1; j <= n; j++) printf("%lld ", ans[j][i]);
printf("%s", "\n");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool check(int d, int n, int k) {
int s = 1;
while (d--) {
s *= k;
if (s >= n) return 0;
}
return 1;
}
int main(int argc, char const *argv[]) {
int n, k, d;
cin >> n >> k >> d;
if (k >= n) {
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
if ((i + j) % n == 0)
printf("%d ", n);
else
printf("%d ", (i + j) % n);
}
printf("\n");
}
return 0;
}
if (check(d, n, k)) {
printf("-1");
return 0;
} else {
int di = 1;
int bus = 0, cur = 1;
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
printf("%d ", cur);
bus++;
if (bus == di) {
cur++;
bus = 0;
}
if (cur > k) cur = 1;
}
di *= k;
cur = 1;
bus = 0;
printf("\n");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
const int N = 1010;
int a[N], b[N], n, d, k, m, i, j, u;
int main() {
scanf("%d%d%d", &n, &k, &d);
if (k >= n) {
for (i = 0; i < d; i++) {
for (j = 1; j <= n; j++) printf("%d ", j);
printf("\n");
}
} else {
m = n;
for (i = 0; i < d; i++) m = m / k + (m % k ? 1 : 0);
if (m <= 1) {
m = n;
for (i = 0; i < d; i++) {
m = m / k + (m % k ? 1 : 0);
for (j = 0; j < n; j++) {
if (j && a[j] == a[j - 1])
++u;
else
u = 0;
b[j] = u;
}
for (j = 0; j < n; j++) a[j] = b[j] / m % k + 1;
for (j = 0; j < n; j++) printf("%d ", a[j]);
printf("\n");
}
} else
puts("-1");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T nextInt() {
T x = 0, p = 1;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') {
p = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * p;
}
const int maxN = (int)2e3 + 10;
const int maxE = (int)4e5 + 10;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const long long LLINF = (long long)1e18;
int myPow(int k, int d) {
long long res = 1;
while (d--) {
res *= k;
if (res > 1000) return INF;
}
return res;
}
int answer[maxN][maxN];
int main() {
int n, k, d;
cin >> n >> k >> d;
if (myPow(k, d) < n) {
cout << -1 << '\n';
return 0;
}
for (int i = 1; i <= d; ++i) {
answer[1][i] = 1;
}
for (int i = 2; i <= n; ++i) {
int cntK = 0;
for (int j = d; j >= 1 && answer[i - 1][j] == k; j--, cntK++)
;
for (int j = 1; j <= d; ++j) {
if (j < d - cntK) {
answer[i][j] = answer[i - 1][j];
} else if (j == d - cntK) {
answer[i][j] = answer[i - 1][j] + 1;
} else {
answer[i][j] = 1;
}
}
}
for (int j = 1; j <= d; ++j) {
for (int i = 1; i <= n; ++i) {
cout << answer[i][j] << ' ';
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int check(int n, int k, int d) {
int Q = k;
for (int i = 1; i <= d; ++i, Q *= k)
if (Q >= n) return 0;
return 1;
}
int a[1111];
int main() {
int n, k, d;
a[1] = 1;
cin >> n >> k >> d;
int flg = 0;
if (check(n, k, d)) {
cout << -1 << endl;
return 0;
}
int i;
for (i = 2; i <= d && a[i - 1] < n; ++i) a[i] = a[i - 1] * k;
for (; i <= d; ++i) a[i] = n;
for (i = 1; i <= d; ++i) {
for (int j = 0; j < n; ++j) cout << (j / a[i]) % k + 1 << " ";
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, d, s = 1;
cin >> n >> k >> d;
long long int mat[1010][1010];
for (int i = 0; i < 1010; i++)
for (int j = 0; j < 1010; j++) mat[i][j] = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < d; j++) mat[i][j] = mat[i - 1][j];
long long int carry = 1;
for (int j = 0; j < d; j++) {
long long int temp = mat[i][j];
mat[i][j] = (mat[i][j] + carry) % k;
carry = (carry + temp) / k;
}
if (carry > 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << mat[j][i] + 1 << " ";
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, sl;
int a[1010][1010], b[1010];
void nhap() { cin >> n >> k >> d; }
void cbi() {
if ((d == 1 && k < n)) {
cout << -1;
exit(0);
}
if (k >= n) {
for (int j = 1; j <= d; j++) {
for (int i = 1; i <= n; i++) printf("%d ", i);
printf("\n");
}
exit(0);
}
}
bool ktra() {
long long gt = 1;
for (int i = 1; i <= d; i++) {
gt *= k;
if (gt >= 1ll * n) return 1;
}
return 0;
}
void duyet(int u) {
if (u > d) {
sl++;
for (int i = 1; i <= d; i++) a[sl][i] = b[i];
return;
}
for (int i = 1; i <= k; i++) {
b[u] = i;
duyet(u + 1);
if (sl >= n) return;
}
}
void xuli() {
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
if (ktra()) {
duyet(1);
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) cout << a[j][i] << " ";
cout << endl;
}
} else {
cout << -1;
return;
}
}
void ghikq() {}
int main() {
nhap();
cbi();
xuli();
ghikq();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1001][1001], k, d, n, tmp = 0;
void f(int l, int r, int p) {
if (p == d + 1) return;
if (p == d && r - l >= k) {
tmp = 1;
return;
}
if (r - l < k) {
int s = 0;
for (int i = l; i <= r; ++i) {
++s;
a[p][i] = s;
}
f(l, r, p + 1);
return;
}
int yu = (r - l + 1) % k, sh = (r - l + 1) / k;
for (int i = 1; i <= k - 1; ++i) {
int t = (i - 1) * sh + l, t2 = i * sh + l;
for (int j = t; j < t2; ++j) {
a[p][j] = i;
}
f(t, t2 - 1, p + 1);
}
int t = sh * (k - 1) + l;
for (int i = t; i <= r; ++i) {
a[p][i] = k;
}
f(t, r, p + 1);
}
int main() {
scanf("%d%d%d", &n, &k, &d);
f(1, n, 1);
if (tmp == 1) {
printf("-1");
} else {
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) printf("%d ", a[i][j]);
printf("\n");
}
}
return 0;
}
| 9 | CPP |
n, k, d = map(int, input().split())
ans = [[0 for j in range(n)] for i in range(d)]
if any(1 for i in range(d) if k**(i + 1) >= n):
for i in range(n):
N = i
for j in range(d):
ans[j][i] = 1 + N % k
N //= k
for i in range(d):
print(' '.join(map(str, ans[i])))
else:
print(-1)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, d, k;
int main() {
cin >> n >> k >> d;
if (k >= n) {
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << j + 1 << ' ';
}
cout << endl;
}
return 0;
}
long long ans = 1;
bool b = false;
for (int j = 0; j < d; j++) {
ans *= 1LL * k;
if (ans >= n) {
b = true;
break;
}
}
if (!b) {
cout << -1 << endl;
return 0;
}
ans = 1;
for (int i = 0; i < d; i++) {
int s = 0;
int t = 1;
for (int j = 0; j < n; j++) {
s++;
if (s > ans) {
t++;
s = 1;
}
if (t > k) {
t = 1;
}
printf("%d\n", t);
}
ans *= k;
if (ans > 10000LL) {
ans = 10000LL;
}
}
}
| 9 | CPP |
n,k,d=map(int,input().split())
p=1
for i in range(d):
p*=k
if p>=n:
break
s=[i for i in range(n)]
if n>p:
print(-1)
else:
for i in range(d):
ans=""
for j in range(n):
ans += str(s[j] % k + 1) + ' '
s[j] //= k
print(ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T trace2(T a, T b) {
cerr << a << " " << b << '\n';
}
template <typename T>
T trace3(T a, T b, T c) {
cerr << a << " " << b << " " << c << '\n';
}
template <typename T>
T trace4(T a, T b, T c, T d) {
cerr << a << " " << b << " " << c << " " << d << '\n';
}
template <typename T>
T trace5(T a, T b, T c, T d, T e) {
cerr << a << " " << b << " " << c << " " << d << " " << e << '\n';
}
template <typename T>
T trace6(T a, T b, T c, T d, T e, T f) {
cerr << a << " " << b << " " << c << " " << d << " " << e << " " << f << '\n';
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << '\n';
err(++it, args...);
}
template <typename T>
T pow(T a, T b, long long int m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
void swap(long long int *a, long long int *b) {
long long int temp = *a;
*a = *b;
*b = temp;
return;
}
long long int n, k, d;
long long int arr[1000 + 10][1000 + 10];
bool check() {
long long int p = 1;
for (__typeof(d) i = (0) - ((0) > (d)); i != (d) - ((0) > (d));
i += 1 - 2 * ((0) > (d))) {
p *= k;
if (p >= n) {
return true;
}
}
return false;
}
void cal() {
for (long long int i = 1; i <= n; i++) {
long long int temp = i;
long long int idx = 0;
while (temp) {
arr[i][idx] = (temp % k);
temp = temp / k;
idx++;
}
}
}
void print() {
for (long long int i = 0; i < d; i++) {
for (long long int j = 1; j <= n; j++) {
cout << arr[j][i] + 1 << " ";
}
cout << '\n';
}
}
void fuck() {
cin >> n >> k >> d;
if (k >= n) {
std::vector<long long int> v;
for (__typeof(n + 1) i = (1) - ((1) > (n + 1));
i != (n + 1) - ((1) > (n + 1)); i += 1 - 2 * ((1) > (n + 1)))
v.push_back(i);
for (__typeof(d) i = (0) - ((0) > (d)); i != (d) - ((0) > (d));
i += 1 - 2 * ((0) > (d))) {
for (auto i : v) cout << i << " ";
cout << '\n';
long long int temp = *(v.begin());
v.erase(v.begin());
v.push_back(temp);
}
exit(0);
}
if (k == 1 || d == 1) {
cout << -1 << '\n';
exit(0);
}
if (d >= n) {
std::vector<long long int> v;
v.push_back(2);
for (__typeof(n) i = (1) - ((1) > (n)); i != (n) - ((1) > (n));
i += 1 - 2 * ((1) > (n)))
v.push_back(1);
for (__typeof(d) i = (0) - ((0) > (d)); i != (d) - ((0) > (d));
i += 1 - 2 * ((0) > (d))) {
for (auto i : v) cout << i << " ";
cout << '\n';
long long int temp = *(v.begin());
v.erase(v.begin());
v.push_back(temp);
}
exit(0);
}
if (check() == false) {
cout << -1 << '\n';
exit(0);
}
cal();
print();
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
fuck();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a[1005][1005];
int main() {
long long n, k, d;
cin >> n >> k >> d;
long long tavan = 1;
for (int i = 0; i < d && tavan < n; i++) tavan *= k;
if (tavan < n) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; i++) {
int x = i;
for (int j = 0; x != 0; j++) {
a[i][j] = x % k;
x /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << a[j][i] + 1 << ' ';
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, d, i, j;
cin >> n >> k >> d;
vector<int> v(n, 0);
v[n - 1] = n - 1;
for (i = 0; i < d; i++) v[n - 1] /= k;
if (v[n - 1]) {
cout << -1;
return 0;
}
for (i = 0; i < n; i++) v[i] = i;
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
cout << v[j] % k + 1 << " ";
v[j] = v[j] / k;
}
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, d, cnt, tb[1005];
vector<int> v[1005];
void gen(int idx) {
int i;
if (idx == d) {
for (i = 0; i < d; i++) {
v[cnt].push_back(tb[i]);
}
cnt++;
return;
}
for (i = 1; i <= k && cnt < n; i++) {
tb[idx] = i;
gen(idx + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k >> d;
gen(0);
if (cnt < n) {
cout << "-1\n";
} else {
int i, j;
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
cout << v[j][i] << ' ';
}
cout << '\n';
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long a, long long b, long long m) {
if (b == 0) return 1 % m;
long long x = bigmod(a, b / 2, m);
x = (x % m * x % m) % m;
if (b % 2) x = (x % m * a % m) % m;
return x;
}
int main() {
long long n, k, d, p, an = 0;
cin >> n >> k >> d;
p = k;
for (int i = 0; i < d; i++) {
if (n <= p) {
an = 1;
break;
}
p *= k;
}
if (!an) return 0 & puts("-1");
vector<vector<int> > a;
for (int i = 0; i < n; i++) {
int m = i;
vector<int> s;
while (m && s.size() < d) {
s.push_back(m % k);
m /= k;
}
while (s.size() < d) s.push_back(0);
a.push_back(s);
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << a[j][i] + 1 << " ";
puts("");
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t[1002][1002];
int main() {
int n, d, k;
cin >> n >> k >> d;
if (pow(n, 1.0 / (double)d) - (double)k > 1e-9) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; i++) {
if (i == 0)
for (int j = 0; j < d; j++) t[i][j] = 1;
else {
for (int j = 0; j < d; j++) t[i][j] = t[i - 1][j];
t[i][d - 1]++;
for (int j = d - 1; j >= 0; j--) {
if (t[i][j] > k) {
t[i][j - 1] += t[i][j] / k;
t[i][j] %= k;
}
}
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << t[j][i] << " ";
}
cout << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void amin(T &x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
inline void amax(T &x, U y) {
if (x < y) x = y;
}
int main() {
long long n, k, d;
cin >> n >> k >> d;
bool check = false;
long long tem = 1;
for (int i = 0; i < d; i++) {
tem *= k;
if (tem >= n) {
check = true;
break;
}
}
if (!check) {
cout << "-1";
return 0;
}
long long l = 1;
long long y = 1;
for (int i = 0; i < d; i++) {
for (int j = 1; j <= n; j++) {
cout << y << " ";
if (j % l == 0) y++;
if (y > k) y = 1;
}
y = 1;
l = min(l * k, n);
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void dbg_out() { cerr << "\b\b]\n"; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << H << ", ";
dbg_out(T...);
}
const int N = 1002;
vector<vector<int>> ans(N, vector<int>(N, -1));
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k, d;
cin >> n >> k >> d;
if (k >= n) {
for (int i = 1; i <= d; ++i) {
for (int j = 1; j <= n; ++j) {
cout << j << ' ';
}
cout << '\n';
}
return 0;
}
bool ok = true;
function<void(int, int, int, int)> go = [&](int l, int r, int bus, int d) {
if (d < 0) return;
if (d == 1) {
if (r - l + 1 > 1) {
ok = false;
return;
}
}
for (int i = l; i <= r; ++i) {
ans[d][i] = bus;
}
int rem = (r - l + 1) % k;
int segment = (r - l + 1) / k;
if (segment) {
int curr = l;
for (int i = 1; i <= k; ++i) {
int y = curr + segment + (i <= rem) - 1;
go(curr, y, i, d - 1);
curr = y + 1;
}
} else {
for (int i = 0; i < rem; ++i) {
go(l + i, l + i, i + 1, d - 1);
}
}
};
int l = 1, r = n;
int rem = (r - l + 1) % k;
int segment = (r - l + 1) / k;
int curr = 1;
for (int i = 1; i <= k; ++i) {
int y = curr + segment + (i <= rem) - 1;
go(curr, y, i, d);
curr = y + 1;
}
if (!ok) {
cout << -1;
return 0;
}
for (int i = d; i >= 1; --i) {
for (int j = 1; j <= n; ++j) {
cout << ans[i][j] << ' ';
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, d;
cin >> n >> k >> d;
bool ok = false;
int temp = 1;
for (int i = 0; i < d; i++) {
temp *= k;
if (temp >= n) {
ok = true;
break;
}
}
if (!ok) {
cout << -1;
return 0;
}
vector<vector<int> > ans(n, vector<int>(d));
for (int i = 0; i < d; i++) ans[0][i] = 0;
for (int j = 1; j < n; j++) {
for (int i = 0; i < d; i++) {
ans[j][i] = ans[j - 1][i];
}
for (int i = d - 1; i >= 0; i--) {
ans[j][i] = (ans[j][i] + 1) % k;
if (ans[j][i]) 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;
bool isprime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i += 6) {
if (n % i == 0 || n % (i + 2) == 0) return false;
}
return true;
}
long long modexp(long long a, long long b, long long m) {
long long r = 1;
a = a % m;
while (b > 0) {
if (b & 1) r = (r * a) % m;
b = b >> 1;
a = (a * a) % m;
}
return r % m;
}
struct CustomCompare {
bool operator()(const int& lhs, const int& rhs) { return lhs < rhs; }
};
long long builtin_popcount(long long x) {
long long cnt = 0;
for (long long i = 60; i >= 0; i--) {
if ((1LL << i) & x) cnt++;
}
return cnt;
}
long long addmod(long long a, long long b, long long r) {
a %= r;
b %= r;
return (a + b) % r;
}
long long mulmod(long long a, long long b, long long r) {
a %= r;
b %= r;
return (a * b) % r;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, k, d;
cin >> n >> k >> d;
long long res = 1;
bool flag = false;
for (int i = 0; i < d; i++) {
res *= k;
if (res >= n) {
flag = true;
break;
}
}
if (!flag || (d == 1 && n > k)) {
cout << -1 << endl;
return 0;
}
int ans[d][n];
memset(ans, 0, sizeof(ans));
for (int i = 0; i < n; i++) {
long long bit = i, j = 0;
while (bit > 0) {
ans[j++][i] = bit % k;
bit /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) cout << ans[i][j] + 1 << " ";
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long matrix[1010][1010];
bool is_ok(long long k, long long d, long long n) {
double t = (double)1.0 * log((double)n) / log((double)k);
double dd = (double)1.0 * d;
if (t < dd || fabs(t - dd) < 1e-9)
return true;
else
return false;
}
vector<long long> change_ten_to_k(long long x, long long k) {
vector<long long> res;
long long t;
while (x != 0) {
t = x % k;
x /= k;
res.push_back(t);
}
return res;
}
void build_matrix(long long k, long long d, long long n) {
vector<long long> v;
long long id;
for (int i = 1; i <= n; i++) {
id = i - 1;
v = change_ten_to_k(id, k);
int len = (int)v.size();
for (int j = 0; j < len; j++) {
matrix[i][j + 1] = v[j];
}
}
}
int main() {
long long n, d;
long long k;
cin >> n >> k >> d;
if (k == 1) {
if (n > 1)
cout << -1 << endl;
else {
for (int i = 1; i <= d; i++) {
cout << 1 << endl;
}
}
return 0;
}
if (!is_ok(k, d, n)) {
cout << -1 << endl;
return 0;
}
build_matrix(k, d, n);
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
cout << matrix[j][i] + 1;
if (j != n) printf(" ");
}
cout << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[1000][1000];
void solve() {
int n, k, d;
cin >> n >> k >> d;
long long cur = 1;
int tempd = d;
bool isGood = 0;
while (tempd--) {
cur *= k;
if (cur >= n) {
isGood = 1;
break;
}
}
if (!isGood) {
cout << -1;
return;
}
for (int i = 0; i < n; i++) {
int curnum = i;
for (int j = 0; j < d; j++) {
ans[i][j] = curnum % k + 1;
curnum /= k;
}
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
cout << ans[j][i] << " \n"[j == n - 1];
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int main() {
long long int n, k, d;
std::cin >> n >> k >> d;
long long int k__d = k, possible = 0;
for (int i = 0; i < d; i++) {
if (n <= k__d) {
possible = 1;
break;
}
k__d = k__d * k;
}
if (!possible) {
printf("-1");
return 0;
}
long long int t = 1;
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
long long int j_ = j / t;
printf("%d ", (int)((j_ % k) + 1));
}
printf("\n");
if (t <= 1001) t = t * k;
}
return 0;
}
| 9 | CPP |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.