Task: | Kyselyt |
Sender: | Nanohenry |
Submission time: | 2017-10-02 22:35:37 +0300 |
Language: | C++ |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.08 s | 1 | details |
#2 | TIME LIMIT EXCEEDED | -- | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <cmath> #include <vector> using namespace std; int main() { int amount; cin >> amount; int a[amount]; for (int i = 0; i < amount; i++) { cin >> a[i]; } for (int i = 0; i < amount; i++) { int curNum = a[i]; int cur = 1; int number = 1; int index = 0; int j = 0; while (index < curNum) { // Loop until at asked index j = number; vector<int> digits; while (j >= 1) { // Go through all digits in j digits.push_back(j % 10); j = trunc(j / 10); } for (int z = digits.size() - 1; z >= 0; z--) { cur = digits[z]; index++; if (index >= curNum) { break; } } number++; } cout << cur << '\n'; } //while (1); return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
1000 582 214 723 273 ... |
correct output |
---|
0 1 7 7 6 ... |
user output |
---|
0 1 7 7 6 ... Truncated |
Test 2
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 615664 916441 627600 279508 ... |
correct output |
---|
1 2 3 2 2 ... |
user output |
---|
(empty) |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 672274832941907421 260504693279721732 646999966092970935 100853063389774434 ... |
correct output |
---|
7 2 2 0 9 ... |
user output |
---|
(empty) |