Cod sursa(job #2927738)
Utilizator | Feraru Rares-Serban PsyDuck1914 | Data | 21 octombrie 2022 11:30:20 |
---|---|---|---|
Problema | Divizori Primi | Scor | 55 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("divprim.in");
ofstream g ("divprim.out");
const int NMAX = 1e6;
int v[NMAX+1];
int caut(int n, int k){
int j = n;
while(j >= 1){
if(v[j] == k)
return j;
j--;
}
return 0;
}
int main()
{
for(int i=2; i <= NMAX; i++)
if(!v[i])
for(int j = i; j<=NMAX; j+=i)
v[j]++;
int t;
f>>t;
for(int i=1; i<=t; i++){
int n, k;
f>>n>>k;
g<<caut(n, k)<<"\n";
}
return 0;
}