CSES - Datatähti Open 2017 - Results
Submission details
Task:Program
Sender:MladenP
Submission time:2017-01-22 22:24:05 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.04 s1details
#40.03 s1details
#50.04 s1details
#60.04 s1details
#7ACCEPTED0.04 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.05 s1details
#100.04 s1details
#11ACCEPTED0.04 s2details
#12ACCEPTED0.04 s2details
#130.05 s2details
#140.05 s2details
#15ACCEPTED0.03 s2details
#160.04 s2details
#17ACCEPTED0.04 s2details
#18ACCEPTED0.03 s2details
#190.03 s2details
#20ACCEPTED0.04 s2details
#21ACCEPTED0.03 s3details
#22ACCEPTED0.04 s3details
#23ACCEPTED0.05 s3details
#24ACCEPTED0.05 s3details
#250.03 s3details
#26ACCEPTED0.03 s3details
#27ACCEPTED0.04 s3details
#28ACCEPTED0.05 s3details
#29ACCEPTED0.03 s3details
#300.04 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:22:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     long long n; scanf("%lld", &n);
                                   ^

Code

#include <bits/stdc++.h>
#define INF 1000000007
using namespace std;
int korak(long long n) {
    int rez =0;
    while(n!=0) {
        rez += n%2+1;
        n/=2;
    }
    return rez-2;
}
int signif(long long n) {
    int rez = 0;
    while(n!=0) {
        rez++;
        n/=2;
    }
    return rez;
}
vector <string> rez;
int main() {
    long long n; scanf("%lld", &n);
    int min_korak = INF, min_stepen = INF;
    if(n%3 == 0) return printf("0"), 0;
    for(int i = 0; i < 63; i++) {
        if(n >= (1LL << i) &&  (n - (1LL << i))%3 == 0) {

            long long k = (n - (1LL << i))/3;
            int r = korak(k);
            int bit = signif(k);
            if(i < bit) continue;
            r += i-bit;
            if(r < min_korak) {
                min_korak = r;
                min_stepen = i;
            }
            //printf("%d %lld %d %d %d\n", i, k, korak(k), r, bit);
        }
    }
    rez.push_back("END");
    long long k = (n - (1LL << min_stepen)) / 3;
    int r = min_stepen-signif(k);
    while(k != 0) {
        if(k%2) {
            rez.push_back("ADD");
            rez.push_back("MUL");
        }
        else rez.push_back("MUL");
        k/=2;
    }
    for(int i = 0; i < r; i++) rez.push_back("MUL");
    cout << rez.size() << '\n';
    for(int i = rez.size()-1; i>=0; i--) cout << rez[i] << '\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:

input
53

correct output
8
ADD
MUL
ADD
MUL
...

user output
9
MUL
MUL
MUL
ADD
...

Test 5

Group: 1

Verdict:

input
100

correct output
8
ADD
MUL
ADD
MUL
...

user output
9
MUL
MUL
MUL
ADD
...

Test 6

Group: 1

Verdict:

input
64

correct output
6
ADD
MUL
MUL
MUL
...

user output
7
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:

input
77

correct output
9
ADD
ADD
MUL
ADD
...

user output
10
MUL
MUL
ADD
MUL
...

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:

input
908426

correct output
29
ADD
MUL
ADD
MUL
...

user output
30
MUL
MUL
MUL
ADD
...

Test 14

Group: 2

Verdict:

input
960500

correct output
31
ADD
ADD
MUL
MUL
...

user output
32
MUL
MUL
ADD
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:

input
994208

correct output
27
ADD
ADD
MUL
MUL
...

user output
28
MUL
MUL
ADD
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:

input
950516

correct output
29
ADD
ADD
MUL
MUL
...

user output
30
MUL
MUL
ADD
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:

input
990125206148420558

correct output
84
ADD
MUL
ADD
MUL
...

user output
85
MUL
MUL
MUL
ADD
...

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:

input
918471787211371085

correct output
90
ADD
MUL
ADD
MUL
...

user output
91
MUL
MUL
MUL
ADD
...