# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66519 | KLPP | Savrsen (COCI17_savrsen) | C++14 | 2379 ms | 78916 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<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<stdio.h>
using namespace std;
int abs(int x){
if(x>0)return x;
return -x;
}
int main(){
int a,b;
scanf("%d %d",&a,&b);
long long int arr[b];
for(int i=0;i<b;i++)arr[i]=0;
for(int i=1;i<=b;i++){
for(int j=i;j<=b;j+=i){
arr[j-1]+=i;
}
}
long long int ans=0;
for(int i=0;i<b;i++){
if(i>=a-1){arr[i]=abs(arr[i]-2*(i+1));
ans+=arr[i];
}
}printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |