Cod sursa(job #811773)
Utilizator | Data | 12 noiembrie 2012 21:59:41 | |
---|---|---|---|
Problema | Multimi2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.25 kb |
#include<iostream>
using namespace std;
int main()
{
int s,div=1;
double n;
cin>>n;
while(div<=sqrt(n))
{
if(fmod(n,div)==0)
{
if(n/div==div)
s=s+div;
else
s=s+(n/div)+div;
}
div=div+1;
}
cout<<s;
return 1;
}