# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1009336 | 2024-06-27T11:40:46 Z | matere | Costinland (info1cup19_costinland) | C++14 | 1 ms | 348 KB |
#include<bits/stdc++.h> using namespace std; long long k,n=64; char a[65][65]; int main(){ cin>>k; n=(int)log2(k)+2; // if(k<=19) n=5; if((1ll<<n-2) & k and !((1<<n-3) & k)) n--; cout<<n<<' '<<n<<endl; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ a[i][j]='r'; } } for(int i=1;i<n;i++) a[i][n]='d'; a[n][n]='.'; // for(int i=1;(1ll<<i)<=k;i++){ a[i][i]='X'; a[i][i+1]='d'; if((1ll<<(i-1))&k) a[i][i+1]='X'; } // for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<a[i][j]; } cout<<endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Correct! Your size: 3 |
2 | Correct | 0 ms | 348 KB | Correct! Your size: 3 |
3 | Correct | 0 ms | 348 KB | Correct! Your size: 3 |
4 | Correct | 0 ms | 348 KB | Correct! Your size: 4 |
5 | Correct | 0 ms | 348 KB | Correct! Your size: 4 |
6 | Correct | 0 ms | 348 KB | Correct! Your size: 4 |
7 | Correct | 0 ms | 348 KB | Correct! Your size: 4 |
8 | Correct | 0 ms | 348 KB | Correct! Your size: 5 |
9 | Correct | 0 ms | 348 KB | Correct! Your size: 5 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 348 KB | Partially Correct! Your size: 59 |
2 | Partially correct | 0 ms | 344 KB | Partially Correct! Your size: 59 |
3 | Partially correct | 0 ms | 348 KB | Partially Correct! Your size: 60 |
4 | Partially correct | 0 ms | 348 KB | Partially Correct! Your size: 61 |
5 | Partially correct | 0 ms | 348 KB | Partially Correct! Your size: 61 |
6 | Partially correct | 1 ms | 348 KB | Partially Correct! Your size: 61 |
7 | Incorrect | 0 ms | 348 KB | The output does not fit the requirements |
8 | Halted | 0 ms | 0 KB | - |