-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path21b.cpp
More file actions
120 lines (104 loc) · 1.69 KB
/
Copy path21b.cpp
File metadata and controls
120 lines (104 loc) · 1.69 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
int size=100000;
int* bb;
int kk=1;
ofstream myfile;
int j=3,k=1;
int *b=new int[size];
int *c=new int[size];
int *d=new int[size];
int *e=new int[size];
void prime(){
b[0]=1;
b[1]=2;b[2]=3;
for(int i=5;j<=size;i+=2)
{int x=1;
for(int c=1;c<j;c++)
if(i%b[c]==0)
x=0;
if(x)
{b[j]=i;j++;}
}
}
void primefact(int z)
{
long long int y=z;
for(long long int i=1;i<j&&y>0;i++)
{int tt=0;
while(y%b[i]==0)
{
tt=1;
e[k]++;
y=y/b[i];
}
if(tt)
{d[k]=b[i];k++;}
}
}
int main()
{
prime();
c[1]=1;
for(int i=1;b[i]<size;i++)
{
c[b[i]]=1+b[i];
for(int p=b[i]*b[i],q=b[i];p<size&&p!=1;q=p,p=p*b[i])
c[p]=p+c[q];
}
for(int i=2;i<size;i++)
{if(c[i]==0)
{c[i]=1;
e=new int[size];
d=new int[size];
k=1;
primefact(i);
for(int s=1;s<k;s++)
{//cout<<d[s+1]<<"\t"<<e[s+1]<<"\t"<<(int)pow(d[s+1],e[s+1])<<"\t"<<c[i]<<"\t"<<i<<endl;
int g=(int)pow(d[s],e[s]);
if(g>0&&g<size)
c[i]*=c[g];
else
cout<<i<<endl;
}
//cout<<b[l]<<"\t"<<i/b[l]<<"\t"<<c[b[l]]*c[i/b[l]]<<endl;
}
}
int ss[4]={1713,4064,6392,8695};
for(int i,m=0;m<4;m++)
{i=ss[m];
c[i]=1;
e=new int[size];
d=new int[size];
k=1;
primefact(i);
/* for(int s=1;s<k;s++)
{cout<<d[s]<<"\t"<<e[s]<<endl;
}
cout<<endl;
*/
for(int s=1;s<k;s++)
{//cout<<d[s+1]<<"\t"<<e[s+1]<<"\t"<<(int)pow(d[s+1],e[s+1])<<"\t"<<c[i]<<"\t"<<i<<endl;
int g=(int)pow(d[s],e[s]);
if(g>0&&g<size)
c[i]*=c[g];
else
cout<<i<<endl;
}
}
int ans=0;
for(int i=2;i<size;i++)
{//cout<<c[i]-i<<"\t"<<i<<endl;
if(i!=c[i]-i)
if(c[c[i]-i]-(c[i]-i)==i)
{cout<<c[i]-i<<"\t"<<i<<endl;
ans=ans+c[i];c[c[i]-i]=0;}
}
cout<<ans<<endl<<endl;
//cout<<c[575]-575<<endl;
//cout<<c[3937]-3937<<endl;
//cout<<c[5593]-5593<<endl;
return 0;
}