CSES - Datatähti 2017 loppu - Results
Submission details
Task:Ohjelma
Sender:Kuha
Submission time:2017-01-19 13:21:01 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED37
#3ACCEPTED42
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.03 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.03 s1details
#7ACCEPTED0.03 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.02 s1details
#11ACCEPTED0.04 s2details
#12ACCEPTED0.03 s2details
#13ACCEPTED0.04 s2details
#14ACCEPTED0.04 s2details
#15ACCEPTED0.03 s2details
#16ACCEPTED0.04 s2details
#17ACCEPTED0.04 s2details
#18ACCEPTED0.04 s2details
#19ACCEPTED0.04 s2details
#20ACCEPTED0.03 s2details
#21ACCEPTED0.03 s3details
#22ACCEPTED0.04 s3details
#23ACCEPTED0.03 s3details
#24ACCEPTED0.04 s3details
#25ACCEPTED0.04 s3details
#26ACCEPTED0.04 s3details
#27ACCEPTED0.04 s3details
#28ACCEPTED0.02 s3details
#29ACCEPTED0.05 s3details
#30ACCEPTED0.04 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:22:21: warning: narrowing conversion of 'i' from 'long long int' to 'int' inside { } [-Wnarrowing]
   vector<int> x = {i};
                     ^
input/code.cpp:22:21: warning: narrowing conversion of 'i' from 'long long int' to 'int' inside { } [-Wnarrowing]
input/code.cpp:45:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < x.size(); j++) {
                               ^
input/code.cpp:18:6: warning: unused variable 's' [-Wunused-variable]
  int s = 9999999;
      ^

Code

#include <bits/stdc++.h>

#define ll long long

using namespace std;

int main () {
	ll n;
	cin>>n;
	if (n % 3 == 0 || n == 2) {
		cout<<0<<endl;
		return 0;
	}
	if (n == 1) {
		cout<<1<<endl<<"END"<<endl;
		return 0;
	}
	int s = 9999999;
	vector<string> ans;
	for (ll i = 60; i >= 0; i--) {
		if ((1LL<<i) > n) continue;
		vector<int> x = {i};
		ll m = n - (1LL<<i);
		if (m % 3) continue;
		ll k = 3;
		ll p = 0;
		while (2 * k <= m && p + 1 <= i) {
			k = 2 * k;
			p++;
		}
		while (m) {
			while (k <= m) {
				m -= k;
				x.push_back(p);
				if (!ans.empty() && x.size() > ans.size()) break;
			}
			k /= 2;
			p--;
			if (p == -1) break;
			if (!ans.empty() && x.size() > ans.size()) break;
		}
		if (!m) {
			vector<string> sol;
			int t = i;
			for (int j = 0; j < x.size(); j++) {
				while (t > x[j]) sol.push_back("MUL"), t--;
				if (j != 0) sol.push_back("ADD");
			}
			while (t) sol.push_back("MUL"), t--;
			sol.push_back("END");
			if (ans.empty() || ans.size() > sol.size()) ans = sol;
		}
	}
	
	cout<<ans.size()<<endl;
	for (string s : ans) cout<<s<<endl;
	return 0;
}

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
...