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>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
int mxn = 62;
ll B = 60;
ll tar;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>tar;
if(tar<=19){
mxn = 6;
B = 5;
}
string arr[mxn];
for(int i = 0;i<mxn;i++){
arr[i] = string(mxn,'d');
}
for(int i = 0;i<B;i++){
arr[i+1][i] = 'X';
}
for(int i = 0;i<B;i++){
arr[i][i] = 'd';
arr[i+2][i] = 'r';
}
for(int i = 0;i<mxn;i++){
arr[0][i] = arr[mxn-1][i] = 'r';
}
for(int i = 0;i<mxn;i++)arr[i][mxn-1] = 'd';
arr[mxn-1][mxn-1] = '.';
int c = 0;
tar--;
for(int i = mxn-2;i>=0;i--){
if((1ll<<c)&tar)arr[0][i] = 'X';
c++;
}
cout<<mxn<<' '<<mxn<<'\n';
for(int i = 0;i<mxn;i++){
cout<<arr[i]<<'\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |