1957.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1957 on 2006-01-01 at 17:05:15 */ 
#include <cstdio>
#include <cstring>
#include <cmath>

const int MAX = 1024;

bool prime[MAX];
int pr[MAX], pn = 0;

bool aver(int&, int&);

int main()
{
	int t, T, i, j;
	int n;

	memset(prime, true, sizeof(prime));
	for(i = 2; i < MAX; i++) {
		if(prime[i]) {
			pr[pn++] = i;
			for(j = 2; i*j < MAX; j++) prime[i*j] = false;
		}
	}
	scanf("%d", &T);
	int h, w, l;
	for(t = 0; t < T; t++) {
		scanf("%d", &n);
		h = w = 1, l = n;
		while(aver(l, w) || aver(h, w) || aver(l, h)) ;
		printf("%d\n", 2*(w*h+w*l+h*l));
	}
	
	return 0;
}

bool aver(int& a, int& b)
{
	if(!prime[a] || !prime[b]) {
		int m = a * b, i;
		for(i = (int)sqrt(m)+1; i > 0 && m % i != 0; i--) ;
		if(i == a || i == b) return false;
		else { a = i, b = m / i; return true; }
	}
	return false;
}