#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
long long k,br = 2,y = 1;
cin >> k;
if(k == 2) {
cout << 2 << " " << 2 << "\n";
cout << "Xd\n";
cout << "r.\n";
return 0;
}
while(2*y < k) {
y*=2;
br++;
}
char ans[br][br];
for(long long i = 0; i < br; i++) {
for(long long j = 0; j < br; j++) {
ans[i][j] = '.';
}
}
for(long long i = 1; i < br-1; i++) {
ans[i][i] = 'X';
ans[i][i+1] = 'd';
ans[i+1][i] = 'r';
}
for(long long i = 0; i < br-1; i++) {
ans[br-1][i] = 'r';
ans[i][br-1] = 'd';
}
ans[0][0] = 'r';
for(long long i = 1; i < br-1; i++) {
y = (1LL << (br-i-1));
if(y&k) {
if(k%y == 0) {
ans[0][i] = 'd';
}
else {
ans[0][i] = 'X';
}
}
}
cout << br << " " << br << "\n";
for(long long i = 0; i < br; i++) {
for(long long j = 0; j < br; j++) {
cout << ans[i][j];
}
cout << "\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Correct! Your size: 3 |
2 |
Incorrect |
0 ms |
212 KB |
The matrix does not generate the required number of Costins |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 60 |
2 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 60 |
3 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 61 |
4 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 61 |
5 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 61 |
6 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 61 |
7 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 61 |
8 |
Partially correct |
0 ms |
212 KB |
Partially Correct! Your size: 59 |