UVa 11417 - GCD.

	/**
	* Author : Md.Mehadi Hasan Menon.
	* Problem : 11417 - GCD.
	* Status : Accepted.
	* Date : 07.10.2014.
	**/
	#include <stdio.h>
	int findGcd(int a, int b);
	int main()
	{
	int i, j, N, G;
	while(scanf("%d", &N) == 1 && N != 0)
	{
	G = 0;
	for(i = 1; i < N; i++)
	{
	for(j = i + 1; j <= N; j++)
	{
	G = G + findGcd(i, j);
	}
	}
	printf("%d\n", G);
	}
	return 0;
	}
	int findGcd(int a, int b)
	{
	int t, GCD;
	while(b != 0)
	{
	t = b;
	b = a % b;
	a = t;
	}
	GCD = a;
	return GCD;
	}

view raw 11417.cpp hosted with ❤ by GitHub