#include <iostream> #include "bits/stdc++.h" using namespace std; int pin2(int n) { if(n < 3) return 0; vector<int> divisors; int s = sqrt(n); for(int i = 2; i <= s; ++i) { if(!(n % i)) { divisors.push_back(i); divisors.push_back(n/i); } } int r = 0; for(auto it = divisors.begin(); it != divisors.end(); it++) { int d = *it; if(n / d > 2) r++; } return r; } int main() { ios_base::sync_with_stdio(0); int n; cin >> n; if(n < 7) { cout << 0 << endl; return 0; } vector<int> divisors; int s = sqrt(n); for(int i = 2; i <= s; ++i) { if(!(n % i)) { divisors.push_back(i); divisors.push_back(n/i); } } divisors.push_back(1); int r = 0; for(auto it = divisors.begin(); it != divisors.end(); it++) { int d = *it; r += pin2(n / d - 1); } cout << r << 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 | #include <iostream> #include "bits/stdc++.h" using namespace std; int pin2(int n) { if(n < 3) return 0; vector<int> divisors; int s = sqrt(n); for(int i = 2; i <= s; ++i) { if(!(n % i)) { divisors.push_back(i); divisors.push_back(n/i); } } int r = 0; for(auto it = divisors.begin(); it != divisors.end(); it++) { int d = *it; if(n / d > 2) r++; } return r; } int main() { ios_base::sync_with_stdio(0); int n; cin >> n; if(n < 7) { cout << 0 << endl; return 0; } vector<int> divisors; int s = sqrt(n); for(int i = 2; i <= s; ++i) { if(!(n % i)) { divisors.push_back(i); divisors.push_back(n/i); } } divisors.push_back(1); int r = 0; for(auto it = divisors.begin(); it != divisors.end(); it++) { int d = *it; r += pin2(n / d - 1); } cout << r << endl; return 0; } |