oj.uz

답안 #222479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
222479 2020-04-13T08:10:27 Z oolimry Popcount (COCI19_popcount) C++14
15 / 110
 5 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

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

void subtask2(){
	vector<string> ans;
	printf("127\n");
	bool mode = false;
	for(int i = 0;i < 8;i += 2){
		printf("A=((A+(((A&(1<<%d))>>%d)-(A&(1<<%d))))+(((A&(1<<%d))>>%d)-(A&(1<<%d))))\n", i, i, i, i + 1, i + 1,i + 1);
	}
	for(int i = 8;i < 500;i += 4){
		printf("A=((((A+((A&(1<<%d))>>%d))+((A&(1<<%d))>>%d))+((A&(1<<%d))>>%d))+((A&(1<<%d))>>%d))\n", i,i,i+1,i+1,i+2,i+2,i+3,i+3);
	}
}
//A=((A+(((A&(1<<%d))>>%d)))-((A&(1<<%d))))



int main(){
	cin >> N >> K;
	
	if(N == K + 1) subtask1();
	else subtask2();
}

Compilation message

popcount.cpp: In function 'void subtask2()':
popcount.cpp:24:7: warning: unused variable 'mode' [-Wunused-variable]
  bool mode = false;
       ^~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Accepted.
2 Correct 4 ms 256 KB Accepted.
3 Correct 4 ms 256 KB Accepted.
4 Correct 4 ms 256 KB Accepted.
5 Correct 5 ms 256 KB Accepted.
6 Correct 4 ms 256 KB Accepted.
7 Correct 4 ms 256 KB Accepted.
8 Correct 5 ms 256 KB Accepted.
9 Correct 4 ms 256 KB Accepted.
10 Correct 4 ms 256 KB Accepted.
11 Correct 5 ms 256 KB Accepted.
12 Correct 5 ms 384 KB Accepted.
13 Correct 5 ms 256 KB Accepted.
14 Correct 5 ms 256 KB Accepted.

Subtask #2
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Wrong answer.

Subtask #3
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Incorrect number of commands.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Incorrect number of commands.
2 Halted 0 ms 0 KB -