1-100中取3个数,计作a,b,c且a*c=b^2,求有多少组?
下面给出几种方法,转成C++问题,可以参考:
转化:设此题目中为1~n中取三个数,计作a,b,c(a>b>c) 且a*c=b^2,则记组数为a(n)。设x²为n因数中最大的完全平方数,则a(n)=a(n-1)+x-1
[n^(1/2)]
a(n)=∑[n/i²]*φ(i)
i=2
解答1 :
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,sum=0;
cin>>n;
for(int a=1;a<=n;a++){
for(int b=1;b<=n;b++){
for(int c=1;c<=n;c++){
if(a*c==b*b&&a!=b&&b!=c&&a!=c&&a<b&&b<c){
sum++;
cout<<"("<<a<<","<<b<<","<<c<<")"<<endl;
}
}
}
}
cout<<sum;
return 0;
}
解答2 :
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
int n;
int sum = 0;
int main () {
cin >> n;
for (int x = 1;x <= n;x ++) {
for (int y = 1;y < x;y ++) {
for (int z = 1;z < y;z ++) {
if (x * z == y * y) {
sum ++;
printf ("(%d , %d , %d)\n" , x , y , z);
}
}
}
}
cout << sum;
return 0;
}