| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 75035 | charlies_moo | Savrsen (COCI17_savrsen) | C++98 | 3056 ms | 3304 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;
long long is_perfect(long long n)
{
long long sum=0;
for(long long i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
sum+=i;
sum+=n/i;
if(i==1)
sum-=(n/i);
if(i<n)
sum-=i;
}
}
sum-=n;
long long sqn=sqrt(n);
if(sqn*sqn==n)
sum-=sqn;cout<<abs(sum)<<endl;
return abs(sum);
}
int main()
{
long long a,b,ans;
cin>>a>>b;
for(long long i=a;i<=b;i++)
ans+=is_perfect(i);
cout<<ans;
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
