Pagini recente » Istoria paginii runda/oni2007_clasa10 | Cod sursa (job #86438) | Cod sursa (job #1703475) | Cod sursa (job #1971218) | Cod sursa (job #1035193)
#include <fstream>
#include <algorithm>
#include <string>
using namespace std;
#define Nmax 276997
using namespace std;
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
int Q,sol;
long long N,x;
string tmp;
int Putere[]={0,0,62,39,0,28,0,23,0,0,0,19};
unsigned long long Pow[20][100];
int main()
{
for(int i=2;i<=11;++i)
{
long long P=1;
Pow[i][0]=1;
for(int j=1;j<=Putere[i];++j)P*=i,Pow[i][j]=P;
}
for(int i=1;i<=Nmax;++i)getline(f,tmp);
getline(f,tmp);
Q=0;
for(int i=0;i<tmp.size();++i)Q=Q*10+(tmp[i]-'0');
for(int i=1;i<=Q;++i)
{
getline(f,tmp);
long long N=0;
for(int i=0;i<tmp.size();++i)N=N*10+(tmp[i]-'0');
}
g<<sol<<'\n';
f.close();g.close();
return 0;
}