Cod sursa(job #40868)
Utilizator | Emanuel Cinca c_e_manu | Data | 27 martie 2007 20:06:02 |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream.h>
long ok,t,n,div[10]={2,3,5,7,11,13,17,19,23,29},j,x,i,k,aux;
int main()
{ ifstream f("divprim.in");
ofstream g("divprim.out");
f>>t;
for(i=1;i<=t;i++)
{ f>>n>>k;aux=k;
for(x=n-1;x!=0;x--)
{ aux=k;
for(j=0;j<10;j++)
{ if(x%div[j]==0&&x!=div[j]) aux--;
if(!(aux>=1)) break;
}
if(!(aux>=1)) break;
}
if(aux>=0)g<<x<<'\n';
else g<<0<<'\n';
}
f.close();
g.close();
return 0;
}