题解 | #约数的个数#

#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

const int MAX=1001;
int numbers[MAX];

int main() {
    int n;
    while(scanf("%d",&n)!=EOF){
        if(n==0){
            break;
        }
        for(int i=0;i<n;i++){
            scanf("%d",&numbers[i]);
        }
        for(int i=0;i<n;i++){
            int answer=0;
            int bound=sqrt(numbers[i]);
            for(int j=1;j<=bound;j++){
                if(numbers[i]%j==0){
                    answer=answer+2;
                }

            }
            if(bound*bound == numbers[i]){
                answer--;
            }
            printf("%d\n",answer);
        }

    }
    return 0;
}
// 64 位输出请用 printf("%lld")