#include <stdio.h>
#include <math.h>

#define COUNT 168
unsigned int iNumbers[COUNT] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};

int main(int argc, char* argv[])
{
	int i, x, x2, y, y2, z, z2;
	for(i=0; i<COUNT; i++)
	{
		// Гипотенуза простое число
		z = iNumbers[i];
		z2 = z*z;
		for(x = 2; x < z; x++)
		{
			x2 = x*x;
			for(y = x; y < z; y++)
			{
				y2 = y*y;
				if(x2 + y2 == z2) printf("%d,%d,%d\n", x, y, z);
				if(x2 + y2 > z2) break;
			}
		}
		// Катет простое число
		y = iNumbers[i];
		y2 = y*y;
		for(x = 2; x <= y; x++)
		{
			z = sqrt(x*x + y2); 
			z2 = z*z;
			if(x2 + y2 == z2) printf("%d,%d,%d\n", x, y, z);
		}
	}
	return 0;
}

#define COUNT 168
unsigned int iPrime[COUNT] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};

// Возвращает общий делитель тройки
inline int GetDivider(int a, int b, int c)
{
	int iRet = 1;
	unsigned int iMin = (a < b ? a : b) >> 1;
	unsigned int* ptrRow = &iPrime[0];
	unsigned int* ptrLast = &iPrime[COUNT - 1];
	if(*ptrLast < iMin) MessageBox(NULL, "Таблицу простых чисел надо побольше", "УПС :(", 0);
	while(ptrRow <= ptrLast)
	{
		ptrRow = &iPrime[0];
		while(ptrRow <= ptrLast)
		{
			if (a % *ptrRow == 0 && b % *ptrRow == 0 && c % *ptrRow == 0) 
			{
				iRet = iRet * *ptrRow;
				a = a / *ptrRow;
				b = b / *ptrRow;
				c = c / *ptrRow;
				break;
			}
			ptrRow++;
			if(*ptrRow > iMin) ptrRow = ptrLast + 1;
		}
	}
	//printf("Divider %d Minimum (%d, %d, %d)\n", iRet, a, b, c);
	return iRet;
}

#include <stdio.h>
#include <stdlib.h>

// Greatest Common Divisor
inline int gcd(int a,int b){
  int c;
  while ( a != 0 ) {
     c = a; a = b%a;  b = c;
  }
  return b;
}

inline int relationPrime(int m,int n){
	return gcd(m,n)==1?1:0;
}

// Stuped brute-force pyfagorean triangle generator
int main(int argc,char **argv){

	if (argc>1){
		int maxside = atoi(argv[1]);
		for(int i=1;i<maxside;i++){
		    int ii = i * i;
	            for(int j=1;j<i;j++){
			int jj = j * j;
	   		if (relationPrime(i,j)) {
				if(GetDivider(ii - jj, 2 * i * j, ii + jj) == 1) printf("(%d,%d,%d)\n",ii - jj,2 * i * j,ii + jj);
			}        
	            }
	            
	        }
		return 0;
	} else {
		fprintf(stderr,"Pyfagorean Triangle Generator 1.0 of 1 jan 2014, by Mayton\n\nUsage: pyfagor [N]\n\n");
		return 1;	
	}

	
	return 0;
}

// Pifagor.cpp : Defines the entry point for the console application.
//

#pragma warning( disable : 4786)
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <windows.h>
#include <map>


// Greatest Common Divisor
inline unsigned int gcd(unsigned int a, unsigned int b){
  unsigned int c;
  while ( a != 0 ) {
     c = a; a = b%a;  b = c;
  }
  return b;
}

// для хранения ключа
typedef struct {
	unsigned int a;
	unsigned int b;
} sPifagor_t;

struct clsPifagorCompare:
public                                 
std::binary_function<sPifagor_t, sPifagor_t, bool>
{ 
	bool operator() (const sPifagor_t& lhs, const sPifagor_t& rhs) const 
	{
		return lhs.a < rhs.a || (lhs.a == rhs.a && lhs.b < rhs.b);
	}
};

typedef std::map<sPifagor_t, unsigned int, clsPifagorCompare> map_t;
map_t mapRes;
map_t::iterator cur;

unsigned int iStore = 0;

inline void StoreTri(unsigned int a, unsigned int b, unsigned int c)
{
	sPifagor_t sPifagor;
	unsigned int iGCD = gcd(a, b);
	if(iGCD > 1)
	{
		a = a / iGCD;
		b = b / iGCD;
		c = c / iGCD;
	}
	if(a > b)
	{
		sPifagor.a = b;
		sPifagor.b = a;
	}
	else
	{
		sPifagor.a = a;
		sPifagor.b = b;
	}
	
	cur = mapRes.find(sPifagor);
	if(cur != mapRes.end())
	{
		if((*cur).second != c)
		{
			printf("error(%d,%d,%d != %d)\n", a, b, c, (*cur).second);
			MessageBox(NULL, "error", "error", 0);
		}
	}
	else
	{
		mapRes.insert(std::make_pair(sPifagor, c));
		iStore++;
	}

}

inline unsigned int relationPrime(unsigned int m, unsigned int n){
	return gcd(m,n)==1?1:0;
}

// Stuped brute-force pyfagorean triangle generator
int main(int argc,char **argv){

	if (argc>1){
		unsigned int iCount = 0, iNext = 1000000, iStart = GetTickCount();
		unsigned int maxside = atoi(argv[1]);
		for(int i=1;i<maxside;i++){
		    unsigned int ii = i * i;
	            for(int j=1;j<i;j++){
			unsigned int jj = j * j;
	   		if (relationPrime(i,j)) {
				StoreTri(ii - jj,2 * i * j,ii + jj);
				iCount++;
				if(iCount >= iNext) 
				{
					printf("Parse %d Store %d Time %d msec\n", iCount, iStore, GetTickCount() - iStart);
					iNext += 1000000;
				}

			}        
	            }
	            
	        }
		printf("Parse %d Store %d Time %d msec\n", iCount, iStore, GetTickCount() - iStart);
		return 0;
	} else {
		fprintf(stderr,"Pyfagorean Triangle Generator 1.0 of 1 jan 2014, by Mayton\n\nUsage: pyfagor [N]\n\n");
		return 1;	
	}

	
	return 0;
}

// Stuped brute-force pyfagorean triangle generator
int main(int argc,char **argv){

	if (argc>1){
		unsigned int iCount = 0, iNext = 1000000, iStart = GetTickCount();
		unsigned int maxside = atoi(argv[1]);
		for(int i=1;i<maxside;i++){
		    unsigned int ii = i * i;
	            for(int j=1;j<i;j++){
			unsigned int jj = j * j;
	   		if (relationPrime(i,j)) {
				StoreTri(ii - jj,2 * i * j,ii + jj);
				iCount++;
				if(iCount >= iNext) 
				{
					printf("Parse %d Store %d Time %d msec\n", iCount, iStore, GetTickCount() - iStart);
					iNext += 1000000;
				}

			}        
	            }
	            
	        }
		printf("Parse %d Store %d Time %d msec\n", iCount, iStore, GetTickCount() - iStart);
		for(unsigned int a = 1; a <40000; a++)
		{
			for(unsigned int b = 1; b < 40000; b++)
			{
				unsigned int c2 = a*a + b*b;
				unsigned int c = sqrt(c2);
				if(c2 == c*c)
				{
					unsigned int iStorePrev = iStore;
					StoreTri(a, b, c);
					if(iStorePrev != iStore)
					{ 
						printf("skip(%d,%d,%d)\n", a, b, c);
						iCount++;
					}
				}

			}
		}
		printf("Parse %d Store %d Time %d msec\n", iCount, iStore, GetTickCount() - iStart);
		map2file();
		return 0;
	} else {
		fprintf(stderr,"Pyfagorean Triangle Generator 1.0 of 1 jan 2014, by Mayton\n\nUsage: pyfagor [N]\n\n");
		return 1;	
	}

	
	return 0;
}

inline void StoreTri(unsigned int a, unsigned int b, unsigned int c)
{
	sPifagor_t sPifagor;

	unsigned int iGCD = gcd(a, b);
	if(iGCD > 1)
	{
		a = a / iGCD;
		b = b / iGCD;
		c = c / iGCD;
	}

	if(a > b)
	{
		sPifagor.a = b;
		sPifagor.b = a;
	}
	else
	{
		sPifagor.a = a;
		sPifagor.b = b;
	}
	if(sPifagor.b >= 10000000) return;
....
}