This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long N, K;
void subtask1(){
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<<2))>>2))-((A&(1<<2)))
int main(){
cin >> N >> K;
if(N == K + 1) subtask1();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |