oj.uz

답안 #288176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288176 2020-09-01T09:34:51 Z SomeoneUnknown "The Lyuboyn" code (IZhO19_lyuboyn) C++14
19 / 100
 494 ms 5496 KB 
#include <bits/stdc++.h>
using namespace std;

int gcd(int a, int b){
    if(b>a) return gcd(b,a);
    if(b == 0) return a;
    return gcd(b, a%b);
}

int main(){
    int n, k, t;
    scanf("%d %d %d", &n, &k, &t);
    char s0[n+1];
    scanf("%s", &s0);
    bool s0b[n];
    for(int i = 0; i < n; ++i){
        s0b[i] = (s0[i] == '1');
    }
    if(gcd(n, k) != 1 || k%2 == 0){
        printf("-1");
        return 0;
    }
    printf("%d\n", 1 << n);
    printf("%s", s0);
    for(int i = 1; i < (1 << n); ++i){
        printf("\n");
        int sind = 0;
        int ti = i;
        while(ti % 2 == 0){
            ti >>= 1;
            sind++;
        }
        for(int j = sind; j != (sind + k) % n; j = (j+1) % n){
            s0b[j] = !s0b[j];
        }
        for(int j = 0; j < n; ++j){
            printf("%d", s0b[j]);
        }
    }

}

Compilation message

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:14:13: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[(n + 1)]' [-Wformat=]
   14 |     scanf("%s", &s0);
      |            ~^   ~~~
      |             |   |
      |             |   char (*)[(n + 1)]
      |             char*
lyuboyn.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |     scanf("%d %d %d", &n, &k, &t);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
lyuboyn.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   14 |     scanf("%s", &s0);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Ok

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Ok

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Ok
2 Correct 0 ms 256 KB Ok
3 Correct 1 ms 256 KB Ok
4 Correct 0 ms 256 KB Ok
5 Correct 0 ms 256 KB Ok
6 Correct 0 ms 256 KB Ok
7 Correct 1 ms 256 KB Ok
8 Correct 0 ms 256 KB Ok

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 472 ms 5340 KB Ok
2 Correct 227 ms 2680 KB Ok
3 Correct 2 ms 256 KB Ok
4 Correct 1 ms 256 KB Ok
5 Correct 1 ms 256 KB Ok

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Ok
2 Correct 11 ms 420 KB Ok
3 Correct 222 ms 2680 KB Ok
4 Correct 105 ms 1400 KB Ok
5 Incorrect 1 ms 256 KB Output -1 while solution exists
6 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 487 ms 5280 KB Ok
2 Correct 474 ms 5484 KB Ok
3 Incorrect 1 ms 384 KB Output -1 while solution exists
4 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 472 ms 5340 KB Ok
2 Correct 227 ms 2680 KB Ok
3 Correct 2 ms 256 KB Ok
4 Correct 1 ms 256 KB Ok
5 Correct 1 ms 256 KB Ok
6 Correct 1 ms 256 KB Ok
7 Correct 11 ms 420 KB Ok
8 Correct 222 ms 2680 KB Ok
9 Correct 105 ms 1400 KB Ok
10 Incorrect 1 ms 256 KB Output -1 while solution exists
11 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 237 ms 2680 KB Ok
2 Correct 494 ms 5496 KB Ok
3 Correct 485 ms 5368 KB Ok
4 Correct 24 ms 512 KB Ok
5 Correct 1 ms 256 KB Ok
6 Correct 52 ms 888 KB Ok
7 Correct 475 ms 5368 KB Ok
8 Incorrect 0 ms 256 KB Output -1 while solution exists
9 Halted 0 ms 0 KB -