Pagini recente » Cod sursa (job #718401) | Cod sursa (job #2847521) | Cod sursa (job #1809952) | Cod sursa (job #252932) | Cod sursa (job #2665333)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
const int NMAX = 1000000;
int v[NMAX + 1];
int A[NMAX + 1][8];
void ciur()
{
for(int i = 2; i <= NMAX; i += 2)
v[i] = 1;
for(int i = 3; i * i <= NMAX; i++)
if(v[i] == 0)
for(int j = i; j <= NMAX; j += i)
v[j]++;
for(int i = 2; i <= NMAX; i++)
if(v[i] == 0)
for(int j = i; j <= NMAX; j += i)
v[j]++;
}
int main()
{
ciur();
for(int i = 2; i <= NMAX; i++)
{
for(int j = 1; j <= 7; j++)
A[i][j] = A[i - 1][j];
A[i][v[i]] = i;
}
int T, n, k;
f >> T;
while(T--)
{
f >> n >> k;
g << A[n][k] << '\n';
}
return 0;
}