# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75826 | charlies_moo | Savrsen (COCI17_savrsen) | C++98 | 3062 ms | 612 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
int is_perfect(long long n)
{
int sum=0;
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
if(i<n)
sum+=i;
if((n/i)<n)
sum+=n/i;
}
}
sum-=n;
int sqn=sqrt(n);
if(sqn*sqn==n && sqn<n)
sum-=sqn;
return abs(sum);
}
int main()
{
int a,b,ans=0;
cin>>a>>b;
for(int i=a;i<=b;i++)
ans+=is_perfect(i);
cout<<ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |