Cod sursa(job #2793098)
| Utilizator | Data | 2 noiembrie 2021 21:12:06 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int ciur[1000005], mat[1000000][7],j,i,t,n,k;
int main()
{
ifstream cin("divprim.in");
ofstream cout("divprim.out");
ciur[1]=1;
for(int i=2; i<=1000000; i++)
{
if(ciur[i]==0)
{
for(int j=i+i; j<=1000000; j+=i)
{
ciur[j]++;
}
}
}
for(i=2; i<=1000000; i++)
{
for(j=1; j<=7; j++)
{
mat[i][j]=mat[i-1][j];
}
mat[i][ciur[i]]=i;
}
cin>>t;
for(i=1; i<=t; i++)
{
cin>>n>>k;
cout<<mat[n][k]<<endl;
}
return 0;
}
