eolymp
bolt
Try our new interface for solving problems
Problems

Smooth Divisors

published at 2/7/24, 8:42:12 pm

include <bits/stdc++.h>

using namespace std; int main() { long n,m=0; cin>>n; for(int i=1; i<=n; i++) if(n%i==n/i){ m++; } cout<<m<<endl; } // 100%

published at 2/8/24, 7:51:07 pm

n = int(input()) p = 0 for m in range(2, n): if (n // m == n % m): p += 1 print(p)