Cod sursa(job #2443944)
Utilizator | Pasare Vladut vladutflavius | Data | 29 iulie 2019 20:05:32 |
---|---|---|---|
Problema | Divizori Primi | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int T,n,k,i,j,d,x,u,p,t;
ifstream f("divprim.in");
ofstream g("divprim.out");
f>>T;
for(i=1;i<=T;i++){
f>>n>>k;
for(j=n;j>=1;j--){
x=j;p=2;u=0;t=0;
while(p<=x){
if(x%p==0){u++;
while(x%p==0)
x/=p;}
p++;}
if(u==k){g<<j<<'\n';t=1;break;}}
if(t==0)g<<"0"<<'\n';}
}