Pagini recente » Cod sursa (job #1921825) | Cod sursa (job #2531857) | Cod sursa (job #1424136) | Cod sursa (job #2830376) | Cod sursa (job #2801253)
#include<iostream>
#include<fstream>
using namespace std;
int ciur[1000001], v[1000001][8], t, n, k;
int main()
{
freopen("divprim.in", "r", stdin);
freopen("divprim.out", "w", stdout);
ciur[1] = 1;
for(int i = 2; i <= 1000000; i++)
{
if(ciur[i] == 0)
{
for(int j = i; j <= 1000000; j = j + i)
{
ciur[j]++;
}
}
}
cin >> t;
for (int i = 1; i <= 1000000; i++)
{
for (int j = 1; j <= 7; j++)
{
v[i][j] = v[i - 1][j];
}
v[i][ciur[i]] = i;
}
for(int i = 1; i <= t; i++)
{
scanf("%d%d", &n,&k);
cout << v[n][k] << '\n';
}
}