题目:
Problem Description
假设:
S1 = 1
S2 = 12
S3 = 123
S4 = 1234
.........
S9 = 123456789
S10 = 1234567891
S11 = 12345678912
............
S18 = 123456789123456789
..................
现在我们把所有的串连接起来
S = 1121231234.......123456789123456789112345678912.........
那么你能告诉我在S串中的第N个数字是多少吗?
Input
输入首先是一个数字K,代表有K次询问。
接下来的K行每行有一个整数N(1 <= N < 2^31)。
Output
对于每个N,输出S中第N个对应的数字.
Sample Input
6
1
2
3
4
5
10
Sample Output
1
1
2
1
2
4
S1 = 1
S2 = 12
S3 = 123
S4 = 1234
.........
S9 = 123456789
S10 = 1234567891
S11 = 12345678912
............
S18 = 123456789123456789
..................
现在我们把所有的串连接起来
S = 1121231234.......123456789123456789112345678912.........
那么你能告诉我在S串中的第N个数字是多少吗?
接下来的K行每行有一个整数N(1 <= N < 2^31)。
6 1 2 3 4 5 10
1 1 2 1 2 4
思路:一开始看到每项的数的数目是一个等差数列,于是可以根据等差数列前k项和 (k)*(k+1)/2=n 来算出到第几项可以得到总共的n个数。当然算出来的k要向上取整因为n不会刚好是每项数的最后一个。然后算出k-1项共有多少个数,用sum=(k-1)*(k-1+1)/2.于是最后n-sum就是第n个数在第k项中的位数。最后注意要%9因为123456789后如果还有数字的话又是123456789.
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 100;
ll T,n,m;
int main()
{
scanf("%lld",&T);
while(T--)
{
scanf("%lld",&n);
ll ans=0;
ll nn=n;
double k=(sqrt(0.25+2.0*n)-0.5);
ll kk=(ll)ceil(k);
kk-=1;
ll sum=n-((kk)*(kk+1))/2;
if(sum%9)
printf("%d\n",sum%9);
else
printf("9\n");
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 100;
ll T,n,m;
int main()
{
scanf("%lld",&T);
while(T--)
{
scanf("%lld",&n);
ll ans=0;
ll nn=n;
double k=(sqrt(0.25+2.0*n)-0.5);
ll kk=(ll)ceil(k);
kk-=1;
ll sum=n-((kk)*(kk+1))/2;
if(sum%9)
printf("%d\n",sum%9);
else
printf("9\n");
}
return 0;
}