2331.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 2331 on 2006-08-20 at 21:23:18 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 1 << 16;
 
bool prime[N+1];
int p[N], pn = 0;
 
int main()
{
	int T;
	
	scanf("%d", &T);
	memset(prime, true, sizeof(prime));
	for(int i = 2; i <= N; i++) {
		if(!prime[i]) continue;
		p[pn++] = i;
		for(int j = 2; i*j <= N; j++) prime[i*j] = false;
	}
	for(int t = 1; t <= T; t++) {
		int n;
		scanf("%*d %d", &n);
		while(!(n&1)) n >>= 1;
		int px = 1;
		for(int i = 0; i < pn && n != 1; i++) {
			int k = 0;
			for(; n % p[i] == 0; k++) n /= p[i];
			px *= k+1;
		}
		if(n != 1) px *= 2;
		printf("%d %d\n", t, px-1);
	}
	
	
	return 0;
}