Cod sursa(job #2248949)
| Utilizator | Data | 29 septembrie 2018 13:54:34 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int nrdivprimi(int n){
int d=2,nr=0;
while (n!=1)
{
if(n%d==0){ nr++;
while(n%d==0) n/=d;
} else d++;
}
return nr;
}
int main()
{
ifstream f("divprim.in");
ofstream g("divprim.out");
int t,n,k;
f>>t;
for(int i=0;i<t;i++){
f>>n>>k;
while(n!=0){
if(k==nrdivprimi(n))
{g<<n<<endl;break;}
else{
n--;
}
if(n==0) g<<0<<endl;
}}
f.close();
g.close();
return 0;
}
