Task: | Kertoma |
Sender: | nmjuko |
Submission time: | 2022-11-05 16:49:49 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 46 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 22 |
#2 | ACCEPTED | 24 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#7 | ACCEPTED | 0.00 s | 2, 3 | details |
#8 | ACCEPTED | 0.00 s | 2, 3 | details |
#9 | ACCEPTED | 0.00 s | 2, 3 | details |
#10 | ACCEPTED | 0.00 s | 2, 3 | details |
#11 | ACCEPTED | 0.21 s | 3 | details |
#12 | ACCEPTED | 0.49 s | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result] 40 | 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; vector<int> countAppearance(int factor, vector<int> digits){ //int length = digits.size(); // Initialize carry long int carry = 0; // One by one multiply n with // individual digits of res[] for(unsigned long int i = 0; i < digits.size(); i++) { long int result = digits[i] * factor + carry; // Store last digit of 'prod' in res[] digits[i] = result % 10; // Put rest in carry carry = result / 10; } // Put carry in res and increase result size while (carry) { digits.push_back(carry % 10); carry = carry / 10; } return digits; } int main(){ //int input[] = {1, 1, 1, 0, 0, 0, 0, 0, 0, 0}; //int input[] = {42,25,24,16,15,16,21,14,17,16}; int 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); //auto start = high_resolution_clock::now(); int input[] = {zero, first, two, three, four, five, six, seven, eight, nine}; unsigned int length = zero + first + two + three + four + five + six + seven + eight + nine; vector<int> digits = {1}; bool found = false; int n = 2; int fingerprint[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; do{ for(int i = 0; i <= 9; i++) fingerprint[i] = 0; digits = countAppearance(n, digits); n += 1; if(digits.size() == length){ for (unsigned int j = 0 ; j<digits.size() ; j++){ fingerprint[digits[j]] += 1; } 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 |
---|
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: TIME LIMIT EXCEEDED
input |
---|
20097 12282 12229 12214 12406 ... |
correct output |
---|
32001 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
47934 29918 29878 29713 29984 ... |
correct output |
---|
71718 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
84691 54156 54277 54533 54296 ... |
correct output |
---|
123123 |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
99098 63339 63878 64182 63904 ... |
correct output |
---|
142663 |
user output |
---|
(empty) |