幸运数

#include <cstdio>
//主要思想：可以采用存储答案的策略，避免重复计算
const int maxn=100002;
int dp[maxn]={0};
int f(int n){
    int t=0;
    while(n != 0){
        t += (n % 10);
        n /= 10;
    }
    return t;
}
int g(int n){
    int t=0;
    while(n != 0){
        t += (n % 2);
        n /= 2;
    }
    return t;
}
int main(){
    int i, n, ans;
    while(scanf("%d", &n) != EOF){
        if(dp[n] > 0) printf("%d\n", dp[n]);
        else{
            ans = 0;
            for(i=1; i<=n; i++){
                if(dp[i] > 0) ans += dp[i];
                else if(f(i) == g(i)) ans++;
            }
            dp[n] = ans;
            printf("%d\n", ans);
        }
    }
    return 0;
}