CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:stpn129
Submission time:2022-10-31 13:46:15 +0200
Language:C++11
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.01 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
#11ACCEPTED0.01 s3details
#12ACCEPTED0.01 s3details
#13ACCEPTED0.01 s3details
#14ACCEPTED0.02 s3details
#150.03 s3details
#160.03 s3details

Code

#include "bits/stdc++.h"
#define int long long

using namespace std;

void init_code() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
} 

int f(int num){
   if (num < 0){
      return 0;
   }
   if (num <= 1){
      return 1;
   }
   double d = 0;
   for (int i=2; i<=num; i++){
      d += log10(i);
   }
   return floor(d) + 1;
}

void solve() {
  vector<int> a(10);
  int n = 0;
  for (int i = 0; i < 10; ++i) {
    cin >> a[i];
    n += a[i];
  }
  if (n == 1) {
    if (a[2] == 1) cout << 2 << '\n';
    else cout << 3 << '\n';
  } else if (n == 3) {
    if (a[7]) cout << 6 << '\n';
    else cout << 5 << '\n';
  } else {
    int l = 1, r = 1e5 + 1, m;
    while (r - l > 1) {
      m = (r + l) / 2;
      if (f(m) < n) {
        l = m;
      } else {
        r = m;
      }
    }
    cout << r << '\n';
  }
}

signed main() {
  init_code();
  int t = 1;
  //cin >> t;
  while (t--) {
    solve();  
  }
  return 0;
}

/*


vector<pair<int, int>> moves = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
  int n, m;
  cin >> n >> m;

  char x;
  pair<int,int> sa, sb;

  vector<vector<int>> a(n, vector<int> (m));
  for (int i = 0; i < n; ++i){
     for (int j = 0; j < m; ++j) {
       cin >> x;
       if (x == '#') { 
        a[i][j] = 0;
       } else if (x == '.'){
        a[i][j] = 1;
       } else if (x == 'A'){
        a[i][j] = 2;
        sa = {i, j};
       } else if (x == 'B'){
        a[i][j] = 3;
        sb = {i, j};
       }
     }
  }
  vector<vector<int>> used(n, vector<int> (m));
  used[sa.first][sa.second] = 1; used[sb.first][sb.second] = 2;
  
  set<pair<int, int>> q;
  q.insert(sa);

  pair<int, int> v;
  
  vector<pair<int, int>> 
  while (!q.empty()) {
    v = *q.begin();
    q.erase(q.begin());
    for (auto mv : moves) {
        int x = v.first + mv.first, y = v.second + mv.second;
        if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 0) {
          used[x][y] = 1;
          q.insert({x, y});
        }
    }
  }

  q.insert(sb);
  while (!q.empty()) {
    v = *q.begin();
    q.erase(q.begin());
    for (auto mv : moves) {
        int x = v.first + mv.first, y = v.second + mv.second;
        if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 0) {
          used[x][y] = 2;
          q.insert({x, y});
        } else if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 1) {
          cout << 1 << '\n';
          return;
        }
    }
  }

  for (int i = 0; i < ; ++i) {
    
  }
*/

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

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
100001

Test 16

Group: 3

Verdict:

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
100001