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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:57:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < vec.size(); i++)
                               ^

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

string a[3] = {"MUL", "ADD", "END"};
int main()
{
  ios_base::sync_with_stdio(0); cin.tie(0);
  ll n; cin>>n;
  vector<string> vec;
  vec.pb(a[2]);
  while(n>1)
  {
    if(n==4)
    {
      vec.pb(a[1]);
      n-=3;
      break;
    }
    if(n&1)
    {
      n-=3;
      vec.pb(a[1]);
    }
    else
    {
      n>>=1;
      vec.pb(a[0]);
    }
  }
  if(n==0)
  {
    cout<<0;
    return 0;
  }
  reverse(vec.begin(),vec.end());
  cout<<vec.size()<<'\n';
  for(int i = 0; i < vec.size(); i++)
  {
    cout<<vec[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: 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
...