Cod sursa(job #3323602)
| Utilizator | Data | 18 noiembrie 2025 20:56:30 | |
|---|---|---|---|
| Problema | Ciuperci | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciuperci.in");
ofstream fout ("ciuperci.out");
const int mod = 666013;
int n;
int nr_noduri;
int modalitati(int n){
if(n == 0){
return 1;
}
if((n - 1) % 2 == 0){
return modalitati((n-1)/2) * modalitati((n-1)/2) % mod;
}
return 2 * modalitati((n-1)/2) % mod * modalitati((n-1)/2 + 1) % mod;
}
int main(){
fin >> n;
for(int i = 1; i <= n; i++){
fin >> nr_noduri;
fout << modalitati(nr_noduri) <<'\n';
}
return 0;
}
