#include <iostream> #include <vector> using namespace std; int factors_k_m_count(int n) { int c = 0; for (int k=2; k <= n / 2; ++k) { if (n % k == 0 && n / k > 2) ++c; } return c; } int abc_split_count(int n) { int total = 0; for (int i=1; i <= n / 7; ++i) { if (n % i == 0) total += factors_k_m_count((n/i) - 1); } return total; } int main() { int n; cin >> n; cout << abc_split_count(n) << endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 | #include <iostream> #include <vector> using namespace std; int factors_k_m_count(int n) { int c = 0; for (int k=2; k <= n / 2; ++k) { if (n % k == 0 && n / k > 2) ++c; } return c; } int abc_split_count(int n) { int total = 0; for (int i=1; i <= n / 7; ++i) { if (n % i == 0) total += factors_k_m_count((n/i) - 1); } return total; } int main() { int n; cin >> n; cout << abc_split_count(n) << endl; return 0; } |