Cod sursa(job #3163971)
| Utilizator | Data | 1 noiembrie 2023 19:53:11 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
int t,n,k;
int ciur[1000005]
int nrdiv[1000005]
int a[8][1000005];
int main()
{
int i,j,poz=0;
for(i=2;i<=1000000;i++)
{
if(ciur[i]==0)
{
for(j=i;j<=1000000;j+=i)
{
nrdiv[j]++;
ciur[j]=1;
}
}
}
for(k=0;k<8;k++)
{
poz=0;
for(i=1;i<=1000000;i++)
{
if(nrdiv[i]==k) poz=i;
a[k][i]=poz;
}
}
fin>>t;
for(i=1;i<=t;i++)
{
fin>>n>>k;
fout<<a[k][n]<<"\n";
}
return 0;
}
