Pagini recente » Cod sursa (job #1761859) | Cod sursa (job #711982) | Cod sursa (job #1374807) | Cod sursa (job #2028382) | Cod sursa (job #40851)
Cod sursa(job #40851)
#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;
}