uva11417 GCD

uva11417

uDebug11417

 题意是给定整数N（1<N<501），求i和j的最大公约数（GCD）之和G（其中，1<=i<N, i+1<=j<=N）。题目是蛮简单的，不过涉及到的计算不少，所以对于这类题目，还是采取用数组记录计算结果，然后查表的方式，节省时间。

python版本AC代码

def GCD(a,b):
	if a == 0:
		return b
	else:
		return GCD(b%a,a)

maxn = 501
S = [0 for col in range(maxn)]
G = [[0 for col in range(maxn)] for row in range(maxn)]


for i in range(maxn-1):
	if i == 0:
		continue
	for j in range(maxn):
		if j < i+1:
			continue
		G[i][j] = GCD(i,j)

for i in range(maxn):
	if i < 2:
		continue
	for j in range(i):
		if j == 0:
			continue
		S[i] += G[j][i]

for i in range(maxn):
	if i < 2:
		continue
	S[i] += S[i-1]

while True:
	N = int(input())
	if N == 0:
		break
	print(S[N])

C++版本AC代码

#include <iostream>
#include<cstdio>
using namespace std;

//#define ZANGFONG
const int maxn = 501;
int G[maxn][maxn],S[maxn];

int GCD(int a, int b)
{
    return a==0?b:(GCD(b%a,a));
}

int main()
{
    #ifdef ZANGFONG
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif // ZANGFONG
    int i,j,N;

    for(i = 1; i < maxn-1; i++)
    {
        for(j = i+1; j < maxn; j++)
            G[i][j] = GCD(i,j);
    }

    for(i = 2; i < maxn; i++)
    {
        for(j = 1; j < i; j++)
            S[i] += G[j][i];
    }

    for(i = 2; i < maxn; i++) S[i] += S[i-1];

    while(scanf("%d\n",&N)&&N)
    {
        printf("%d\n",S[N]);
    }

    return 0;
}