CSES - Datatähti Open 2017 - Results
Submission details
Task:Program
Sender:pulkitsja
Submission time:2017-01-19 22:18:08 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.31 s1details
#2ACCEPTED0.32 s1details
#30.40 s1details
#40.33 s1details
#50.32 s1details
#60.30 s1details
#7ACCEPTED0.30 s1details
#8ACCEPTED0.32 s1details
#9ACCEPTED0.35 s1details
#100.39 s1details
#11ACCEPTED0.32 s2details
#120.32 s2details
#130.33 s2details
#140.31 s2details
#150.30 s2details
#160.30 s2details
#17ACCEPTED0.34 s2details
#180.33 s2details
#190.32 s2details
#20ACCEPTED0.29 s2details
#210.37 s3details
#220.39 s3details
#230.35 s3details
#240.42 s3details
#250.39 s3details
#260.36 s3details
#270.36 s3details
#280.35 s3details
#290.36 s3details
#300.36 s3details

Compiler report

input/code.cpp: In function 'int main(int, const char**)':
input/code.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     sd(x);
          ^

Code

#include<bits/stdc++.h>
#define pb push_back
#define ll long long int 
#define inf 1000500000
#define mod 1000000007
#define linf 1000000001000000000ll
#define mp make_pair
#define sd(a) scanf("%d",&a)
#define sd2(a,b) scanf("%d%d",&a,&b)
#define nax 200010
#define flu fflush(stdout)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int vis[nax*5*5];
vector< int > v[5*nax];
int main(int argc, char const *argv[])
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int x;
    sd(x);
    vis[1] = 1;
    queue< int > q;
    q.push(1);
    while(!q.empty())
    {
      int tt = q.front();
      q.pop();
      if(!vis[tt*2] && tt*2 <=1000000)
      {
        vis[tt*2] = 1;
        q.push(tt*2);
        v[tt*2] = v[tt];
        v[tt*2].pb(1);
      }
      if(!vis[tt+3] && tt+3 <= 1000000)
      {
        vis[tt+3] = 1;
        q.push(tt+3);
        v[tt+3] = v[tt];
        v[tt+3].pb(2);
      }
    } 
    if(vis[x])
    {
      printf("%d\n",(int)(v[x].size()));
      for (int i = 0; i < (int)v[x].size(); ++i)
      {
        if(v[x][i]==1)
          puts("MUL");
        else
          puts("ADD");
      }
      puts("END");
    }
    else
    {
      puts("0");
    }
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
58

correct output
8
MUL
ADD
MUL
ADD
...

user output
7
MUL
ADD
MUL
ADD
...

Test 2

Group: 1

Verdict: ACCEPTED

input
72

correct output
0

user output
0

Test 3

Group: 1

Verdict:

input
83

correct output
8
MUL
ADD
MUL
MUL
...

user output
7
MUL
ADD
MUL
MUL
...

Test 4

Group: 1

Verdict:

input
53

correct output
8
ADD
MUL
ADD
MUL
...

user output
7
ADD
MUL
ADD
MUL
...

Test 5

Group: 1

Verdict:

input
100

correct output
8
ADD
MUL
ADD
MUL
...

user output
7
ADD
MUL
ADD
MUL
...

Test 6

Group: 1

Verdict:

input
64

correct output
6
ADD
MUL
MUL
MUL
...

user output
5
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:

input
77

correct output
9
ADD
ADD
MUL
ADD
...

user output
8
ADD
ADD
MUL
ADD
...

Test 11

Group: 2

Verdict: ACCEPTED

input
941694

correct output
0

user output
0

Test 12

Group: 2

Verdict:

input
905674

correct output
30
MUL
ADD
MUL
ADD
...

user output
29
MUL
ADD
MUL
ADD
...

Test 13

Group: 2

Verdict:

input
908426

correct output
29
ADD
MUL
ADD
MUL
...

user output
28
ADD
MUL
ADD
MUL
...

Test 14

Group: 2

Verdict:

input
960500

correct output
31
ADD
ADD
MUL
MUL
...

user output
30
ADD
ADD
MUL
MUL
...

Test 15

Group: 2

Verdict:

input
902101

correct output
27
MUL
ADD
MUL
ADD
...

user output
26
MUL
ADD
MUL
ADD
...

Test 16

Group: 2

Verdict:

input
994208

correct output
27
ADD
ADD
MUL
MUL
...

user output
26
ADD
ADD
MUL
MUL
...

Test 17

Group: 2

Verdict: ACCEPTED

input
923538

correct output
0

user output
0

Test 18

Group: 2

Verdict:

input
950287

correct output
24
MUL
ADD
MUL
ADD
...

user output
23
MUL
ADD
MUL
ADD
...

Test 19

Group: 2

Verdict:

input
950516

correct output
29
ADD
ADD
MUL
MUL
...

user output
28
ADD
ADD
MUL
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)