//gm --- akezhon
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
// #define int long long
using namespace std;
const int N=2e5+7;
const int mod=998244353;
const int inf=2e18;
char c[100][100];
int a[100][100];
void AlemAmenov(){
int k;
cin >> k;
k--;
for(int i=1; i <= 4; i++){
int cur=1;
if(i==1){
for(int j=1; j <= 4; j++){
if(k){
k--;
a[i+1][j]++;
c[i][j]='X';
}
else{
c[i][j]='r';
}
}
}
else{
cur=0;
for(int j=1; j <= 4; j++){
cur+=a[i][j];
if(cur <= k){
k-=cur;
a[i+1][j]++;
c[i][j]='X';
}
else{
c[i][j]='r';
}
}
}
}
for(int i=1; i <= 5; i++){
c[i][5] = 'd';
c[5][i] = 'r';
}
c[5][5]='.';
cout << "5 5\n";
for(int i=1; i <= 5; i++){
for(int j=1; j <= 5; j++){
cout << c[i][j];
}
cout << '\n';
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int RealName=1;
// cin >> RealName;
// srand(time(0));
while(RealName--)
AlemAmenov();
return 0;
}
Compilation message (stderr)
costinland.cpp:22:15: warning: overflow in conversion from 'double' to 'int' changes value from '2.0e+18' to '2147483647' [-Woverflow]
22 | const int inf=2e18;
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |