| Task: | Program |
| Sender: | Majakas |
| Submission time: | 2017-01-20 20:33:12 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1 | details |
| #2 | ACCEPTED | 0.04 s | 1 | details |
| #3 | WRONG ANSWER | 0.05 s | 1 | details |
| #4 | ACCEPTED | 0.04 s | 1 | details |
| #5 | WRONG ANSWER | 0.03 s | 1 | details |
| #6 | WRONG ANSWER | 0.04 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 | WRONG ANSWER | 0.04 s | 1 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #12 | WRONG ANSWER | 0.04 s | 2 | details |
| #13 | WRONG ANSWER | 0.04 s | 2 | details |
| #14 | WRONG ANSWER | 0.06 s | 2 | details |
| #15 | WRONG ANSWER | 0.04 s | 2 | details |
| #16 | WRONG ANSWER | 0.04 s | 2 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #18 | WRONG ANSWER | 0.03 s | 2 | details |
| #19 | WRONG ANSWER | 0.02 s | 2 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #22 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #23 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #24 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #25 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #26 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #27 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #28 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #29 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #30 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>
#define llong long long
#define f first
#define s second
#define mp make_pair
//#define cin fin
using namespace::std;
ifstream fin("input.txt");
llong INF = 1e18 + 5;
int LIM = 1e5 + 1;
deque<int> order; /// MUL = 1, ADD = 2
llong maxdepth = INF;
deque<int> answ;
void rec(llong a, int depth)
{
if (depth >= maxdepth or a <= 0) {
return;
}
if (a == 1) {
maxdepth = depth;
answ = order;
return;
}
if (a % 2 == 0) {
order.push_back(1);
rec(a / 2, depth + 1);
order.pop_back();
}
if (a > 3) {
order.push_back(2);
rec(a - 3, depth + 1);
order.pop_back();
}
}
int main()
{
int n;
cin >> n;
rec(n, 0);
answ.push_back(3);
if (maxdepth == INF) {
cout << "0\n";
}
else {
cout << ++maxdepth << "\n";
for (int i = 0; i < maxdepth; i++) {
int t1 = answ.front();
answ.pop_front();
if (t1 == 1) {
cout << "MUL\n";
}
else if (t1 == 2) {
cout << "ADD\n";
}
else {
cout << "END\n";
}
}
}
//system("pause");
}
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: WRONG ANSWER
| input |
|---|
| 83 |
| correct output |
|---|
| 8 MUL ADD MUL MUL ... |
| user output |
|---|
| 8 ADD MUL 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: WRONG ANSWER
| input |
|---|
| 100 |
| correct output |
|---|
| 8 ADD MUL ADD MUL ... |
| user output |
|---|
| 8 MUL MUL ADD MUL ... |
Test 6
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 64 |
| correct output |
|---|
| 6 ADD MUL MUL MUL ... |
| user output |
|---|
| 6 MUL 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: WRONG ANSWER
| input |
|---|
| 77 |
| correct output |
|---|
| 9 ADD ADD MUL ADD ... |
| user output |
|---|
| 9 ADD MUL ADD MUL ... |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 941694 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 12
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 905674 |
| correct output |
|---|
| 30 MUL ADD MUL ADD ... |
| user output |
|---|
| 30 MUL ADD MUL ADD ... |
Test 13
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 908426 |
| correct output |
|---|
| 29 ADD MUL ADD MUL ... |
| user output |
|---|
| 29 MUL ADD MUL ADD ... |
Test 14
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 960500 |
| correct output |
|---|
| 31 ADD ADD MUL MUL ... |
| user output |
|---|
| 31 MUL MUL ADD MUL ... |
Test 15
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 902101 |
| correct output |
|---|
| 27 MUL ADD MUL ADD ... |
| user output |
|---|
| 27 ADD MUL ADD MUL ... |
Test 16
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 994208 |
| correct output |
|---|
| 27 ADD ADD MUL MUL ... |
| user output |
|---|
| 27 MUL MUL MUL MUL ... |
Test 17
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 923538 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 18
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 950287 |
| correct output |
|---|
| 24 MUL ADD MUL ADD ... |
| user output |
|---|
| 24 ADD MUL MUL ADD ... |
Test 19
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 950516 |
| correct output |
|---|
| 29 ADD ADD MUL MUL ... |
| user output |
|---|
| 29 MUL MUL ADD MUL ... |
Test 20
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 921882 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 21
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 933942296856681219 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 22
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 955775764385016720 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 23
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 981578916796073406 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 24
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 927875200723222396 |
| correct output |
|---|
| 94 MUL ADD MUL MUL ... |
| user output |
|---|
| (empty) |
Test 25
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 990125206148420558 |
| correct output |
|---|
| 84 ADD MUL ADD MUL ... |
| user output |
|---|
| (empty) |
Test 26
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 964804802247123102 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 27
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 996610423667404231 |
| correct output |
|---|
| 96 MUL ADD MUL ADD ... |
| user output |
|---|
| (empty) |
Test 28
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 948665008088793691 |
| correct output |
|---|
| 86 MUL ADD MUL ADD ... |
| user output |
|---|
| (empty) |
Test 29
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 969397787818953279 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 30
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 918471787211371085 |
| correct output |
|---|
| 90 ADD MUL ADD MUL ... |
| user output |
|---|
| (empty) |
