Cod sursa(job #2000423)
Utilizator | Data | 13 iulie 2017 16:33:14 | |
---|---|---|---|
Problema | Ciclu hamiltonian de cost minim | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <cmath>
using namespace std;
int n,sol,t,i;
int main()
{
cin>>n;
for(i=1;i<=sqrt(n);++i)
{
if(n%i==0)
{
++sol;
t=n/i;
if(t!=i) ++sol;
}
}
cout<<sol-1;
return 0;
}