# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361234 | ogibogi2004 | Costinland (info1cup19_costinland) | C++14 | 1 ms | 336 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>
using namespace std;
#define ll long long
ll n;
char table[50][50];
ll a,b;
bool used[50];
int main()
{
cin>>n;
vector<ll>fib;
fib.push_back(1);
fib.push_back(1);
for(;fib.back()<=n;)
{
fib.push_back(fib[fib.size()-1]+fib[fib.size()-2]);
}
if(fib.size()%2==0)
{
a=fib.size()/2+1;
b=a+1;
for(int i=1;i<b;i++)
{
table[1][i]='r';
table[a][i]='r';
}
for(int i=1;i<a;i++)
{
table[i][1]='d';
table[i][b]='d';
}
table[a][b]='.';
for(int i=1;i<a-1;i++)
{
table[i][i]='X';
}
table[a][b]='.';
table[a-1][b-1]='d';
table[a-2][b-2]='d';
for(int i=1;i+2<a&&i+3<b;i++)table[i][i+1]='X';
for(int i=fib.size()-1;i>=0;i--)
{
if(n>=fib[i])
{
used[i+1]=1;
n-=fib[i];
}
}
for(int i=1;i<a;i++)
{
if(used[2*i-3])
{
table[i][i-1]='X';
}
else table[i][i-1]='r';
}
for(int i=1;i+2<b;i++)
{
if(used[2*i])
{
table[i][2+i]='X';
}
else table[i][2+i]='d';
}
if(!used[2*b-5])table[b-2][b-2]='r';
cout<<a<<" "<<b<<endl;
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
if(table[i][j]=='.'||table[i][j]=='r'||table[i][j]=='d'||table[i][j]=='X')
{
}
else if(i>j)table[i][j]='d';
else table[i][j]='r';
cout<<table[i][j];
}
cout<<endl;
}
/*int val[50][50];
val[1][1]=1;
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
cout<<val[i][j]<<" ";
if(table[i][j]=='r'||table[i][j]=='X')
{
val[i][j+1]+=val[i][j];
}
if(table[i][j]=='d'||table[i][j]=='X')
{
val[i+1][j]+=val[i][j];
}
}
cout<<endl;
}*/
}
else
{
a=fib.size()/2+2;
b=a;
for(int i=1;i<b;i++)
{
table[1][i]='r';
table[a][i]='r';
}
for(int i=1;i<a;i++)
{
table[i][1]='d';
table[i][b]='d';
}
table[a][b]='.';
for(int i=1;i<=a;i++)
{
table[i][i]='X';
}
table[a][b]='.';
table[a-1][b-1]='d';
for(int i=1;i+1<a&&i+2<b;i++)table[i][i+1]='X';
for(int i=fib.size()-1;i>=0;i--)
{
if(n>=fib[i])
{
used[i+1]=1;
n-=fib[i];
}
}
for(int i=1;i<a;i++)
{
if(used[2*i-3])
{
table[i][i-1]='X';
}
else table[i][i-1]='r';
}
for(int i=1;i+2<b;i++)
{
if(used[2*i])
{
table[i][2+i]='X';
}
else table[i][2+i]='d';
}
if(!used[2*b-5])table[b-2][b-2]='r';
cout<<a<<" "<<b<<endl;
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
if(table[i][j]=='.'||table[i][j]=='r'||table[i][j]=='d'||table[i][j]=='X')
{
}
else if(i>j)table[i][j]='d';
else table[i][j]='r';
cout<<table[i][j];
}
cout<<endl;
}
int val[50][50];
val[1][1]=1;
/*for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
cout<<val[i][j]<<" ";
if(table[i][j]=='r'||table[i][j]=='X')
{
val[i][j+1]+=val[i][j];
}
if(table[i][j]=='d'||table[i][j]=='X')
{
val[i+1][j]+=val[i][j];
}
}
cout<<endl;
}*/
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |