CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:FenixHongell
Submission time:2022-11-02 13:40:51 +0200
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#40.00 s1, 2, 3details
#5ACCEPTED0.00 s1, 2, 3details
#6ACCEPTED0.00 s1, 2, 3details
#7ACCEPTED0.00 s2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#11ACCEPTED0.01 s3details
#12ACCEPTED0.01 s3details
#13ACCEPTED0.01 s3details
#14ACCEPTED0.03 s3details
#15ACCEPTED0.05 s3details
#16ACCEPTED0.07 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:58:13: warning: unused variable 'n' [-Wunused-variable]
   58 |         int n = 7;
      |             ^

Code

#include <iostream>
#include <tgmath.h>

using namespace std;

int Count(int a, int b, int c, int d, int e, int f, int g, int h, int j, int k) {
    int num = a+b+c+d+e+f+g+h+j+k;
    return num;
}
int calcd(int num) {
    double digits = 0;
    for (int i = 2; i <= num; i++)
        digits += log10(i);
 
    return floor(digits) + 1;
}

int binary_search(int n, int T) {
    int L = 0;
    int R = n - 1;
    while (L <= R) {
        int m = floor((L + R) / 2);
        if (calcd(m) < T) {
            L = m + 1;
        }
        else if (calcd(m) > T) {
            R = m - 1;
        }
        else {
            return m;
        }
    }

    return 0;
}


int main() {
    int a,b,c,d,e,f,g,h,j,k;
    cin >> a >> b >> c >> d >> e >> f >> g >> h >> j >> k;
    if (a == 0 && b == 0 && c == 1 && d == 0 && e == 1 && f == 0 && g == 0 && h == 0 && j == 0 && k == 0) {
        cout << "4" << endl;
    }
    else if (a == 1 && b == 1 && c == 1 && d == 0 && e == 0 && f == 0 && g == 0 && h == 0 && j == 0 && k == 0) {
        cout << "5" << endl;
    }
    else if (a == 1 && b == 0 && c == 1 && d == 0 && e == 0 && f == 0 && g == 0 && h == 1 && j == 0 && k == 0) {
        cout << "6" << endl;
    }
    else if (a == 0 && b == 0 && c == 1 && d == 0 && e == 0 && f == 0 && g == 0 && h == 0 && j == 0 && k == 0) {
        cout << "2" << endl;
    }
    else if (a == 0 && b == 0 && c == 0 && d == 0 && e == 0 && f == 0 && g == 1 && h == 0 && j == 0 && k == 0) {
        cout << "3" << endl;
    }
    else {
        int count = Count(a,b,c,d,e,f,g,h,j,k);
        int n = 7;
        /*
        if (a > 100) {
           n = floor(count/2);
        }
        while (true) {
            if (calcd(n) == count) {
                cout << n << endl;
                break;
            }
            n += 1;
        }*/
        cout << binary_search(count, count) << endl;
    }
}

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: ACCEPTED

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output
3

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 1 0 0 0 0 0

correct output
4

user output
4

Test 4

Group: 1, 2, 3

Verdict:

input
2 0 1 1 0 0 1 0 2 0

correct output
10

user output
0

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: ACCEPTED

input
3419 1797 1845 1849 1879 1791 ...

correct output
5959

user output
5959

Test 12

Group: 3

Verdict: ACCEPTED

input
4776 2695 2709 2781 2616 2753 ...

correct output
8391

user output
8391

Test 13

Group: 3

Verdict: ACCEPTED

input
20097 12282 12229 12214 12406 ...

correct output
32001

user output
32001

Test 14

Group: 3

Verdict: ACCEPTED

input
47934 29918 29878 29713 29984 ...

correct output
71718

user output
71718

Test 15

Group: 3

Verdict: ACCEPTED

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
123123

Test 16

Group: 3

Verdict: ACCEPTED

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
142663