Category: Factors

#include <cstring>

#include <stdio.h>

#include <fstream>

#define ull unsigned long long

using namespace std;

 

int factorcount[10001][1230];

vector<int> v;

 

{

 

 

{

for(int j=i*i;j<10001;j+=i)

}

for(int i=3;i<10001;i+=2)

if(prime[i]==0)

}

}

void factorize()

for(int i=2;i<10001;i++)

int tmp=i;

while(tmp>1)

if(tmp%v[j]==0)

factorcount[i][j]++;

tmp/=v[j];

 

j++;

break;

for(int k=0;k<1230;k++)

 

}

int main()

primegenerator();

int t,m,n;

cin>>t;

{

kase+=1;

{

cout<<"Impossible to divide\n";

}

double min_d=2e9;

{

{

break;

else if(factor[m][i] && factorcount[n][i] && factorcount[n][i]/factor[m][i] <min_d)

min_d = factorcount[n][i]/factor[m][i];

}

if(imposbl==1)

cout<<"Impossible to divide\n";

else

cout<<min_d<<"\n";

 

 

return 0;

#include <string>

#include <math.h>

#define SZ 20000001

using namespace std;

int prime[SZ];

 

int x;

}twinPrime[108001];

void primegen()

double p = sqrt(SZ);

for(int i=3;i<p;i+=2)

if(prime[i]==0)

for(int j=i*i;j<SZ;j+=i)

}

 

int cnt=0;

{

{

int t=v.size();

{

twinPrime[cnt].y = v[t-1];

}

}

 

int main()

primegen();

int n;

while(cin>>n)

cout<<"("<<twinPrime[n-1].x<<", "<<twinPrime[n-1].y<<")\n";

return 0;

#include <cstring>

#include <stdio.h>

 

#define max(a,b) a>=b?a:b

using namespace std;

int ans[200];

vector<int> v;

 

{

 

 

{

for(int j=i*2;j<1001;j+=i)

}

for(int i=3;i<1001;i+=2)

if(prime[i]==0)

}

}

int main()

string s;

int t,cnt,num;

_MAX = 1000000000;

primegenerator();

cin>>t;

while(t--)

cin>>s;

num=0;

memset(ans,0,sizeof(ans));

{

cnt++;

{

num+=(s[i]-'0');

}

cout<<"Case "<<kase++<<": ";

while(num>1)

int tmp=num;

while(tmp>1)

if(tmp%v[j]==0)

tmp/=v[j];

//_max=max(j,_max);

}

j++;

num-=cnt;

 

int f=1;

{

res*=(ans[i]+1);

{

break;

}

cout<<res<<"\n";

cout<<"Infinity\n";

return 0;

#include <math.h>

 

#define SIZE 2703664

 

ull factor[SIZE];

vector<int> v;

void primeGenerator()

double p = sqrt(1700);

{

{

prime[j]=1;

}

v.push_back(2);

for(int i=3;i<1700;i+=2)

if(prime[i]==0)

}

 

void countfactor()

int tmp;

 

 

 

for(int i=3;i<SIZE;i++)

tmp = i;

factor[i]=0;

{

{

factor[i]++;

}

 

break;

}

factor[i]++;

factor[i]+=factor[i-1];

 

 

 

{

countfactor();

ull low,mid,high;

int t;

while(t--)

cin>>n;

mid=SIZE/2;

ans = 0;

{

continue;

while((high-low)>1)

if(factor[mid]<=n)

low=mid;

//ans=high;

else

high=mid;

//ans=low;

}

if(factor[mid+1]>n && factor[mid]<=n)

arr[n]=mid+1;

cout<<arr[n]<<"\n";

 

}

#include <string>

#include <math.h>

#include <stdlib.h>

#define SIZE 2800001

 

 

ull arr [SIZE];//[10000001+5];

 

{

for(int i=3;i<p;i+=2)

for(int j=i+i;j<1700;j+=i)

prime[j]=1;

}

v.push_back(2);

for(int i=3;i<1700;i++)

if(prime[i]==0 && i%2!=0)

v.push_back(i);

}

 

{

arr[0]=1;

arr[2]=1;

{

arr[i]=0;

while(tmp>=(v[j]*v[j]))

if(tmp%v[j]==0)

tmp/=v[j];

j=-1;

j++;

if(j==v.size())

}

if(tmp>1)

arr[i]+=arr[i-1];

}

int main()

int n,kase=1;

int high;

for(int i=0;i<1700;i++)

prime[i]=0;

primeGenerator();

while(cin>>n)

if(n<0)

if(n==0)

cout<<"Case "<<kase++<<": 0!\n";

 

mid=SIZE/2;

low=0;

//binary search

{

if(arr[mid]<n)

else

 

if(arr[low]==n)

else if(arr[high]==n)

else

 

 

}

#include <math.h>

#include <map>

#include <fstream>

#define SIZE 46500

using namespace std;

// sqrt of 2^31 is ~46400

int prime[SIZE];

void PrimeGenerate()

double p = sqrt(SIZE)+4;

for(int i=3;i<p;i+=2)

if(prime[i]==0)

for(int j=i+i;j<SIZE;j+=i)

 

}

v.push_back(2);

for(int j=3;j<SIZE;j++)

if(prime[j]==0 && j%2!=0)

}

}

int main()

int m,cnt;

map<int,int> mp;

//cout<<prime[21471]<<"\n";

//out.open("out.txt");

while(cin>>n)

cin>>m;

//break;

if(n>=m)

cout<<m<<" divides "<<n<<"!\n";

continue;

mp.clear();

int j=0;

while(tmp>=v[j]*v[j])

if(tmp%v[j]==0)

tmp/=v[j];

{

break;

mp[v[j]]++;

j=-1;

j++;

break;

if(f)

//cout<<"1)\n";

//out<<m<<" does not divide "<<n<<"!\n";

}

{

{

cout<<m<<" does not divide "<<n<<"!\n";

continue;

mp[tmp]++;

}

for(map<int,int>::iterator ii=mp.begin();ii!=mp.end();++ii)

a = 1;//ii->first;

int add=0;

while(1)

a*=ii->first;

t+=add;

break;

}

{

break;

 

}

{

cout<<m<<" does not divide "<<n<<"!\n";

}

{

//out<<m<<" divides "<<n<<"!\n";

}

return 0;

#include <math.h>

#include <map>

 

 

int cnt;

vector<int> num;

}node[33000];

vector<int> v;

stringstream s;

int _pow(int a,int p)

if(p==0)

return a*_pow(a,p-1);

 

{

int prev=-1;

for(int i=3;i<33000;i++)

prev=-1;

if(prime[i]==0 && i%2!=0)

if(prev==i)

node[i].freq[counter-1]++;

else

prev=i;

node[i].num.push_back(prev);

//node[i].freq[i]++;

}

index=0;

{

{

if(prev==v[index])

node[i].freq[counter-1]++;

else

prev = v[index];

node[i].num.push_back(prev);

//node[i].freq[v[index]]++;

}

}

{

{

}

{

node[i].freq[counter++]++;

}

//node[i].freq[tmp]++;

node[i].cnt=counter;

 

}

{

double p = sqrt(33000)+4;

for(int i=3;i<p;i+=2)

if(prime[i]==0)

for(int j=i+i;j<33000;j+=i)

 

}

v.push_back(2);

for(int j=3;j<33000;j++)

if(prime[j]==0 && j%2!=0)

}

factorize();

int a,b;

{

if(str=="0")

istringstream s(str);

numb=1;

{

{

c=1;

else if(c)

b=n;

 

}

NODE tNode = node[numb-1];

//cout<<tNode.num[5]<<" "<<tNode.freq[5]<<"\n";

for(int i=(tNode.num.size()-1);i>=0;i--)

cout<<tNode.num[i]<<" ";//cout<<ii->first<<" "<<ii->second<<" ";

cout<<tNode.freq[i]<<" ";

cout<<tNode.freq[i]<<"\n";

}

 

}

#include <vector>

#include <fstream>

 

 

 

int prime[1000005];

 

 

{

int n;

/*prime[2]=0;

for(int i=3;i<SIZE;i++)

arr[i]=0;

prime[i]=1;

prime[i]=0;

}

double p=sqrt(SIZE);

{

{

{

}

}

v.push_back(2);//

{

{

}

 

 

arr[2]=1;

{

{

continue;

int tmp = i;

int j=0;

{

{

arr[i]++;

}

}

arr[i]++;

arr[i]+=arr[i-1];

 

{

cout<<arr[n]<<"\n";

 

}