제출 #341129

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341129		juggernaut	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	100 / 100	502 ms	5652 KiB

lyuboyn

#include<bits/stdc++.h>
using namespace std;
char _S[20];
int B[262144],n,k,t;
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k>>t>>_S;
    if(k+1&1){
        puts("-1");
        return 0;
    }
    int S=0;
    for(int i=0;i<n;i++)S=S<<1|_S[i]-'0';
    for(int i=0;i<=k;i++)
        B[1<<i]=(1<<k+1)-(1<<i)-1;
    for(int i=k+1;i<n;i++)
        B[1<<i]=(1<<k-1)+(1<<i)-1;
    printf("%d\n",1<<n);
    for(int i=0;i<(1<<n);i++){
        S^=B[i&-i];
        for(int j=n;j--;)printf("%d",(S>>j)&1);
        puts("");
    }
}

컴파일 시 표준 에러 (stderr) 메시지

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:8:9: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
    8 |     if(k+1&1){
      |        ~^~
lyuboyn.cpp:13:37: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   13 |     for(int i=0;i<n;i++)S=S<<1|_S[i]-'0';
      |                                ~~~~~^~~~
lyuboyn.cpp:15:22: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   15 |         B[1<<i]=(1<<k+1)-(1<<i)-1;
      |                     ~^~
lyuboyn.cpp:17:22: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   17 |         B[1<<i]=(1<<k-1)+(1<<i)-1;
      |                     ~^~

• 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