CSES - Datatähti Open 2017

Submission details
Task:	Program
Sender:	Crinoid
Submission time:	2017-01-24 22:02:44 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	37
#3	ACCEPTED	42

Test results
test	verdict	time	group
#1	ACCEPTED	0.03 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.04 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.04 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.04 s	1	details
#10	ACCEPTED	0.04 s	1	details
#11	ACCEPTED	0.04 s	2	details
#12	ACCEPTED	0.05 s	2	details
#13	ACCEPTED	0.04 s	2	details
#14	ACCEPTED	0.03 s	2	details
#15	ACCEPTED	0.03 s	2	details
#16	ACCEPTED	0.04 s	2	details
#17	ACCEPTED	0.05 s	2	details
#18	ACCEPTED	0.04 s	2	details
#19	ACCEPTED	0.04 s	2	details
#20	ACCEPTED	0.03 s	2	details
#21	ACCEPTED	0.04 s	3	details
#22	ACCEPTED	0.04 s	3	details
#23	ACCEPTED	0.05 s	3	details
#24	ACCEPTED	0.04 s	3	details
#25	ACCEPTED	0.03 s	3	details
#26	ACCEPTED	0.04 s	3	details
#27	ACCEPTED	0.03 s	3	details
#28	ACCEPTED	0.03 s	3	details
#29	ACCEPTED	0.05 s	3	details
#30	ACCEPTED	0.04 s	3	details

Code

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll mod7 = 1000000007;

#define eb(x) emplace_back(x)
#define ef(x) emplace_front(x)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define ob(x) pop_back(x)
#define of(x) pop_front(x)
#define mp(a, b) make_pair(a, b)

#define power(x, p) round(pow(x, (double)p))
#define all(x) x.begin(), x.end()
#define sortAs(x) sort(all(x));
#define sortDes(x) sort(all(x), std::greater<ll>());

#define fori(x) for (ll i = 0; i < x; i++)
#define forj(x) for (ll j = 0; j < x; j++)
#define fork(x) for (ll k = 0; k < x; k++)

#define ret(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define rep(u, s, x) for (ll u = s; u <= x; u++)
#define rem(u, x, s) for (ll u = s; u >= x; u--)

#define RET(t) cout << t << endl; return 0;
#define RETIF(i, t) if (i) { cout << t << endl; return 0; }
#define BREAKIF(i, t) if (i) { cout << t << endl; break; }
#define CONTIF(i, t) if (i) { cout << t << endl; continue; }

#define NEWLINE cout << endl;
#define DBG(args...) { vector<string> _v = split(#args, ','); err(_v.begin(), args); cout << endl; }

vector<string> split(const string& s, char c) {
	vector<string> v;
	stringstream ss(s);
	string x;
	while (getline(ss, x, c))
		v.emplace_back(x);
	return move(v);
}

void err(vector<string>::iterator it) {}
template<typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
	cout << it -> substr((*it)[0] == ' ', it -> length()) << ": " << a << " ";
	err(++it, args...);
}

#define DBGARRAY(x, s) cout << #x << ": "; for (int z = 0; z < s; z++) cout << x[z] << " "; cout << endl;
#define DBGVECTOR(x) cout << #x << ": "; for (ll z = 0; z < x.size(); z++) cout << x[z] << " "; cout << endl;
#define DBGVECTORPAR(x, p) cout << #x << ": "; for (ll z = 0; z < x.size(); z++) cout << x[z].p << " "; cout << endl;
#define DBGMAP(x) cout << #x << ":" << endl; for (auto z = x.begin(); z != x.end(); z++) { cout << z->first << ": " << z->second << endl; }
#define DBGSET(x) cout << #x << ":" << endl; for (auto z = x.begin(); z != x.end(); z++) { cout << *z << endl;}

bool isPrime(long long a) { if (a <= 1) return 0; for(long long i = 2; i * i <= a; i++) { if(a % i == 0) return 0; } return 1; }

ll lcm(ll a, ll b) { return __gcd(a, b) ? (a / __gcd(a, b) * b) : 0; }

template<typename T>
ll biggest(T x) {ll b_i = 0; fori(x.size()) {if (x[b_i] < x[i]) {b_i = i;} } return b_i;}
template<typename T>
ll smallest(T x) {ll s_i = 0; fori(x.size()) {if (x[s_i] > x[i]) {s_i = i;} } return s_i;}

template<typename T>
string tostring(T num) { stringstream convert; convert << num; return convert.str(); }
template<typename T>
ll tonumber(T stringNum) { ll a; stringstream convert; convert << stringNum; convert >> a; return a; }


ll A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z;
char C1, C2, C3, C4;
string S1, S2, S3, S4;
vl V1, V2, V3, V4;
bool B1, B2;

int main()
{
    std::ios_base::sync_with_stdio(0); cin.tie(0); cin.clear();

    cin >> N;

    vector<string> op;

    while (N > 1)
    {
        if (N == 4 || N % 2 == 1)
        {
            op.pb("ADD");
            N -= 3;
        }
        else if (N % 2 == 0)
        {
            op.pb("MUL");
            N /= 2;
        }
    }

    RETIF (N < 1, 0);

    cout << op.size() + 1 << endl;


    rem(i, 0, op.size() - 1)
    {
        cout << op[i] << endl;
    }

    cout << "END" << endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`58` view save

correct output
`8 MUL ADD MUL ADD ...` view save

user output
`8 MUL ADD MUL ADD ...` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`72` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`83` view save

correct output
`8 MUL ADD MUL MUL ...` view save

user output
`8 MUL ADD MUL MUL ...` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`53` view save

correct output
`8 ADD MUL ADD MUL ...` view save

user output
`8 ADD MUL ADD MUL ...` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`100` view save

correct output
`8 ADD MUL ADD MUL ...` view save

user output
`8 ADD MUL ADD MUL ...` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`64` view save

correct output
`6 ADD MUL MUL MUL ...` view save

user output
`6 ADD MUL MUL MUL ...` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`84` view save

correct output
`0` view save

user output
`0` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`60` view save

correct output
`0` view save

user output
`0` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`51` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`77` view save

correct output
`9 ADD ADD MUL ADD ...` view save

user output
`9 ADD ADD MUL ADD ...` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`941694` view save

correct output
`0` view save

user output
`0` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`905674` view save

correct output
`30 MUL ADD MUL ADD ...` view save

user output
`30 MUL ADD MUL ADD ...` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`908426` view save

correct output
`29 ADD MUL ADD MUL ...` view save

user output
`29 ADD MUL ADD MUL ...` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`960500` view save

correct output
`31 ADD ADD MUL MUL ...` view save

user output
`31 ADD ADD MUL MUL ...` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`902101` view save

correct output
`27 MUL ADD MUL ADD ...` view save

user output
`27 MUL ADD MUL ADD ...` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`994208` view save

correct output
`27 ADD ADD MUL MUL ...` view save

user output
`27 ADD ADD MUL MUL ...` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`923538` view save

correct output
`0` view save

user output
`0` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`950287` view save

correct output
`24 MUL ADD MUL ADD ...` view save

user output
`24 MUL ADD MUL ADD ...` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`950516` view save

correct output
`29 ADD ADD MUL MUL ...` view save

user output
`29 ADD ADD MUL MUL ...` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`921882` view save

correct output
`0` view save

user output
`0` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`933942296856681219` view save

correct output
`0` view save

user output
`0` view save

Test 22

Group: 3

Verdict: ACCEPTED

input
`955775764385016720` view save

correct output
`0` view save

user output
`0` view save

Test 23

Group: 3

Verdict: ACCEPTED

input
`981578916796073406` view save

correct output
`0` view save

user output
`0` view save

Test 24

Group: 3

Verdict: ACCEPTED

input
`927875200723222396` view save

correct output
`94 MUL ADD MUL MUL ...` view save

user output
`94 MUL ADD MUL MUL ...` view save

Test 25

Group: 3

Verdict: ACCEPTED

input
`990125206148420558` view save

correct output
`84 ADD MUL ADD MUL ...` view save

user output
`84 ADD MUL ADD MUL ...` view save

Test 26

Group: 3

Verdict: ACCEPTED

input
`964804802247123102` view save

correct output
`0` view save

user output
`0` view save

Test 27

Group: 3

Verdict: ACCEPTED

input
`996610423667404231` view save

correct output
`96 MUL ADD MUL ADD ...` view save

user output
`96 MUL ADD MUL ADD ...` view save

Test 28

Group: 3

Verdict: ACCEPTED

input
`948665008088793691` view save

correct output
`86 MUL ADD MUL ADD ...` view save

user output
`86 MUL ADD MUL ADD ...` view save

Test 29

Group: 3

Verdict: ACCEPTED

input
`969397787818953279` view save

correct output
`0` view save

user output
`0` view save

Test 30

Group: 3

Verdict: ACCEPTED

input
`918471787211371085` view save

correct output
`90 ADD MUL ADD MUL ...` view save

user output
`90 ADD MUL ADD MUL ...` view save

Datatähti Open 2017

Program

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (Crinoid)