Task: | Kyselyt |
Sender: | suola_makkara |
Submission time: | 2017-10-02 20:21:59 +0300 |
Language: | C++ |
Status: | READY |
Result: | 37 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 25 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.03 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 2 | details |
#3 | WRONG ANSWER | 0.05 s | 3 | details |
Code
#include <iostream> #include <string> using namespace std; int pow(int a, int b) { if (b == 0) return 1; int t = a; for (int i = 1; i < b; i++) t *= a; return t; } int nums(int n) { if (n == 0) return 0; else if (n == 1) return 9; else return ((pow(10, n) - 1) - (pow(10, n - 1) - 1)) * n + nums(n - 1); } char at(int x) { int i = 0; while (x - nums(i) > 0) i++; x -= nums(i - 1); int p = x - 1; x = p / i; x += pow(10, i - 1); string n = to_string(x); return n[p % i]; } int main() { int q; cin >> q; for (int i = 0; i < q; i++) { int x; cin >> x; cout << at(x) << '\n'; } 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: ACCEPTED
input |
---|
1000 615664 916441 627600 279508 ... |
correct output |
---|
1 2 3 2 2 ... |
user output |
---|
1 2 3 2 2 ... Truncated |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
1000 672274832941907421 260504693279721732 646999966092970935 100853063389774434 ... |
correct output |
---|
7 2 2 0 9 ... |
user output |
---|
7 7 7 7 7 ... Truncated |