int main()
{
std::vector<long> rads(max_c, 1);
for (int i = 2; i < max_c; ++i)
{
if (rads[i] != 1)
{
continue;
}
rads[i] = i;
for (int j = i * 2; j < max_c; j+=i)
{
rads[j] *= i;
}
}
long total = 0;
for (int a = 2; a < max_c; ++a)
{
long rad_a = rads[a];
for (int b = 1; b < std::min(a, max_c - a); b++)
{
long rad_b = rads[b];
long c = a + b;
long rad_c = rads[c];
if (rad_a * rad_b * rad_c < c && HCF(rad_a, rad_b) == 1)
{
total += c;
}
}
}
std::cout << total << std::endl;
}
int main(){
//TODO: faster
uint max = 12000;
vector<ullint> p = primesBelow(max);
uint n1 = 1, n2 = 1, d1 = 3, d2 = 2;
uint count = 0;
for(uint d = 3; d <= max ; d++){
uint c1 = ceil(n1 * d / d1);
uint c2 = ceil(n2 * d / d2);
for(uint n = c2; n > c1; n--){
cout << n << endl;
if(HCF(n, d) == 1){
cout << "found" << endl;
count++;
}
}
cout << "maxed out bro" << endl;
}
cout << count << endl;
return 0;
}
int HCF(int num1, int num2)
{
if(num2 == 0)
{
return num1;
}
return HCF(num2, num1%num2);
}
int HCF(int n, int m)
{
int Remainder;
Remainder = n % m;
if (Remainder != 0)
return HCF(m, Remainder);
else
return m;
}
double LCM(double num1, double num2)
{
double temp = 0;
if(num1 < num2)
{
temp = num1;
num1 = num2;
num2 = temp;
}
return (num1*num2)/HCF(num1, num2);
}
int LCM(int num1, int num2)
{
int temp = 0;
if(num1 < num2)
{
temp = num1;
num1 = num2;
num2 = temp;
}
return (num1*num2)/HCF(num1, num2);
}
int main()
{
int i;
int a[] = {1,2,3,4,5,6,7,8,9};
printf("Reverse to display an array:\n");
Reverse(a, 8);
i = HCF(1470, 693);
printf("Factorial 5! = %d\n", Factorial(5));
printf("Greates common devisor 1470 and 693 %d\n", i);
int n;
n = 3, i;
printf("%d\n", n);
return 0;
}
double HCF(double num1, double num2)
{
printf("num1 = %f and num2 = %f\n",num1, num2);
if(num2 == 0)
{
printf("hcf = %f\n",num1);
return num1;
}
while(num1 > 0)
{
num1 = num1 - num2;
}
num1 = (num1 == 0) ? 0 : (num1 + num2);
return HCF(num2, num1);
}
