Task: | Kyselyt |
Sender: | 1 |
Submission time: | 2017-10-08 10:59:53 +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.04 s | 1 | details |
#2 | ACCEPTED | 0.03 s | 2 | details |
#3 | WRONG ANSWER | 0.06 s | 3 | details |
Code
#include <iostream> #include <string> #include <cmath> #include <vector> //#include <set> using namespace std; //typedef unsigned long ul; typedef unsigned long long ull; ull cms(int mag) { //calculate magnitude size ull c = 0; for (int i = 1; i <= mag; i++) { c += (pow(10, i) - pow(10, i -1)) * i; } return c; } int get_mag(ull n) { ull c = 0; int i = 1; while (c < n) { c += (pow(10, i) - pow(10, i - 1)) * i; i += 1; } return i - 1; } char locate_digit(ull n) { int mag = get_mag(n); n -= cms(mag - 1); n -= 1; ull i = pow(10, mag - 1) + n / mag; string str = to_string(i); //cout << " | n: " << n%mag << " | i: " << i << " | ans: " << str[(n) % mag] << endl; return str[(n) % mag]; } int main(int argc, const char * argv[]) { /*for (int i = 1; i <= 1000; i++) { locate_digit(i); //cout << locate_digit(i) << endl; }*/ int num; ull x; cin >> num; vector <ull> vec = {}; for (int i = 0; i < num; i++) { cin >> x; vec.push_back(x); } for (int i = 0; i < num; i++) { cout << locate_digit(vec[i]) - '0' << endl; } 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 |
---|
8 0 4 6 9 ... Truncated |