Fermat vs. Pythagoras
Time Limit: 2000MS | Memory Limit: 10000K | |
Total Submissions: 1026 | Accepted: 593 |
Description
Computer generated and assisted proofs and verification occupy a small niche in the realm of Computer Science. The first proof of the four-color problem was completed with the assistance of a computer program and current efforts in verification have succeeded in verifying the translation of high-level code down to the chip level.
This problem deals with computing quantities relating to part of Fermat's Last Theorem: that there are no integer solutions of a^n + b^n = c^n for n > 2.
Given a positive integer N, you are to write a program that computes two quantities regarding the solution of x^2 + y^2 = z^2, where x, y, and z are constrained to be positive integers less than or equal to N. You are to compute the number of triples (x,y,z) such that x < y < z, and they are relatively prime, i.e., have no common divisor larger than 1. You are also to compute the number of values 0 < p <= N such that p is not part of any triple (not just relatively prime triples).
This problem deals with computing quantities relating to part of Fermat's Last Theorem: that there are no integer solutions of a^n + b^n = c^n for n > 2.
Given a positive integer N, you are to write a program that computes two quantities regarding the solution of x^2 + y^2 = z^2, where x, y, and z are constrained to be positive integers less than or equal to N. You are to compute the number of triples (x,y,z) such that x < y < z, and they are relatively prime, i.e., have no common divisor larger than 1. You are also to compute the number of values 0 < p <= N such that p is not part of any triple (not just relatively prime triples).
Input
The input consists of a sequence of positive integers, one per line. Each integer in the input file will be less than or equal to 1,000,000. Input is terminated by end-of-file
Output
For each integer N in the input file print two integers separated by a space. The first integer is the number of relatively prime triples (such that each component of the triple is <=N). The second number is the number of positive integers <=N that are not part of any triple whose components are all <=N. There should be one output line for each input line.
Sample Input
10 25 100
Sample Output
1 4 4 9 16 27
Source
Duke Internet Programming Contest 1991,UVA 106
题意:给一个数n,求满足x^2+y^2=z^2,x<y<z<=n,并且x,y,z互素。
我觉得这真是一道好题,首先我们知道这个勾股方程可以化为(r^2-s^2)^2+(2*r*s)^2=(r^2+s^2)^2,x=r^2-s^2,y=2*r*s,z=r^2+s^2,所以可以枚举。r,s只能有一个是奇数。
#include<iostream>
#include<cstdlib>
#include<stdio.h>
#include<math.h>
#include<memory.h>
using namespace std;
#define N 1000010
bool flag[N];
int gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
memset(flag,false,sizeof(flag));
int ans=0;
int temp=sqrt(n+0.0);
for(int i=1;i<=temp;i++)
{
for(int j=i+1;j<=temp;j+=2)
{
if(i*i+j*j>n)
break;
if(gcd(i,j)==1)
{
/*if(flag[j*j-i*i]&&flag[2*j*i]&&flag[j*j+i*i])
;
else
{
flag[j*j-i*i]=true;
flag[2*j*i]=true;
flag[j*j+i*i]=true;
ans++;
}*/
int x,y,z;
x=j*j-i*i;y=2*j*i;z=j*j+i*i;
ans++;
for(int k=1;;k++)
{
if(k*z>n)
break;
flag[k*x]=true;flag[k*y]=true;flag[k*z]=true;
}
}
}
}
int ans2=0;
for(int i=1;i<=n;i++)
if(flag[i]==false)
ans2++;
cout<<ans<<" "<<ans2<<endl;
}
}