Task: | Program |
Sender: | ruhanhabib39 |
Submission time: | 2017-01-20 19:51:33 +0200 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 21 |
#2 | ACCEPTED | 37 |
#3 | ACCEPTED | 42 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.03 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.03 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.04 s | 1 | details |
#6 | ACCEPTED | 0.03 s | 1 | details |
#7 | ACCEPTED | 0.04 s | 1 | details |
#8 | ACCEPTED | 0.04 s | 1 | details |
#9 | ACCEPTED | 0.05 s | 1 | details |
#10 | ACCEPTED | 0.04 s | 1 | details |
#11 | ACCEPTED | 0.04 s | 2 | details |
#12 | ACCEPTED | 0.03 s | 2 | details |
#13 | ACCEPTED | 0.03 s | 2 | details |
#14 | ACCEPTED | 0.03 s | 2 | details |
#15 | ACCEPTED | 0.04 s | 2 | details |
#16 | ACCEPTED | 0.03 s | 2 | details |
#17 | ACCEPTED | 0.04 s | 2 | details |
#18 | ACCEPTED | 0.04 s | 2 | details |
#19 | ACCEPTED | 0.04 s | 2 | details |
#20 | ACCEPTED | 0.03 s | 2 | details |
#21 | ACCEPTED | 0.04 s | 3 | details |
#22 | ACCEPTED | 0.03 s | 3 | details |
#23 | ACCEPTED | 0.03 s | 3 | details |
#24 | ACCEPTED | 0.03 s | 3 | details |
#25 | ACCEPTED | 0.04 s | 3 | details |
#26 | ACCEPTED | 0.04 s | 3 | details |
#27 | ACCEPTED | 0.04 s | 3 | details |
#28 | ACCEPTED | 0.04 s | 3 | details |
#29 | ACCEPTED | 0.04 s | 3 | details |
#30 | ACCEPTED | 0.04 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:24:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &n); ^
Code
#include <bits/stdc++.h> using namespace std; typedef long long Long; Long n; deque<int> res; void solve() { if(n % 3 == 0) return; res.push_back(0); while(n > 1) { if(n != 4 && n % 2 == 0) { res.push_front(-1); n /= 2; } else { res.push_front(+1); n -= 3; } } } int main() { scanf("%lld", &n); solve(); printf("%d\n", (int)res.size()); for(int x : res) { if(x == -1) printf("MUL\n"); if(x == +1) printf("ADD\n"); if(x == 0) printf("END\n"); } }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
58 |
correct output |
---|
8 MUL ADD MUL ADD ... |
user output |
---|
8 MUL ADD MUL ADD ... |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
72 |
correct output |
---|
0 |
user output |
---|
0 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
83 |
correct output |
---|
8 MUL ADD MUL MUL ... |
user output |
---|
8 MUL ADD MUL MUL ... |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
53 |
correct output |
---|
8 ADD MUL ADD MUL ... |
user output |
---|
8 ADD MUL ADD MUL ... |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
100 |
correct output |
---|
8 ADD MUL ADD MUL ... |
user output |
---|
8 ADD MUL ADD MUL ... |
Test 6
Group: 1
Verdict: ACCEPTED
input |
---|
64 |
correct output |
---|
6 ADD MUL MUL MUL ... |
user output |
---|
6 ADD MUL MUL MUL ... |
Test 7
Group: 1
Verdict: ACCEPTED
input |
---|
84 |
correct output |
---|
0 |
user output |
---|
0 |
Test 8
Group: 1
Verdict: ACCEPTED
input |
---|
60 |
correct output |
---|
0 |
user output |
---|
0 |
Test 9
Group: 1
Verdict: ACCEPTED
input |
---|
51 |
correct output |
---|
0 |
user output |
---|
0 |
Test 10
Group: 1
Verdict: ACCEPTED
input |
---|
77 |
correct output |
---|
9 ADD ADD MUL ADD ... |
user output |
---|
9 ADD ADD MUL ADD ... |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
941694 |
correct output |
---|
0 |
user output |
---|
0 |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
905674 |
correct output |
---|
30 MUL ADD MUL ADD ... |
user output |
---|
30 MUL ADD MUL ADD ... |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
908426 |
correct output |
---|
29 ADD MUL ADD MUL ... |
user output |
---|
29 ADD MUL ADD MUL ... |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
960500 |
correct output |
---|
31 ADD ADD MUL MUL ... |
user output |
---|
31 ADD ADD MUL MUL ... |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
902101 |
correct output |
---|
27 MUL ADD MUL ADD ... |
user output |
---|
27 MUL ADD MUL ADD ... |
Test 16
Group: 2
Verdict: ACCEPTED
input |
---|
994208 |
correct output |
---|
27 ADD ADD MUL MUL ... |
user output |
---|
27 ADD ADD MUL MUL ... |
Test 17
Group: 2
Verdict: ACCEPTED
input |
---|
923538 |
correct output |
---|
0 |
user output |
---|
0 |
Test 18
Group: 2
Verdict: ACCEPTED
input |
---|
950287 |
correct output |
---|
24 MUL ADD MUL ADD ... |
user output |
---|
24 MUL ADD MUL ADD ... |
Test 19
Group: 2
Verdict: ACCEPTED
input |
---|
950516 |
correct output |
---|
29 ADD ADD MUL MUL ... |
user output |
---|
29 ADD ADD MUL MUL ... |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
921882 |
correct output |
---|
0 |
user output |
---|
0 |
Test 21
Group: 3
Verdict: ACCEPTED
input |
---|
933942296856681219 |
correct output |
---|
0 |
user output |
---|
0 |
Test 22
Group: 3
Verdict: ACCEPTED
input |
---|
955775764385016720 |
correct output |
---|
0 |
user output |
---|
0 |
Test 23
Group: 3
Verdict: ACCEPTED
input |
---|
981578916796073406 |
correct output |
---|
0 |
user output |
---|
0 |
Test 24
Group: 3
Verdict: ACCEPTED
input |
---|
927875200723222396 |
correct output |
---|
94 MUL ADD MUL MUL ... |
user output |
---|
94 MUL ADD MUL MUL ... |
Test 25
Group: 3
Verdict: ACCEPTED
input |
---|
990125206148420558 |
correct output |
---|
84 ADD MUL ADD MUL ... |
user output |
---|
84 ADD MUL ADD MUL ... |
Test 26
Group: 3
Verdict: ACCEPTED
input |
---|
964804802247123102 |
correct output |
---|
0 |
user output |
---|
0 |
Test 27
Group: 3
Verdict: ACCEPTED
input |
---|
996610423667404231 |
correct output |
---|
96 MUL ADD MUL ADD ... |
user output |
---|
96 MUL ADD MUL ADD ... |
Test 28
Group: 3
Verdict: ACCEPTED
input |
---|
948665008088793691 |
correct output |
---|
86 MUL ADD MUL ADD ... |
user output |
---|
86 MUL ADD MUL ADD ... |
Test 29
Group: 3
Verdict: ACCEPTED
input |
---|
969397787818953279 |
correct output |
---|
0 |
user output |
---|
0 |
Test 30
Group: 3
Verdict: ACCEPTED
input |
---|
918471787211371085 |
correct output |
---|
90 ADD MUL ADD MUL ... |
user output |
---|
90 ADD MUL ADD MUL ... |