CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:MV
Submission time:2022-11-13 20:57:14 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#20.00 s1, 2, 3details
#30.00 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s2, 3details
#8ACCEPTED0.01 s2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details

Code

#include <iostream>
#include <string.h>
#include<algorithm>
#include <vector>
using namespace std;
#define MAX 1000000
int WWWWW;
int multiply(int x, int res[], int res_size);
void factorial(int n)
{
    int res[MAX]; res[0] = 1;    int res_size = 1;

    for (int x = 2; x <= n; x++)
        res_size = multiply(x, res, res_size);
    vector<int> v;
    for (int i = res_size - 1; i >= 0; i--)
    v.push_back(res[i]);
    WWWWW=v.size();
}


int multiply(int x, int res[], int res_size) {
    int carry = 0;
 
    for (int i = 0; i < res_size; i++) {
        int prod = res[i] * x + carry;
        res[i] = prod % 10;        carry = prod / 10;
    }
 
    while (carry) {
        res[res_size] = carry % 10;
        carry /=10;
        res_size++;
    }
    return res_size;    }



int main()
{
    int o;    int x=0;
    for ( int TAK=0;TAK<10;TAK++) {cin >> o; x+=o; }
    int n;
            long c=10;
            long zzz;
            if (x>5565708) {zzz=1000000;}
            else if (x>456574) {zzz=100000;}
            else if (x>35660) {zzz=10000;}
            else if (x>2568) {zzz=1000;}
            else if (x>158) {zzz=100;}
            else if (x>7) {zzz=10;}
            else zzz=2;
            long p=zzz;
                for (n=zzz; x>p ;n+=zzz/c) {
                    if (zzz==2) zzz=10;
        factorial(n);
        p=WWWWW; 
        if (x<p) {
            p=1;
            n-=zzz/c; 
            c*=10;}     }
            n-=zzz/c;   cout <<n;       }

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 0 0 0 0 0 0

correct output
2

user output
2

Test 2

Group: 1, 2, 3

Verdict:

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output
2

Test 3

Group: 1, 2, 3

Verdict:

input
0 0 1 0 1 0 0 0 0 0

correct output
4

user output
2

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
2 0 1 1 0 0 1 0 2 0

correct output
10

user output
10

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
9 3 1 1 2 2 3 1 6 1

correct output
27

user output
27

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
10 4 3 4 3 2 2 4 3 7

correct output
36

user output
36

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
71 53 36 30 25 29 42 24 34 29

correct output
199

user output
199

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
71 33 46 38 27 45 36 21 35 35

correct output
205

user output
205

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
93 38 35 26 43 54 38 25 41 34

correct output
222

user output
222

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
100 33 33 45 36 43 38 54 56 36

correct output
242

user output
242

Test 11

Group: 3

Verdict:

input
3419 1797 1845 1849 1879 1791 ...

correct output
5959

user output
(empty)

Test 12

Group: 3

Verdict:

input
4776 2695 2709 2781 2616 2753 ...

correct output
8391

user output
(empty)

Test 13

Group: 3

Verdict:

input
20097 12282 12229 12214 12406 ...

correct output
32001

user output
(empty)

Test 14

Group: 3

Verdict:

input
47934 29918 29878 29713 29984 ...

correct output
71718

user output
(empty)

Test 15

Group: 3

Verdict:

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
(empty)

Test 16

Group: 3

Verdict:

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
(empty)