#include <iostream> #include <math.h> #include <vector> #include <map> #include <sstream> using namespace std; struct NODE{ int cnt; //map<int,int> freq; vector<int> num; int freq[35]; }node[33000]; int prime[33000]; vector<int> v; stringstream s; int _pow(int a,int p) { if(p==0) return 1; return a*_pow(a,p-1); } int factorize() { int tmp,index; int prev=-1; int counter=0; for(int i=3;i<33000;i++) { prev=-1; counter=0;
Category: Prime
884
#include <iostream> #include <vector> #include <math.h> #include <fstream> #include <cstdlib> #define SIZE 1000005 using namespace std; int arr[1000005]; int prime[1000005]; vector<int> v; int main() { int n; /*prime[2]=0; arr[2]=0; for(int i=3;i<SIZE;i++) { arr[i]=0; if(i%2==0) prime[i]=1; else prime[i]=0; } */ double p=sqrt(SIZE); for(int i=3;i<(p+5);i+=2) { if(prime[i]==0) { for(int j=i+i;j<SIZE;j+=i) { prime[j]=1; } } } v.push_back(2);// for(int