用高精度模板,要不然会超时
C++ 代码
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int co;
vector<int> num,c;
//高精度除法模板
int div(vector<int> &num,int n)
{
c.clear(); //由于每一次都要对商进行运算,所以每次一开始要清空c
int t=0;
for(int i=num.size()-1;i>=0;i--)
{
t=10*t+num[i];
c.push_back(t/n);
t%=n;
}
reverse(c.begin(),c.end());
while(c.size()>1 && c.back()==0) c.pop_back();
return t;
}
int main()
{
int n; cin>>n;
while(1)
{
num.push_back(1);
int r = div(num,n);
if(!r)
{
for(int i=c.size()-1;i>=0;i--) cout<<c[i];
cout<<" "<<num.size();
break;
}
}
return 0;
}