提交时间:2024-01-23 17:11:35

运行 ID: 125547

#include<bits/stdc++.h> using namespace std; long long n , res = 0; long long a[111111]; int f[]={6 , 2 , 5 , 5 , 4 , 5 , 6 , 3 , 7 , 6}; int abc(long long x){ long long sum = 0; if(x == 0){ return 6; } while(x > 0){ long long t = x % 10; sum += f[t]; x /= 10; } return sum; } int main(){ cin >> n; for(long long i = 0;i <= 30000; i++){ a[i] = abc(i); } for(long long i = 0;i <= 30000;i++){ for(long long j = i;j <= 30000; j++){ if(a[i] + a[j] + a[i + j] + 4 == n && i != j){ res += 2; } if(a[i] + a[j] + a[i + j] + 4 == n && i == j){ res++; } } } cout << res; return 0; }