#include <string> #include <vector> #include <algorithm> #include <cmath> #include <set> #include <map> #include <cstdio> #include <sstream> #include <iostream> #include <cstring> #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define pb push_back #define sz size() #define mp make_pair #define fi first #define se second #define ll long long #define IN(x,y) ((y).find((x))!=(y).end()) #define LOLDBG #ifdef LOLDBG #define DBG(vari) cout<<#vari<<" = "<<vari<<endl; #define DBG2(v1,v2) cout<<(v1)<<" - "<<(v2)<<endl; #else #define DBG(vari) #define DBG2(v1,v2) #endif #define CZ(x) scanf("%d",&(x)); #define CZ2(x,y) scanf("%d%d",&(x),&(y)); #define ALL(x) (x).begin(),(x).end() using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";} template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; } int num_divisors(int z) { int res=0; if (z<4) return 0; for(int d=1;d*d<=z;d++) { if (z%d==0) { if (z!=d*d) { if (d>=2 && z/d>=3) res++; if (z/d>=2 && d>=3) res++; } else { if (d>=3) res++; } } } return res; } int main() { ios_base::sync_with_stdio(0); ll n; cin>>n; ll res=0; for(ll d=1;d*d<=n;d++) { if (n%d==0) { res+=num_divisors(n/d-1); if (n!=d*d) res+=num_divisors(d-1); } } cout<<res; 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 | #include <string> #include <vector> #include <algorithm> #include <cmath> #include <set> #include <map> #include <cstdio> #include <sstream> #include <iostream> #include <cstring> #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define pb push_back #define sz size() #define mp make_pair #define fi first #define se second #define ll long long #define IN(x,y) ((y).find((x))!=(y).end()) #define LOLDBG #ifdef LOLDBG #define DBG(vari) cout<<#vari<<" = "<<vari<<endl; #define DBG2(v1,v2) cout<<(v1)<<" - "<<(v2)<<endl; #else #define DBG(vari) #define DBG2(v1,v2) #endif #define CZ(x) scanf("%d",&(x)); #define CZ2(x,y) scanf("%d%d",&(x),&(y)); #define ALL(x) (x).begin(),(x).end() using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";} template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; } int num_divisors(int z) { int res=0; if (z<4) return 0; for(int d=1;d*d<=z;d++) { if (z%d==0) { if (z!=d*d) { if (d>=2 && z/d>=3) res++; if (z/d>=2 && d>=3) res++; } else { if (d>=3) res++; } } } return res; } int main() { ios_base::sync_with_stdio(0); ll n; cin>>n; ll res=0; for(ll d=1;d*d<=n;d++) { if (n%d==0) { res+=num_divisors(n/d-1); if (n!=d*d) res+=num_divisors(d-1); } } cout<<res; return 0; } |