Răspuns:
#include <iostream>
using namespace std;
int rasturnat(int n){
int rs = 0;
while (n) {
rs = rs * 10 + n % 10;
n /= 10;
}
return rs;
}
int main(){
int a[1000000];
int k;
int i = 1;
int n = 0;
cout << "k=";
cin >> k;
while (n < k*2){
int nr = rasturnat(i);
if (i % 10 != 0){
while (nr){
a[n] = nr % 10;
n++;
nr /= 10;
}
} else {
int m = 0;
int num = i;
while (nr){
a[n] = nr % 10;
n++;
nr /= 10;
}
while (num % 10 == 0){
m++;
num /= 10;
}
int f = 0;
while (f < m){
a[n] = 0;
n++;
f++;
}
}
i++;
}
cout << "Cifra de pe pozitia " << k << " este " << a[k-1] << endl;
return 0;
}
Explicație:
