题解 | #约数的个数#

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
int s[N];

int Counter(int x){
	int count = 0; 
	int i = 1;
	for(i = 1;i * i < x;i ++){
		if(x % i == 0)count += 2;
	}
	if(i * i == x) count ++;
	return count;
}
int main(){
	int n;
	while(cin >> n){
		for(int i = 0;i < n;i ++)cin >> s[i];
		for(int i = 0;i < n;i ++)cout << Counter(s[i]) << endl;
	}
	return 0;
}