제출 #222422

#제출 시각아이디문제언어결과실행 시간메모리
222422oolimryPopcount (COCI19_popcount)C++14
0 / 110
6 ms384 KiB
#include <bits/stdc++.h>

using namespace std;

int N, K; 
void subtask1(){
	printf("%d\n",N-1);
	for(int i = 1;i < N;i++){
		printf("A=(A+(((A&(1<<%d))>>%d)))-((A&(1<<%d)))\n", i, i, i);
	}
}
//A=(A+(((A&(1<<1))>>1)))-((A&(1<<1)))



int main(){
	cin >> N >> K;
	
	if(N == K + 1) subtask1();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...