Submission #290890

#	Time	Username	Problem	Language	Result	Execution time	Memory
290890		Plurm	"The Lyuboyn" code (IZhO19_lyuboyn)	C++11	3 / 100	52 ms	5368 KiB

lyuboyn

#include <bits/stdc++.h>
using namespace std;
int lsb[300005];
int main(){
	int n,k,t;
	scanf("%d%d%d",&n,&k,&t);
	if(k % 2 == 0){
		printf("-1\n");
		return 0;
	}
	char bs[32];
	scanf("%s",bs);
	int parsed = 0;
	for(int i = 0; i < n; i++){
		parsed *= 2;
		parsed += bs[i] == '1' ? 1 : 0;
	}
	printf("%s\n",bs);
	for(int i = 1; i < (1 << n); i++){
		int bit = i & -i;
		for(int j = 0; j < k; j++){
			int toggidx = (bit+j) % n;
			bs[n-toggidx-1] = '0'+'1'-bs[n-toggidx-1];
		}
		printf("%s\n",bs);
	}
	return 0;
}

Compilation message (stderr)

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    6 |  scanf("%d%d%d",&n,&k,&t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
lyuboyn.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |  scanf("%s",bs);
      |  ~~~~~^~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 0 / 5
• Subtask 3: 3 / 3
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 31
• Subtask 8: 0 / 17