Cod sursa(job #2402663)
| Utilizator | Data | 10 aprilie 2019 21:42:34 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("divprim.in");
ofstream out("divprim.out");
int j,n,k,t,i;
int v[1000001], a[1000001][8];///pe 2 dimensiuni bai raresik :))))))))
void ciur()
{
for(i=2; i<=1000001; i++)
{
if(v[i]==0)
for(j=i; j<=1000001; j+=i)
v[j]++;
a[i][v[i]]=i;
}
for(j=1; j<=7; j++)
for(i=1; i<=1000001; i++)
if(a[i][j]==0)
a[i][j]=a[i-1][j];
}
int main()
{
ciur();
in>>t;
for(i=1;i<=t;i++)
{
in>>n>>k;
out<<a[n][k]<<'\n';
}
return 0;
}
