This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
//ofstream fout("costin.out");
#define int long long
const int INF = 1000000007;
char mat[51][51];
int put(int a, int exp)
{
if(exp==0) return 1;
if(exp%2==0) return put(a*a,exp/2);
return put(a*a,exp/2)*a;
}
bool solved[100];
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
for(int i=1;i<=49;i++)
for(int j=1;j<=49;j++)
mat[i][j]='.';
int k,cate=1,unde=0;
cin>>k;
for(int i=0;i<49;i++)
{
if(k==0)
break;
unde=i+1;
if(solved[cate]==0 && (k&cate)!=0)
{
mat[i+1][i+1] = 'X';
mat[i+2][i+1] = 'r';
solved[cate]=1;
k-=cate;
}
else
{
mat[i+1][i+1] = 'X';
mat[i+1][i+2] = 'd';
mat[i+2][i+1] = 'r';
cate=cate*2;
}
}
unde++;
for(int i=1;i<=unde;i++)
{
mat[i][unde]='d';
mat[unde][i]='r';
}
mat[unde][unde]='.';
cout<<unde<<" "<<unde<<"\n";
for(int i=1;i<=unde;i++)
{
for(int j=1;j<=unde;j++)
{
cout<<mat[i][j];
}
cout<<"\n";
}
return 0;
}
/**
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |