#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
using namespace std;
long long con[65][65]={0};
vector < pair < long long , long long > > all;
vector < char > ans[65];
priority_queue < pair < long long , pair < long long , long long > > ,vector < pair < long long , pair < long long , long long > > >, less < pair < long long , pair < long long , long long > > > > how;
int main()
{
long long i,j,N=0,M=0,now=0,n,last;
scanf("%lld",&n);
con[1][1]=1;
for(i=1;i<=60;i++)
{
for(j=1;j<=60;j++)
{
if(i>1) con[i][j]+=con[i-1][j];
if(j>1) con[i][j]+=con[i][j-1];
if(con[i][j]>n) con[i][j]=0;
else how.push(make_pair(con[i][j],make_pair(i,j)));
}
}
while(n)
{
//printf("%lld\n",n);
while(n<how.top().first) how.pop();
all.push_back(how.top().second);
n-=how.top().first;
N=max(N,how.top().second.first);
M+=how.top().second.second;
}
//printf("%lld %lld\n",N,M);
for(i=0;i<=N;i++)
{
for(j=0;j<M;j++) ans[i].push_back('X');
}
for(j=0;j<M;j++) ans[0][j]='r';
for(auto i:all)
{
//printf("%lld %lld\n",i.first,i.second);
ans[0][now]='X';
last=now;
for(j=1;j<=N;j++) ans[j][now+i.second-1]='d';
for(j=1;j<=N-i.first;j++) ans[j][now]='d';
now+=i.second;
}
ans[0][last]='d';
for(i=0;i<N;i++) ans[i][M-1]='d';
for(i=0;i<M;i++) ans[N][i]='r';
ans[N][M-1]='.';
printf("%lld %lld\n",N+1,M);
for(i=0;i<=N;i++)
{
for(j=0;j<M;j++) printf("%c",ans[i][j]);
printf("\n");
}
return 0;
}
Compilation message
costinland.cpp: In function 'int main()':
costinland.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
15 | scanf("%lld",&n);
| ~~~~~^~~~~~~~~~~
costinland.cpp:14:35: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
14 | long long i,j,N=0,M=0,now=0,n,last;
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
460 KB |
The matrix does not generate the required number of Costins |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
460 KB |
The matrix does not generate the required number of Costins |
2 |
Halted |
0 ms |
0 KB |
- |