1519.cpp

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

/*  This Code is Submitted by wywcgs for Problem 1519 on 2005-09-30 at 12:27:30 */ 
#include <stdio.h>
#define  MAX  34000

int main()
{
	int inQueue[MAX+1]= {0}, free[MAX] = {0};
	int i, num, p = 0, n, k;
	
	for(i = 2; i <= MAX; i++) {
		if(!inQueue[i]) {
			free[++p] = i;
			num = 0;
			for(k = i+1; k <= MAX; k++) {
				if(!inQueue[k]) {
					num++;
					if(num % i == 0) {
						inQueue[k] = 1;
					}
				}
			}
		}
	}
	while(scanf("%d", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			printf("%d\n", free[n]);
		}
	}
	
	return 0;
}