题解 | #约数的个数#

//土尔逊Torson 编写于2023/05/10
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>

using namespace std;

int numDivisor(int num) { //约数 为除数 或 因数
	int total = 0;
	unsigned int i;
	for (i = 1; i*i < num; i++) {
		if (num % i == 0) {
			total += 2;
		}
	}
	if (i*i == num) {
		++total;
	}
	return total;
}

int main() {
	int N, Num;     //根据题意收集数据
	while (scanf("%d", &N) != EOF) {
		vector<int> hold;
		for (unsigned int i = 0; i < N; ++i) {
			hold.push_back(0);
		}

		for (unsigned int i = 0; i < N; ++i) {
			scanf("%d", &Num);
			hold[i] = numDivisor(Num);
		}

		for (int i = 0; i < N; ++i) {
			printf("%d\n", hold[i]);
		}
	}
	system("pause");
	return EXIT_SUCCESS;
}
// 64 位输出请用 printf("%lld")