Cod sursa(job #1862909)

Utilizator caesar2001Stoica Alexandru caesar2001 Data 30 ianuarie 2017 14:07:57
Problema Divizori Primi Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.62 kb
#include <cstdio>
#include <vector>

FILE *in,*out;

using namespace std;

int c[1000001];

vector <int> a[8];

int cauta(int k)
{
    int
}

int main()
{
    in  = fopen("divprimi.in","r");
    out = fopen("divprimi.out","w");
    int t,n,k;
    for(int i =2 ; i <= 1000000; i ++)
    {
        if(c[i] == 0)
        {
            for(int j = i*2; j <= 1000000; j += i)
            {
                c[j] ++;
            }
        }
    }
    for(int i = 1;i <= 1000000;i ++)
    {
        a[c[i]].push_back(i);
    }
    fscanf(in,"%d",&t);
    for(int i = 1;i <= n;i ++)
    {
        fscanf(in,"%d %d",&n,&k);
    }

    return 0;
}