Pagini recente » Cod sursa (job #2036125) | Cod sursa (job #1795268) | Cod sursa (job #3196701) | Cod sursa (job #2706289) | Cod sursa (job #2385355)
#include <fstream>
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
int ciur[1000001], matrix[8][1000001];
int main()
{
int x = 2;
ciur[0] = ciur[1] = 0;
while (x < 1000001)
{
if (ciur[x] == 0)
{
int y = x + x;
while (y < 1000001)
{
ciur[y]++;
y+= x;
}
}
for (int i = 1; i < 8; i++)
{
matrix[i][x] = matrix[i][x - 1];
}
if (ciur[x] <= 7)
{
matrix[ciur[x]][x] = x;
}
x++;
}
int n, k, m;
fin >> m;
for (int i = 0; i < m; i++)
{
fin >> n >> k;
fout << matrix[k][n] << "\n";
}
return 0;
}