Cod sursa(job #635875)
Utilizator | Data | 19 noiembrie 2011 15:22:41 | |
---|---|---|---|
Problema | Ciuperci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | .com 2011 | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("ciuperci.in");
ofstream out("ciuperci.out");
int x,q;
long long ciuperci(int a){
if(a==1)
return 1;
int st,dr;
st=a/2;
dr=a-st;
if(st==dr){
return (2*ciuperci(st))%666013;
}
return (ciuperci(st)%666013)*(ciuperci(dr)%666013)%666013;
}
int main(){
in>>q;
for(int i=1;i<=q;++i){
in>>x;
out<<ciuperci(x)%666013<<"\n";
}
return 0;
}