#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define ll long long
ll quick(ll a,ll b,ll c)
{
ll ans=1;
a=a%c;
while(b>0)
{
if(b%2==1)
ans=(ans*a)%c;
b=b/2;
a=(a*a)%c;
}
return ans;
}
int main()
{
int T;
cin>>T;
while(T--)
{
ll x, y, k;
scanf("%lld%lld%lld",&x,&y,&k);
ll ans=(x%y*quick(10,k-1,y))%y;
printf("%lld\n",(10*ans)/y);
}
}
求整数n/m的第k位小数(高精度除法)
最新推荐文章于 2022-06-04 16:11:36 发布