Cod sursa(job #2382394)
| Utilizator | Data | 18 martie 2019 11:54:13 | |
|---|---|---|---|
| Problema | GFact | Scor | 0 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <stdio.h>
#include <stdlib.h>
int d[100000000],e[100000000];
bool se_divide(long long n){
for(int i=0;i<ndp;i++){
if(putere(n,d[i])<e[i]*q){
return false;
}
}
return true;
}
long long cautb(){
long long r=0,pas=1LL<<45;
while(pas!=0){
if(!se_divide(r+pas)){
r+=pas;
}
pas/=2;
}
return 1+r;
}
int main(){
FILE *fin,*fout;
fin=fopen("gfact.in","r");
fout=fopen("gfact.out","w");
fscanf(fin,"%lld%lld",&p,&q);
if(q==1){
fprintf(fout,"%lld",p);
}else{
}
fclose(fin);
fclose(fout);
return 0;
}
