HDU6108 小C的倍数问题 【脑洞】

链接

---

$证明:p进制下,当且仅当,x每位之和为B的倍数时,x\%B=0$

$设x=k_0+k_1p+k_2p^2+...+k_np^n$
$若(k_0+k_1+...+k_n)\%B=\sum_{i=0}^nk_i \%B=0$
$又因为x=\sum_{i=0}^{n}k_i+\sum_{i=1}^{n}((p^i-1)*k_i)$
$所以当\sum_{i=1}^{n}((p^i-1)*k_i)\%B=0时,x\%B=0$
$而p^i-1=(p-1)*(p^{i-1}+p^{i-2}+...+1) ->(p^i-1)\%(p-1)=0 \ \ \ $
$所以当B=p-1或p-1的因子时,有:当且仅当\sum_{i=0}^nk_i \%B=0,x\%B=0$

#include<stdio.h>
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MEM(a,x) memset(a,x,sizeof(a))
#define lowbit(x) ((x)&-(x))

using namespace std;

const int N = 5000 + 5;
const double EPS = 1e-7;

int slove(int n){
    int ans=0;
    for(int i=1,ed=sqrt(n);i<=ed;++i){
        if(n%i==0){
            ++ans;
            int j=n/i;
            if(i!=j){
                ++ans;
            }
        }
    }
    return ans;
}

int main()
{
    //freopen("/home/lu/code/r.txt","r",stdin);
    //freopen("/home/lu/code/w.txt","w",stdout);
    int T;
    scanf("%d",&T);
    while(T--){
        int p;
        scanf("%d",&p);
        printf("%d\n",slove(p-1));
    }
    return 0;
}