Pagini recente » Cod sursa (job #2208174) | Cod sursa (job #1287771) | Cod sursa (job #1871019) | Cod sursa (job #1208412) | Cod sursa (job #1035216)
#include <fstream>
#include <algorithm>
#include <string>
#include <bitset>
using namespace std;
#define Nmax 276997
#define Pmax 10000
using namespace std;
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
int Q,sol;
long long N;
string tmp;
int Putere[]={0,0,62,39,0,28,0,23,0,0,0,19};
int main()
{
for(int i=1;i<=Nmax;++i)
{
getline(f,tmp);
long long N=0;
for(int i=0;i<tmp.size();++i)N=N*10+(tmp[i]-'0');
}
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;
}