Cod sursa(job #1415901)

Utilizator demetriad-dagpagDavid Demetriad demetriad-dagpag Data 6 aprilie 2015 20:29:59
Problema Divizori Primi Scor 75
Compilator c Status done
Runda Arhiva de probleme Marime 0.61 kb
#include <stdio.h>
#include <stdlib.h>
#define NR 1000000
int ciur[NR+1];
int a[NR+1][10];
int main()
{
    int i,j,n,k,t;
    freopen("divprim.in","r",stdin);
    freopen("divprim.out","w",stdout);
    for(i=2; i*i<=NR; i++)
        if(ciur[i]==0)
            for(j=i; j<=NR; j+=i)
                ciur[j]++;
    a[1][0]=1;
    for(i=2; i<=NR; i++)
    {
        for(j=1; j<8; j++)
            a[i][j]=a[i-1][j];
        a[i][ciur[i]]=i;
        a[i][0]=1;
    }
    scanf("%d",&t);
    for(i=1; i<=t; i++)
    {
        scanf("%d%d",&n,&k);
        printf("%d\n",a[n][k]);
    }

    return 0;
}