# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
687225 | smartmonky | Costinland (info1cup19_costinland) | C++14 | 1 ms | 468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
const int N = 1e6 + 1;
int dp[8][8], vis[8][8], mx[8][8];
int k;
char a[8][8];
int n = 5;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k;
cout << "5 5" << endl;
if(k == 19){
cout <<"XXXXd\nXXXXd\n...Xd\n....d\nrrrr." << endl;
return 0;
}
for(int i = 1; i <= n; i++){
a[i][n] = 'd';
a[n][i] = 'r';
}
for(int i = 1; i <= n - 1; i++){
for(int j = 1; j <= n - 1; j++){
a[i][j] = '.';
}
}
k -= 2;
a[1][1] = 'X';
int l = 2;
while(k){
if(k >= 2){
k -= 2;
a[l][1] = 'X';
a[1][l] = 'X';
if(k >= 2){
a[l][l] = 'X';
k -= 2;
}
}else if(k > 0){
a[l][1] = 'X';
k--;
a[1][l] = 'r';
}
l++;
}
a[n][n] = '.';
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
cout << a[i][j];
}
cout << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |