# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685257 | heeheeheehaaw | Costinland (info1cup19_costinland) | C++17 | 1 ms | 340 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 int long long
using namespace std;
char a[1005][1005];
signed main()
{
int k, n, putere = 1;
cin>>k;
int l = ceil(log2(k)) + 1;
for(int i = 1; i <= l + 1; i++)
for(int j = 1; j <= l + 1; j++)
a[i][j] = '.';
for(int i = 0; i < 100; i++)
{
if(k == 0)
break;
n = i + 1;
if((k & (putere))!=0)
{
k -= putere;
if(k > 0)
{
a[i+1][i+1] = 'X';
a[i+1][i+2] = 'X';
a[i+2][i+1] = 'r';
}
putere *= 2;
}
else
{
a[i+1][i+1] = 'X';
a[i+1][i+2] = 'd';
a[i+2][i+1] = 'r';
putere = putere * 2;
}
}
n++;
for(int i = 1; i <= n; i++)
{
a[n][i] = 'r';
a[i][n] = 'd';
}
a[n][n] = '.';
cout<<n<<" "<<n<<'\n';
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
cout<<(char)a[i][j];
cout<<'\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |