#include <bits/stdc++.h> using namespace std; #define PB push_back #define MP make_pair #define LL long long #define FOR(i,a,b) for(int i = (a); i <= (b); i++) #define FORD(i,a,b) for(int i = (a); i >= (b); i--) #define RE(i,n) FOR(i,1,n) #define REP(i,n) FOR(i,0,(int)(n)-1) #define R(i,n) REP(i,n) #define VI vector<int> #define PII pair<int,int> #define LD long double #define FI first #define SE second #define st FI #define nd SE #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define M_PI 3.14159265358979323846 template<class C> void mini(C& _a4, C _b4) { _a4 = min(_a4, _b4); } template<class C> void maxi(C& _a4, C _b4) { _a4 = max(_a4, _b4); } template<class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << '=' << h << endl; } template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != ',')cerr << *sdbg++; cerr << '=' << h << ','; _dbg(sdbg + 1, a...); } template<class T> ostream& operator<<(ostream& os, vector<T> V) { os << "["; for (auto& vv : V) os << vv << ","; os << "]"; return os; } template<class T> ostream& operator<<(ostream& os, set<T> V) { os << "["; for (auto& vv : V) os << vv << ","; os << "]"; return os; } template<class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) { return os << "(" << P.st << "," << P.nd << ")"; } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #endif int track(int b, int c) { return (b >= 2 && c >= 2); } int getCo(int goal) { int co = 0; for (int f = 1; f * f <= goal; f++) { if (goal % f == 0) { int b = f; int c = goal / f - 1; co += track(b, c); if (f * f != goal) { b = goal / f; c = f - 1; co += track(b, c); } } } return co; } int32_t main(int32_t argc, char ** argv) { ios_base::sync_with_stdio(0); int n; cin >> n; int co = 0; for (int a = 1; a * a <= n; a++) { if (n % a == 0) { co += getCo(n / a - 1); if (a * a != n) { co += getCo(a - 1); } } } cout << co << 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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | #include <bits/stdc++.h> using namespace std; #define PB push_back #define MP make_pair #define LL long long #define FOR(i,a,b) for(int i = (a); i <= (b); i++) #define FORD(i,a,b) for(int i = (a); i >= (b); i--) #define RE(i,n) FOR(i,1,n) #define REP(i,n) FOR(i,0,(int)(n)-1) #define R(i,n) REP(i,n) #define VI vector<int> #define PII pair<int,int> #define LD long double #define FI first #define SE second #define st FI #define nd SE #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define M_PI 3.14159265358979323846 template<class C> void mini(C& _a4, C _b4) { _a4 = min(_a4, _b4); } template<class C> void maxi(C& _a4, C _b4) { _a4 = max(_a4, _b4); } template<class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << '=' << h << endl; } template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != ',')cerr << *sdbg++; cerr << '=' << h << ','; _dbg(sdbg + 1, a...); } template<class T> ostream& operator<<(ostream& os, vector<T> V) { os << "["; for (auto& vv : V) os << vv << ","; os << "]"; return os; } template<class T> ostream& operator<<(ostream& os, set<T> V) { os << "["; for (auto& vv : V) os << vv << ","; os << "]"; return os; } template<class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) { return os << "(" << P.st << "," << P.nd << ")"; } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #endif int track(int b, int c) { return (b >= 2 && c >= 2); } int getCo(int goal) { int co = 0; for (int f = 1; f * f <= goal; f++) { if (goal % f == 0) { int b = f; int c = goal / f - 1; co += track(b, c); if (f * f != goal) { b = goal / f; c = f - 1; co += track(b, c); } } } return co; } int32_t main(int32_t argc, char ** argv) { ios_base::sync_with_stdio(0); int n; cin >> n; int co = 0; for (int a = 1; a * a <= n; a++) { if (n % a == 0) { co += getCo(n / a - 1); if (a * a != n) { co += getCo(a - 1); } } } cout << co << endl; return 0; } |