November 2014 – Page 3 – Live with passion

10394

Asif NaeemNovember 16, 2014

#include <iostream>
#include <string>
#include <vector>
#include <math.h>

#define SZ 20000001

using namespace std;

int prime[SZ];
vector<int> v;

struct twin{
	int x;
	int y;
}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)
				prime[j]=1;
		}
	}

	v.push_back(2);
	int cnt=0;
	for(int i=3;i<SZ;i+=2)
	{
		if(prime[i]==0)
		{
			v.push_back(i);
			int t=v.size();
			if(v[t-1]-v[t-2]==2)
			{
				twinPrime[cnt].x = v[t-2];
				twinPrime[cnt].y = v[t-1];
				cnt++;
			}
		}
	}
}


int main()
{
	primegen();
	int size = v.size();
	int n;

	while(cin>>n)
	{
		cout<<"("<<twinPrime[n-1].x<<", "<<twinPrime[n-1].y<<")\n";
	}
	return 0;
}

#include <iostream>

#include <string>

#include <vector>

#include <math.h>

#define SZ 20000001

using namespace std;

int prime[SZ];

vector<int> v;

struct twin{

int x;

int y;

}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)

prime[j]=1;

}

v.push_back(2);

int cnt=0;

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

{

if(prime[i]==0)

{

v.push_back(i);

int t=v.size();

if(v[t-1]-v[t-2]==2)

{

twinPrime[cnt].x = v[t-2];

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

cnt++;

}

int main()

{

primegen();

int size = v.size();

int n;

while(cin>>n)

{

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

}

return 0;

}

11709

Asif NaeemNovember 16, 2014

#include <iostream>
#include <map>
#include <vector>
#include <string>
#include <queue>
#include <string.h>
#include <stdio.h>

using namespace std;

vector<int> graph[1005];
bool visit[1005];
bool visited[1005][1005];
map<string,int> mp;
int p,t;

void dfs(int u,int v)
{
	visited[u][v]=1;
	int tmp;
	for(int i=0;i<graph[v].size();i++)
	{
		tmp=graph[v][i];
		if(!visited[u][tmp])
		{
			dfs(u,tmp);
		}
	}
}


int main()
{
	string s,s1;

	while(cin>>p>>t)
	{
		if(p==0 && t==0)
		break;
		mp.clear();
		getchar();



		for(int i=0;i<p;i++)
		{
			getline(cin,s);
			mp[s]=i;
			graph[i].clear();
		}

		for(int i=0;i<t;i++)
		{
			getline(cin,s);
			getline(cin,s1);
			graph[mp[s]].push_back(mp[s1]);

		}
		memset(visited,0,sizeof(visited));

		for(int i=0;i<p;i++)
			dfs(i,i);

		memset(visit,0,sizeof(visit));
		int cnt=0;
		for(int i=0;i<p;i++)
		{
			if(!visit[i])
			{
				cnt++;
				for(int j=i+1;j<p;j++)
				{
					if(!visit[j] && visited[i][j] && visited[j][i])
					{
						visit[j]=1;
					}
				}
			}
		}
		cout<<cnt<<"\n";
	}

	return 0;

}

#include <iostream>

#include <map>

#include <vector>

#include <string>

#include <queue>

#include <string.h>

#include <stdio.h>

using namespace std;

vector<int> graph[1005];

bool visit[1005];

bool visited[1005][1005];

map<string,int> mp;

int p,t;

void dfs(int u,int v)

{

visited[u][v]=1;

int tmp;

for(int i=0;i<graph[v].size();i++)

{

tmp=graph[v][i];

if(!visited[u][tmp])

{

dfs(u,tmp);

}

int main()

{

string s,s1;

while(cin>>p>>t)

{

if(p==0 && t==0)

break;

mp.clear();

getchar();

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

{

getline(cin,s);

mp[s]=i;

graph[i].clear();

}

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

{

getline(cin,s);

getline(cin,s1);

graph[mp[s]].push_back(mp[s1]);

}

memset(visited,0,sizeof(visited));

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

dfs(i,i);

memset(visit,0,sizeof(visit));

int cnt=0;

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

{

if(!visit[i])

{

cnt++;

for(int j=i+1;j<p;j++)

{

if(!visit[j] && visited[i][j] && visited[j][i])

{

visit[j]=1;

}

cout<<cnt<<"\n";

}

return 0;

}

11347

Asif NaeemNovember 14, 2014

#include <iostream>
#include <cstring>
#include <math.h>
#include <stdio.h>
#include <vector>

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

using namespace std;

int ans[200];
int prime[1001];
vector<int> v;
ull _MAX;

void primegenerator()
{
	double p=sqrt(1001);

	v.push_back(2);

	for(int i=3;i<p;i+=2)
	{
		if(prime[i]==0)
		for(int j=i*2;j<1001;j+=i)
			prime[j]=1;
	}

	for(int i=3;i<1001;i+=2)
	{
		if(prime[i]==0)
		v.push_back(i);
	}

}

int main()
{
	string s;
	int _max=0;
	int t,cnt,num;
	int kase=1;
	_MAX = 1000000000;
	_MAX *=_MAX;
	primegenerator();
	cout<<v.size()<<"\n";
	cin>>t;

	while(t--)
	{
		cin>>s;
		cnt=0;
		num=0;
		_max=0;
		memset(ans,0,sizeof(ans));
		for(int i=0;i<s.size();i++)
		{
			if(s[i]=='!')
			cnt++;
			else
			{
				num*=10;
				num+=(s[i]-'0');
			}
		}
		//cout<<num<<" "<<cnt<<"\n";
		cout<<"Case "<<kase++<<": ";

		while(num>1)
		{
			int tmp=num;
			int j=0;
			while(tmp>1)
			{
				if(tmp%v[j]==0)
				{
					tmp/=v[j];
					ans[j]++;
					//_max=max(j,_max);

				}
				else
				j++;
			}
			num-=cnt;
		}

		ull res=1;
		int f=1;
		for(int i=0;i<v.size();i++)
		{
			if(ans[i]!=0)
			res*=(ans[i]+1);
			if(res>_MAX)
			{
				f=0;
				break;
			}
		}
		if(f==1)
		cout<<res<<"\n";
		else
		cout<<"Infinity\n";
	}
	return 0;
}

100

101

102

103

104

105

106

107

#include <iostream>

#include <cstring>

#include <math.h>

#include <stdio.h>

#include <vector>

#define ull unsigned long long

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

using namespace std;

int ans[200];

int prime[1001];

vector<int> v;

ull _MAX;

void primegenerator()

{

double p=sqrt(1001);

v.push_back(2);

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

{

if(prime[i]==0)

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

prime[j]=1;

}

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

{

if(prime[i]==0)

v.push_back(i);

}

int main()

{

string s;

int _max=0;

int t,cnt,num;

int kase=1;

_MAX = 1000000000;

_MAX *=_MAX;

primegenerator();

cout<<v.size()<<"\n";

cin>>t;

while(t--)

{

cin>>s;

cnt=0;

num=0;

_max=0;

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

for(int i=0;i<s.size();i++)

{

if(s[i]=='!')

cnt++;

else

{

num*=10;

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

}

//cout<<num<<" "<<cnt<<"\n";

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

while(num>1)

{

int tmp=num;

int j=0;

while(tmp>1)

{

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

{

tmp/=v[j];

ans[j]++;

//_max=max(j,_max);

}

else

j++;

}

num-=cnt;

}

ull res=1;

int f=1;

for(int i=0;i<v.size();i++)

{

if(ans[i]!=0)

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

if(res>_MAX)

{

f=0;

break;

}

if(f==1)

cout<<res<<"\n";

else

cout<<"Infinity\n";

}

return 0;

}

11415

Asif NaeemNovember 12, 2014

#include <iostream>
#include <math.h>
#include <vector>

#define ull unsigned long long
#define SIZE 2703664
using namespace std;

int prime[1700];//3200
ull factor[SIZE];
int arr[10000001];
vector<int> v;

void primeGenerator()
{
	double p = sqrt(1700);
	for(int i=3;i<p;i+=2)
	{
		if(prime[i]==0)
		{
			for(int j=i+i;j<1700;j+=i)
			prime[j]=1;
		}
	}

	v.push_back(2);

	for(int i=3;i<1700;i+=2)
	{
		if(prime[i]==0)
		v.push_back(i);
	}
}


void countfactor()
{
	int tmp;
	factor[0]=1;

	factor[1]=1;

	factor[2]=1;


	for(int i=3;i<SIZE;i++)
	{
		tmp = i;
		int j=0;
		factor[i]=0;
		while(tmp>=(v[j]*v[j]))
		{
			if(tmp%v[j]==0)
			{
				tmp/=v[j];
				factor[i]++;
				j=-1;
			}
			j++;

			if(j==v.size())
			break;

		}
		if(tmp>1)
		factor[i]++;

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


	}

}

int main()
{
	primeGenerator();
	countfactor();

	ull low,mid,high;
	ull n,ans=0;
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n;
		low=0;
		mid=SIZE/2;
		high=SIZE;
		ans = 0;
		if(arr[n])
		{
			cout<<arr[n]<<"\n";
			continue;
		}
		while((high-low)>1)
		{
			if(factor[mid]<=n)
			{
				low=mid;
				mid=(low+high)/2;
				//ans=high;
			}
			else
			{
				high=mid;
				mid=(low+high)/2;
				//ans=low;
			}
		}

		if(factor[mid+1]>n && factor[mid]<=n)
		{
			arr[n]=mid+1;
		}
		cout<<arr[n]<<"\n";
	}

	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

#include <iostream>

#include <math.h>

#include <vector>

#define ull unsigned long long

#define SIZE 2703664

using namespace std;

int prime[1700];//3200

ull factor[SIZE];

int arr[10000001];

vector<int> v;

void primeGenerator()

{

double p = sqrt(1700);

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

{

if(prime[i]==0)

{

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

prime[j]=1;

}

v.push_back(2);

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

{

if(prime[i]==0)

v.push_back(i);

}

void countfactor()

{

int tmp;

factor[0]=1;

factor[1]=1;

factor[2]=1;

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

{

tmp = i;

int j=0;

factor[i]=0;

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

{

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

{

tmp/=v[j];

factor[i]++;

j=-1;

}

j++;

if(j==v.size())

break;

}

if(tmp>1)

factor[i]++;

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

}

int main()

{

primeGenerator();

countfactor();

ull low,mid,high;

ull n,ans=0;

int t;

cin>>t;

while(t--)

{

cin>>n;

low=0;

mid=SIZE/2;

high=SIZE;

ans = 0;

if(arr[n])

{

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

continue;

}

while((high-low)>1)

{

if(factor[mid]<=n)

{

low=mid;

mid=(low+high)/2;

//ans=high;

}

else

{

high=mid;

mid=(low+high)/2;

//ans=low;

}

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

{

arr[n]=mid+1;

}

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

}

return 0;

}

10856

Asif NaeemNovember 9, 2014

#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <stdlib.h>

#define SIZE 2800001
#define ull unsigned long long

using namespace std;

int prime[1700];
ull arr [SIZE];//[10000001+5];
vector<int> v;

void primeGenerator()
{
	double p = sqrt(1700);
	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);
		}
	}
}

void factorize()
{
	int tmp;
	arr[0]=1;
	arr[1]=0;
	arr[2]=1;
	for(int i=3;i<SIZE;i++)
	{
		tmp = i;
		arr[i]=0;
		int j=0;
		while(tmp>=(v[j]*v[j]))
		{
			if(tmp%v[j]==0)
			{
				tmp/=v[j];
				arr[i]++;
				j=-1;
			}
			j++;

			if(j==v.size())
			break;
		}
		//cout<<tmp<<"\n";
		if(tmp>1)
		 arr[i]++;
		arr[i]+=arr[i-1];
	}
}

int main()
{
	int n,kase=1;
	int mid;
	int high;
	int low;
	for(int i=0;i<1700;i++)
	{
		prime[i]=0;
	}
	primeGenerator();
	factorize();
	while(cin>>n)
	{
		if(n<0)
		break;
		if(n==0)
		{
			cout<<"Case "<<kase++<<": 0!\n";
			continue;

		}
		mid=SIZE/2;
		high=SIZE;
		low=0;

		//binary search
		while((high-low)>1)
		{
			mid=(high+low)/2;
			if(arr[mid]<n)
				low=mid;
			else
				high = mid;

		}
		if(arr[low]==n)
		cout<<"Case "<<kase++<<": "<<low<<"!\n";
		else if(arr[high]==n)
		cout<<"Case "<<kase++<<": "<<high<<"!\n";
		else
		cout<<"Case "<<kase++<<": Not possible.\n";

	}

	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

#include <iostream>

#include <string>

#include <stdio.h>

#include <math.h>

#include <vector>

#include <stdlib.h>

#define SIZE 2800001

#define ull unsigned long long

using namespace std;

int prime[1700];

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

vector<int> v;

void primeGenerator()

{

double p = sqrt(1700);

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);

}

void factorize()

{

int tmp;

arr[0]=1;

arr[1]=0;

arr[2]=1;

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

{

tmp = i;

arr[i]=0;

int j=0;

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

{

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

{

tmp/=v[j];

arr[i]++;

j=-1;

}

j++;

if(j==v.size())

break;

}

//cout<<tmp<<"\n";

if(tmp>1)

arr[i]++;

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

}

int main()

{

int n,kase=1;

int mid;

int high;

int low;

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

{

prime[i]=0;

}

primeGenerator();

factorize();

while(cin>>n)

{

if(n<0)

break;

if(n==0)

{

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

continue;

}

mid=SIZE/2;

high=SIZE;

low=0;

//binary search

while((high-low)>1)

{

mid=(high+low)/2;

if(arr[mid]<n)

low=mid;

else

high = mid;

}

if(arr[low]==n)

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

else if(arr[high]==n)

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

else

cout<<"Case "<<kase++<<": Not possible.\n";

}

return 0;

}

10139

Asif NaeemNovember 8, 2014

#include <iostream>
#include <math.h>
#include <vector>
#include <map>
#include <sstream>
#include <fstream>

#define SIZE 46500
#define lld long long
using namespace std;

// sqrt of 2^31 is ~46400
vector<int> v;
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)
            prime[j]=1;

        }
    }
    v.clear();
    v.push_back(2);

    for(int j=3;j<SIZE;j++)
    {
       if(prime[j]==0 && j%2!=0)
       v.push_back(j);
    }

}

int main()
{
  int m,cnt;
  lld a,n;
  map<int,int> mp;
  PrimeGenerate();
  //cout<<prime[21471]<<"\n";
  //ofstream out;
  //out.open("out.txt");

  while(cin>>n)
  {
     cin>>m;
     //if(m==0 && n==0)
     //break;
     cnt=0;
     if(n>=m)
     {
        cout<<m<<" divides "<<n<<"!\n";
        //out<<m<<" divides "<<n<<"!\n";
        continue;
     }
     mp.clear();
     lld tmp = m;
     int j=0;
     int f=0;
     while(tmp>=v[j]*v[j])
     {
         if(tmp%v[j]==0)
         {
            tmp/=v[j];
            if(v[j]>n)
            {
               f=1;
               break;
            }
            mp[v[j]]++;
            cnt++;
            j=-1;
         }
         j++;
         if(j==v.size())
         break;
     }
     if(f)
     {
       //cout<<"1)\n";
       cout<<m<<" does not divide "<<n<<"!\n";
       //out<<m<<" does not divide "<<n<<"!\n";
       continue;
     }
     if(tmp>1)
     {
       if(tmp>n)
       {
         //cout<<"2)\n";
         cout<<m<<" does not divide "<<n<<"!\n";
         //out<<m<<" does not divide "<<n<<"!\n";
         continue;
       }
       mp[tmp]++;
       cnt++;
     }
     //cout<<mp.size()<<"\n";
     for(map<int,int>::iterator ii=mp.begin();ii!=mp.end();++ii)
     {
         a = 1;//ii->first;
         int t=0;//=n/a;
         int add=0;
         //cout<<t<<" "<<a<<" "<<n<<"\n";
         while(1)
         {
             a*=ii->first;
             add=n/a;
             t+=add;
             if(add==0)
             break;

         }
         if(t<ii->second)
         {
            f=1;
            break;
         }

         //cout<<ii->first<<" "<<ii->second<<"\n";
     }
     if(f)
     {
       //cout<<"3)\n";
       cout<<m<<" does not divide "<<n<<"!\n";
       //out<<m<<" does not divide "<<n<<"!\n";
     }
     else
     {
       cout<<m<<" divides "<<n<<"!\n";
       //out<<m<<" divides "<<n<<"!\n";
     }
  }
  //out.close();
  return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

#include <iostream>

#include <math.h>

#include <vector>

#include <map>

#include <sstream>

#include <fstream>

#define SIZE 46500

#define lld long long

using namespace std;

// sqrt of 2^31 is ~46400

vector<int> v;

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)

prime[j]=1;

}

v.clear();

v.push_back(2);

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

{

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

v.push_back(j);

}

int main()

{

int m,cnt;

lld a,n;

map<int,int> mp;

PrimeGenerate();

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

//ofstream out;

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

while(cin>>n)

{

cin>>m;

//if(m==0 && n==0)

//break;

cnt=0;

if(n>=m)

{

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

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

continue;

}

mp.clear();

lld tmp = m;

int j=0;

int f=0;

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

{

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

{

tmp/=v[j];

if(v[j]>n)

{

f=1;

break;

}

mp[v[j]]++;

cnt++;

j=-1;

}

j++;

if(j==v.size())

break;

}

if(f)

{

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

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

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

continue;

}

if(tmp>1)

{

if(tmp>n)

{

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

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

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

continue;

}

mp[tmp]++;

cnt++;

}

//cout<<mp.size()<<"\n";

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

{

a = 1;//ii->first;

int t=0;//=n/a;

int add=0;

//cout<<t<<" "<<a<<" "<<n<<"\n";

while(1)

{

a*=ii->first;

add=n/a;

t+=add;

if(add==0)

break;

}

if(t<ii->second)

{

f=1;

break;

}

//cout<<ii->first<<" "<<ii->second<<"\n";

}

if(f)

{

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

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

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

}

else

{

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

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

}

//out.close();

return 0;

}

516

Asif NaeemNovember 8, 2014

#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;
       if(prime[i]==0 && i%2!=0)
       {
           if(prev==i)
           {
             node[i].freq[counter-1]++;
           }
           else
           {
               prev=i;
               node[i].freq[counter++]++;
               node[i].num.push_back(prev);
           }
           //node[i].freq[i]++;
           continue;
       }
       tmp=i;
       index=0;
       while(tmp>=(v[index]*v[index]))
       {
           if(tmp%v[index]==0)
           {
              tmp/=v[index];
              if(prev==v[index])
              {
                 node[i].freq[counter-1]++;
              }
              else
              {
                  prev = v[index];
                  node[i].freq[counter++]++;
                  node[i].num.push_back(prev);
              }
              //node[i].freq[v[index]]++;
              index=-1;
           }
           index+=1;
       }
       if(tmp>1)
       {
          if(prev==tmp)
          {
             node[i].freq[counter-1]++;
          }
          else
          {
              prev=tmp;
              node[i].freq[counter++]++;
              node[i].num.push_back(prev);
          }

          //node[i].freq[tmp]++;
       }
       node[i].cnt=counter;
    }

   return 0;
}
int main()
{
    string str;
    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)
            prime[j]=1;

        }
    }
    v.clear();
    v.push_back(2);

    for(int j=3;j<33000;j++)
    {
       if(prime[j]==0 && j%2!=0)
       v.push_back(j);
    }

    factorize();
    int n,numb;
    int a,b;
    while(1)
    {
       getline(cin,str);
       if(str=="0")
       break;
       istringstream s(str);
       int c=0;
       numb=1;
       while(s>>n)
       {
         if(c==0)
         {
            a=n;
            c=1;
         }
         else if(c)
         {
            b=n;
            c=0;

            numb*=_pow(a,b);
         }
       }
       NODE tNode = node[numb-1];
       //cout<<tNode.num.size()<<"\n";
       //cout<<tNode.num[5]<<" "<<tNode.freq[5]<<"\n";
       //for(int i=node[numb-1].num.size()-1;i>=0;i++)
       for(int i=(tNode.num.size()-1);i>=0;i--)
       {
          cout<<tNode.num[i]<<" ";//cout<<ii->first<<" "<<ii->second<<" ";
          if(i)
          cout<<tNode.freq[i]<<" ";
          else
          cout<<tNode.freq[i]<<"\n";

       }
    }

    return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

#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;

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

{

if(prev==i)

{

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

}

else

{

prev=i;

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

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

}

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

continue;

}

tmp=i;

index=0;

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

{

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

{

tmp/=v[index];

if(prev==v[index])

{

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

}

else

{

prev = v[index];

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

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

}

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

index=-1;

}

index+=1;

}

if(tmp>1)

{

if(prev==tmp)

{

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

}

else

{

prev=tmp;

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

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

}

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

}

node[i].cnt=counter;

}

return 0;

}

int main()

{

string str;

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)

prime[j]=1;

}

v.clear();

v.push_back(2);

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

{

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

v.push_back(j);

}

factorize();

int n,numb;

int a,b;

while(1)

{

getline(cin,str);

if(str=="0")

break;

istringstream s(str);

int c=0;

numb=1;

while(s>>n)

{

if(c==0)

{

a=n;

c=1;

}

else if(c)

{

b=n;

c=0;

numb*=_pow(a,b);

}

NODE tNode = node[numb-1];

//cout<<tNode.num.size()<<"\n";

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

//for(int i=node[numb-1].num.size()-1;i>=0;i++)

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

{

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

if(i)

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

else

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

}

return 0;

}

884

Asif NaeemNovember 7, 2014

#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 i=3;i<1010;i++)
	{
        if(prime[i]==0 && i%2!=0)
		{
			v.push_back(i);
		}
	}

	//cout<<v.size();

	arr[1]=0;
	arr[2]=1;
		for(int i=3;i<SIZE;i++)
		{
			if(prime[i]==0 && i%2!=0)
			{
				arr[i]+=(arr[i-1]+1);
				continue;
			}
			int tmp = i;

			int j=0;
			while(tmp>=(v[j]*v[j]))
			{
				if(tmp%v[j]==0)
				{
					tmp/=v[j];
					arr[i]++;
					j=-1;
				}
				j++;
			}
			if(tmp)
			arr[i]++;

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

		while(cin>>n)
		{
			int sum=0;
			cout<<arr[n]<<"\n";
		}

	return 0;
}

#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 i=3;i<1010;i++)

{

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

{

v.push_back(i);

}

//cout<<v.size();

arr[1]=0;

arr[2]=1;

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

{

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

{

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

continue;

}

int tmp = i;

int j=0;

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

{

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

{

tmp/=v[j];

arr[i]++;

j=-1;

}

j++;

}

if(tmp)

arr[i]++;

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

}

while(cin>>n)

{

int sum=0;

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

}

return 0;

}

Month: November 2014

10394

11709

11347

11415

10856

10139

516

884

Archives

Categories