oj.uz

답안 #685259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
685259 2023-01-23T19:19:24 Z heeheeheehaaw Costinland (info1cup19_costinland) C++17
0 / 100
 1 ms 340 KB 
#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;
        }
    }
    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;
}

Subtask #1
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 216 KB The matrix does not generate the required number of Costins
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 340 KB Partially Correct! Your size: 59
2 Partially correct 1 ms 340 KB Partially Correct! Your size: 59
3 Partially correct 1 ms 340 KB Partially Correct! Your size: 60
4 Partially correct 1 ms 340 KB Partially Correct! Your size: 60
5 Partially correct 1 ms 340 KB Partially Correct! Your size: 60
6 Incorrect 1 ms 336 KB The matrix does not generate the required number of Costins
7 Halted 0 ms 0 KB -