Task: | Program |
Sender: | egor.lifar |
Submission time: | 2017-01-21 20:57:49 +0200 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 21 |
#2 | ACCEPTED | 37 |
#3 | ACCEPTED | 42 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.05 s | 1 | details |
#4 | ACCEPTED | 0.04 s | 1 | details |
#5 | ACCEPTED | 0.04 s | 1 | details |
#6 | ACCEPTED | 0.05 s | 1 | details |
#7 | ACCEPTED | 0.05 s | 1 | details |
#8 | ACCEPTED | 0.05 s | 1 | details |
#9 | ACCEPTED | 0.03 s | 1 | details |
#10 | ACCEPTED | 0.05 s | 1 | details |
#11 | ACCEPTED | 0.05 s | 2 | details |
#12 | ACCEPTED | 0.06 s | 2 | details |
#13 | ACCEPTED | 0.05 s | 2 | details |
#14 | ACCEPTED | 0.04 s | 2 | details |
#15 | ACCEPTED | 0.04 s | 2 | details |
#16 | ACCEPTED | 0.05 s | 2 | details |
#17 | ACCEPTED | 0.06 s | 2 | details |
#18 | ACCEPTED | 0.05 s | 2 | details |
#19 | ACCEPTED | 0.05 s | 2 | details |
#20 | ACCEPTED | 0.04 s | 2 | details |
#21 | ACCEPTED | 0.05 s | 3 | details |
#22 | ACCEPTED | 0.05 s | 3 | details |
#23 | ACCEPTED | 0.04 s | 3 | details |
#24 | ACCEPTED | 0.06 s | 3 | details |
#25 | ACCEPTED | 0.06 s | 3 | details |
#26 | ACCEPTED | 0.04 s | 3 | details |
#27 | ACCEPTED | 0.06 s | 3 | details |
#28 | ACCEPTED | 0.04 s | 3 | details |
#29 | ACCEPTED | 0.05 s | 3 | details |
#30 | ACCEPTED | 0.05 s | 3 | details |
Code
#include <iostream>#include <vector>#include <string>#include <algorithm>#include <cstdio>#include <numeric>#include <cstring>#include <ctime>#include <cstdlib>#include <set>#include <map>#include <unordered_map>#include <unordered_set>#include <list>#include <cmath>#include <bitset>#include <cassert>#include <queue>#include <stack>#include <deque>#include <cassert>using namespace std;template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }/** Interface */inline int readChar();template <class T = int> inline T readInt();template <class T> inline void writeInt( T x, char end = 0 );inline void writeChar( int x );inline void writeWord( const char *s );/** Read */static const int buf_size = 4096;inline int getChar() {static char buf[buf_size];static int len = 0, pos = 0;if (pos == len)pos = 0, len = fread(buf, 1, buf_size, stdin);if (pos == len)return -1;return buf[pos++];}inline int readChar() {int c = getChar();while (c <= 32)c = getChar();return c;}template <class T>inline T readInt() {int s = 1, c = readChar();T x = 0;if (c == '-')s = -1, c = getChar();while ('0' <= c && c <= '9')x = x * 10 + c - '0', c = getChar();return s == 1 ? x : -x;}/** Write */static int write_pos = 0;static char write_buf[buf_size];inline void writeChar( int x ) {if (write_pos == buf_size)fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;write_buf[write_pos++] = x;}template <class T>inline void writeInt( T x, char end ) {if (x < 0)writeChar('-'), x = -x;char s[24];int n = 0;while (x || !n)s[n++] = '0' + x % 10, x /= 10;while (n--)writeChar(s[n]);if (end)writeChar(end);}inline void writeWord( const char *s ) {while (*s)writeChar(*s++);}struct Flusher {~Flusher() {if (write_pos)fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;}} flusher;#define prev prev228#define left left228#define right right228#define sz(c) (int)(c).size()#define all(c) (c).begin(), (c).end()const int MAXN = 1050001;long long n;int prev[MAXN];int dp[MAXN];int main() {cin >> n;dp[1] = 0;prev[1] = 1;for (int i = 2; i < MAXN; i++) {dp[i] = MAXN + 100;if (i % 2 == 1) {if (i >= 3 && dp[i - 3] < MAXN) {dp[i] = dp[i - 3] + 1;prev[i] = i - 3;}} else {if (i >= 3 && dp[i - 3] < MAXN) {dp[i] = dp[i - 3] + 1;prev[i] = i - 3;}if (dp[i / 2] < MAXN) {if (dp[i] > dp[i / 2] + 1) {dp[i] = dp[i / 2] + 1;prev[i] = i / 2;}}}}vector<string> ans;while (n > 100000) {if (n % 2 == 1) {n -= 3;ans.push_back("ADD");} else {n >>= 1LL;ans.push_back("MUL");}}while (n != 1LL) {if (prev[n] == 0) {cout << 0 << endl;return 0;}if (prev[n] == n - 3) {n -= 3;ans.push_back("ADD");} else {n >>= 1LL;ans.push_back("MUL");}}reverse(all(ans));ans.push_back("END");cout << sz(ans) << endl;for (auto x: ans) {cout << x << endl;}return 0;}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
58 |
correct output |
---|
8 MUL ADD MUL ADD ... |
user output |
---|
8 ADD ADD ADD 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 ADD ADD ADD 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 ADD ADD ADD 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 ADD ADD ADD 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 ADD ADD ADD 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 ADD ADD ADD 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 ADD ADD ADD ADD ... |
Test 28
Group: 3
Verdict: ACCEPTED
input |
---|
948665008088793691 |
correct output |
---|
86 MUL ADD MUL ADD ... |
user output |
---|
86 ADD ADD ADD 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 ... |