Cod sursa(job #1938369)
Utilizator | Ille Antoniu Nicolae Tonison | Data | 24 martie 2017 19:38:40 |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
#define MX 1000005
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int prim[MX][9], pr[MX];
int main()
{
int n,x,y;
f>>n;
//vector<vector<int> > prim(MX+5, vector<int>(9,0));
//int prim[MX][9];
for(int i=2; i<=MX; ++i){
if(pr[i]==0){
for(int j=i; j<=MX; j+=i){
pr[j]++;
}
}
}
for(int i=2; i<=MX; ++i){
for(int j=0; j<8; ++j){
if(pr[i]==j) prim[i][j]=i;
else prim[i][j]=prim[i-1][j];
}
}
while(n--){
f>>x>>y;
g<<prim[x][y]<<"\n";
}
return 0;
}