Submission #288250

#	Time	Username	Problem	Language	Result	Execution time	Memory
288250		SomeoneUnknown	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	100 / 100	518 ms	5496 KiB

lyuboyn

#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++;
        }
        if(gcd(n,k) != 1){
            s0b[(sind + k) % n] = !s0b[(sind + k) % n];
            s0b[(sind + k-1) % n] = !s0b[(sind + k-1) % n];
        }
        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 (stderr)

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
• Subtask 2: 5 / 5
• Subtask 3: 3 / 3
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 18 / 18
• Subtask 7: 31 / 31
• Subtask 8: 17 / 17