Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
24579 | LeoWang | 分成整数 | C++ | Accepted | 0 MS | 256 KB | 1020 | 2023-08-14 04:58:01 |
#include <bits/stdc++.h> using namespace std; bool has3or7(unsigned int x) { while (x>0) { if (x % 10 == 7 or x % 10 == 3) { return 1; } else { x = x/10; } } return 0; } int main() { unsigned int N; cin >> N; long long res = 0; unsigned int divi1=N/3; unsigned int i, j, k; for (i = 1; i <= divi1; i++) { for (j = i + 1; j <= (N - i) / 2; j++) { if (i == j) { continue; } else { k = N - i - j; if (k == j) { continue; } else { if (has3or7(i) or has3or7(j) or has3or7(k)) { continue; } else { res++; } } } } } cout << res << endl; }