Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define MOD 666013
- using namespace std;
- class InParser
- {
- private:
- FILE *fin;
- char *buff;
- int sp;
- char read_ch()
- {
- ++sp;
- if(sp==4096)
- {
- sp=0;
- fread(buff,1,4096,fin);
- }
- return buff[sp];
- }
- public:
- InParser(const char* nume)
- {
- fin=fopen(nume,"r");
- buff=new char[4096]();
- sp=4095;
- }
- InParser& operator >> (int &n)
- {
- char c;
- while(!isdigit(c=read_ch())&&c!='-');
- int sgn=1;
- if (c=='-')
- {
- n=0;
- sgn=-1;
- }
- else
- {
- n=c-'0';
- }
- while(isdigit(c=read_ch()))
- {
- n=10*n+c-'0';
- }
- n*=sgn;
- return *this;
- }
- InParser& operator >> (long long &n)
- {
- char c;
- n=0;
- while(!isdigit(c=read_ch())&&c!='-');
- long long sgn=1;
- if(c=='-')
- {
- n=0;
- sgn=-1;
- }
- else
- {
- n=c-'0';
- }
- while(isdigit(c=read_ch()))
- {
- n=10*n+c-'0';
- }
- n*=sgn;
- return *this;
- }
- };
- class OutParser {
- private:
- FILE *fout;
- char *buff;
- int sp;
- void write_ch(char ch) {
- if (sp == 50000) {
- fwrite(buff, 1, 50000, fout);
- sp = 0;
- buff[sp++] = ch;
- } else {
- buff[sp++] = ch;
- }
- }
- public:
- OutParser(const char* name) {
- fout = fopen(name, "w");
- buff = new char[50000]();
- sp = 0;
- }
- ~OutParser() {
- fwrite(buff, 1, sp, fout);
- fclose(fout);
- }
- OutParser& operator << (int vu32) {
- if (vu32 <= 9) {
- write_ch(vu32 + '0');
- } else {
- (*this) << (vu32 / 10);
- write_ch(vu32 % 10 + '0');
- }
- return *this;
- }
- OutParser& operator << (long long vu64) {
- if (vu64 <= 9) {
- write_ch(vu64 + '0');
- } else {
- (*this) << (vu64 / 10);
- write_ch(vu64 % 10 + '0');
- }
- return *this;
- }
- OutParser& operator << (char ch) {
- write_ch(ch);
- return *this;
- }
- OutParser& operator << (const char *ch) {
- while (*ch) {
- write_ch(*ch);
- ++ch;
- }
- return *this;
- }
- };
- InParser fin("grexy.in");
- OutParser fout("grexy.out");
- int n, x;
- long long tot[100003], nup[100003];
- int main()
- {
- int i;
- tot[1]=26;
- tot[2]=26*26;
- nup[1]=0;
- nup[2]=650;
- for(i=3;i<=100000;++i)
- {
- if(i%2)
- nup[i]=(nup[i-1]*26)%MOD;
- else
- nup[i]=(tot[i/2]*(tot[i/2]-1))%MOD;
- tot[i]=(tot[i-1]*26)%MOD;
- }
- fin>>n;
- for(i=1; i<=n; ++i)
- {
- fin>>x;
- fout<<nup[x]<<'\n';
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment