Cod sursa(job #2247626)
Utilizator | Data | 28 septembrie 2018 21:01:41 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
using namespace std;
const int VM = 1000001;
int v[VM];
int main()
{
for (int i = 2; i < VM; i++) {
if (v[i] == 0) {
for (int j = i; j < VM; j+= i) {
v[j]++;
}
}
}
int t, n, k;
cin >> t;
for (int i = 0; i < t; i++)
{
cin >> n >> k;
v[0] = k;
int j = n;
while (v[j] != k)
{
j--;
}
cout << j;
}
return 0;
}