Submission details
Task:Program
Sender:aalto26ew_006
Submission time:2026-09-30 16:30:00 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttimesubtask
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails

Code

#include <iostream>
using namespace std;

int main() {
    long long n;
    cin >> n;
    // n = 2^k + 3*M
    int bestK = -1;
    long long best = 0;
    for (int k = 0; k < 62 && (1LL << k) <= n; k++) {
        long long d = n - (1LL << k);
        if (d % 3) continue;
        long long M = d / 3;
        long long cost = k + __builtin_popcountll(M & ((1LL << k) - 1)) + (M >> k);
        if (bestK < 0 || cost < best) best = cost, bestK = k;
    }
    if (bestK < 0) {
        cout << 0 << "\n";
        return 0;
    }
    long long M = (n - (1LL << bestK)) / 3;
    string out;
    for (long long i = 0; i < (M >> bestK); i++) out += "ADD\n";
    for (int i = bestK - 1; i >= 0; i--) {
        out += "MUL\n";
        if (M >> i & 1) out += "ADD\n";
    }
    out += "END\n";
    cout << best + 1 << "\n" << out;
}

Test details

Test 1

Subtask:

Verdict: ACCEPTED

input
58

correct output
8
MUL
ADD
MUL
ADD
...

user output
8
ADD
ADD
ADD
ADD
...

Test 2

Subtask:

Verdict: ACCEPTED

input
72

correct output
0

user output
0

Test 3

Subtask:

Verdict: ACCEPTED

input
83

correct output
8
MUL
ADD
MUL
MUL
...

user output
8
ADD
ADD
ADD
MUL
...

Test 4

Subtask:

Verdict: ACCEPTED

input
53

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MUL
ADD
MUL
...

Test 5

Subtask:

Verdict: ACCEPTED

input
100

correct output
8
ADD
MUL
ADD
MUL
...

user output
8
ADD
MUL
ADD
MUL
...

Test 6

Subtask:

Verdict: ACCEPTED

input
64

correct output
6
ADD
MUL
MUL
MUL
...

user output
6
ADD
MUL
MUL
MUL
...

Test 7

Subtask:

Verdict: ACCEPTED

input
84

correct output
0

user output
0

Test 8

Subtask:

Verdict: ACCEPTED

input
60

correct output
0

user output
0

Test 9

Subtask:

Verdict: ACCEPTED

input
51

correct output
0

user output
0

Test 10

Subtask:

Verdict: ACCEPTED

input
77

correct output
9
ADD
ADD
MUL
ADD
...

user output
9
ADD
ADD
MUL
ADD
...

Test 11

Subtask:

Verdict: ACCEPTED

input
941694

correct output
0

user output
0

Test 12

Subtask:

Verdict: ACCEPTED

input
905674

correct output
30
MUL
ADD
MUL
ADD
...

user output
30
ADD
ADD
ADD
ADD
...

Test 13

Subtask:

Verdict: ACCEPTED

input
908426

correct output
29
ADD
MUL
ADD
MUL
...

user output
29
ADD
MUL
ADD
MUL
...

Test 14

Subtask:

Verdict: ACCEPTED

input
960500

correct output
31
ADD
ADD
MUL
MUL
...

user output
31
ADD
ADD
MUL
MUL
...

Test 15

Subtask:

Verdict: ACCEPTED

input
902101

correct output
27
MUL
ADD
MUL
ADD
...

user output
27
ADD
ADD
ADD
ADD
...

Test 16

Subtask:

Verdict: ACCEPTED

input
994208

correct output
27
ADD
ADD
MUL
MUL
...

user output
27
ADD
ADD
MUL
MUL
...

Test 17

Subtask:

Verdict: ACCEPTED

input
923538

correct output
0

user output
0

Test 18

Subtask:

Verdict: ACCEPTED

input
950287

correct output
24
MUL
ADD
MUL
ADD
...

user output
24
ADD
ADD
ADD
ADD
...

Test 19

Subtask:

Verdict: ACCEPTED

input
950516

correct output
29
ADD
ADD
MUL
MUL
...

user output
29
ADD
ADD
MUL
MUL
...

Test 20

Subtask:

Verdict: ACCEPTED

input
921882

correct output
0

user output
0

Test 21

Subtask:

Verdict: ACCEPTED

input
933942296856681219

correct output
0

user output
0

Test 22

Subtask:

Verdict: ACCEPTED

input
955775764385016720

correct output
0

user output
0

Test 23

Subtask:

Verdict: ACCEPTED

input
981578916796073406

correct output
0

user output
0

Test 24

Subtask:

Verdict: ACCEPTED

input
927875200723222396

correct output
94
MUL
ADD
MUL
MUL
...

user output
94
ADD
ADD
ADD
MUL
...

Test 25

Subtask:

Verdict: ACCEPTED

input
990125206148420558

correct output
84
ADD
MUL
ADD
MUL
...

user output
84
ADD
MUL
ADD
MUL
...

Test 26

Subtask:

Verdict: ACCEPTED

input
964804802247123102

correct output
0

user output
0

Test 27

Subtask:

Verdict: ACCEPTED

input
996610423667404231

correct output
96
MUL
ADD
MUL
ADD
...

user output
96
ADD
ADD
ADD
ADD
...

Test 28

Subtask:

Verdict: ACCEPTED

input
948665008088793691

correct output
86
MUL
ADD
MUL
ADD
...

user output
86
ADD
ADD
ADD
ADD
...

Test 29

Subtask:

Verdict: ACCEPTED

input
969397787818953279

correct output
0

user output
0

Test 30

Subtask:

Verdict: ACCEPTED

input
918471787211371085

correct output
90
ADD
MUL
ADD
MUL
...

user output
90
ADD
MUL
ADD
MUL
...