CSES - Datatähti Open 2017 - Results
Submission details
Task:Program
Sender:Bekmyrat
Submission time:2017-02-03 12:54:13 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.06 s1details
#40.05 s1details
#50.05 s1details
#60.06 s1details
#7ACCEPTED0.04 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.06 s1details
#100.05 s1details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.04 s2details
#130.04 s2details
#140.05 s2details
#15ACCEPTED0.04 s2details
#160.06 s2details
#17ACCEPTED0.06 s2details
#18ACCEPTED0.05 s2details
#190.05 s2details
#20ACCEPTED0.06 s2details
#210.20 s3details
#220.20 s3details
#230.20 s3details
#240.18 s3details
#250.20 s3details
#260.23 s3details
#270.19 s3details
#280.17 s3details
#290.18 s3details
#300.20 s3details

Compiler report

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

Code

#include <set>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <vector>
#include <stdio.h>
#include <fstream>
#include <iostream>
#include <string.h>
#include <limits.h>
#include <algorithm>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <bits/stdc++.h>

#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define inf 1000000007
#define mod 1000000007
#define pii pair <int, int>
#define all(x) x.begin(), x.end()
#define FOR(i, x, y) for (int i = x; i <= y; i++)
//#define tr(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)

//using namespace __gnu_pbds;

using namespace std;

//template <typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

ll n;

int sz;

string s[77];

int main()
{
	scanf("%lld", &n);
	
	s[sz++] = "END";
	
	while (n > 1) {
		if (n%2 == 0)
			n/=2, s[sz++] = "MUL";
		else
			n-=3, s[sz++] = "ADD";
	}
	
	if (n < 1)
		sz = 0;
	
	printf("%d\n", sz);
	for (int i = sz-1; i >= 0; i--)
		printf("%s\n", s[i].c_str());
}

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:

input
933942296856681219

correct output
0

user output
(empty)

Test 22

Group: 3

Verdict:

input
955775764385016720

correct output
0

user output
(empty)

Test 23

Group: 3

Verdict:

input
981578916796073406

correct output
0

user output
(empty)

Test 24

Group: 3

Verdict:

input
927875200723222396

correct output
94
MUL
ADD
MUL
MUL
...

user output
(empty)

Test 25

Group: 3

Verdict:

input
990125206148420558

correct output
84
ADD
MUL
ADD
MUL
...

user output
(empty)

Test 26

Group: 3

Verdict:

input
964804802247123102

correct output
0

user output
(empty)

Test 27

Group: 3

Verdict:

input
996610423667404231

correct output
96
MUL
ADD
MUL
ADD
...

user output
(empty)

Test 28

Group: 3

Verdict:

input
948665008088793691

correct output
86
MUL
ADD
MUL
ADD
...

user output
(empty)

Test 29

Group: 3

Verdict:

input
969397787818953279

correct output
0

user output
(empty)

Test 30

Group: 3

Verdict:

input
918471787211371085

correct output
90
ADD
MUL
ADD
MUL
...

user output
(empty)