Cod sursa(job #1863853)
Utilizator | Data | 31 ianuarie 2017 11:53:37 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("divprim.in");
ofstream out("divprim.out");
vector <int> a[8];
const int N=1000000;
char c[N];
int main()
{
int t,n,k;
for(i=2; i<=n; i++)
if(c[i]==0)
for(j=i; j<=n; j+=i)
++c[j];
for(i=1; i<N; i++)
{
a[c[i]].push-back(i);
}
in>>t;
for(int i=1; i<=t; i++)
{
in>>n>>k;
out<<caut(n,a[k]);
}
return 0;
}