CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:nmjuko
Submission time:2022-11-05 22:49:51 +0200
Language:C++ (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.00 s1, 2, 3details
#4ACCEPTED0.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.02 s3details
#12ACCEPTED0.05 s3details
#13ACCEPTED0.78 s3details
#14--3details
#15--3details
#16--3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     scanf("%d %d %d %d %d %d %d %d %d %d" , &zero, &first, &two, &three, &four, &five, &six, &seven, &eight, &nine);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include<stdio.h>
#include<iostream>
#include<cstring>
#include<math.h>
#include<chrono>
#include<vector>
using namespace std;
using namespace std::chrono;
#define DIVISOR 1000000000
vector<uint32_t> multiplyLargeNumber(uint32_t factor, vector<uint32_t> digits) {
// Initialize carry
uint64_t carry = 0;
// One by one multiply n with
// individual digits of res[]
for(unsigned long int i = 0; i < digits.size(); i++) {
uint64_t result = (uint64_t)digits[i] * (uint64_t)factor;
result += carry;
// Store last digit of 'prod' in res[]
digits[i] = result % DIVISOR;
// Put rest in carry
carry = (result / DIVISOR);
}
// Put carry in res and increase result size
while (carry) {
digits.push_back(carry % DIVISOR);
carry = (carry / DIVISOR);
}
return digits;
}
vector<uint32_t> analyzeLargeNumber(vector<uint32_t> digits) {
vector<uint32_t> fingerprint(10, 0);
uint32_t q = 1;
uint32_t k = 0;
for(unsigned int j = 0; j < digits.size() - 1; j++){
k = digits[j];
for(q = DIVISOR / 10; q > 0; q /= 10) {
fingerprint[k / q] += 1;
k %= q;
}
}
k = digits[digits.size() - 1];
q = DIVISOR / 10;
// skip leading zeros
while(k < q) q /= 10;
for(; q > 0; q /= 10) {
fingerprint[k / q] += 1;
k %= q;
}
return fingerprint;
}
int main(){
//uint32_t input[] = {42,25,24,16,15,16,21,14,17,16};
uint32_t zero, first, two, three, four, five, six, seven, eight, nine;
scanf("%d %d %d %d %d %d %d %d %d %d" , &zero, &first, &two, &three, &four, &five, &six, &seven, &eight, &nine);
uint32_t input[] = {zero, first, two, three, four, five, six, seven, eight, nine};
//auto start = high_resolution_clock::now();
vector<uint32_t> digits = {1};
unsigned int length = 0;
for(int i = 0; i < 10; i++)
length += input[i];
length /= log10(DIVISOR);
bool found = false;
uint32_t n = 2;
vector<uint32_t> fingerprint(10,0);
do{
digits = multiplyLargeNumber(n, digits);
n += 1;
if(digits.size() >= length){
fingerprint = analyzeLargeNumber(digits);
found = true;
for(int i = 0; i <= 9; i++){
found &= (fingerprint[i] == input[i]);
}
}
}
while(!found);
printf("%d \n", n-1);
// auto stop = high_resolution_clock::now();
// auto duration = duration_cast<microseconds>(stop - start);
// cout << "Time taken by function: "
// << duration.count() << " microseconds" << 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

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 1 0 0 0 0 0

correct output
4

user output

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:

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)