# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153841 | bogdan_buzatu | Savrsen (COCI17_savrsen) | C++14 | 1609 ms | 39544 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 <algorithm>
#define pozitie second
#define numar first
using namespace std;
int n,x,sol,ciur[10000010],a,b;
int main(){
cin>>a>>b;
if(a==1){
sol=1;
}
for(int i=2;i<=b;i++){
for(int j=i+i;j<=b;j+=i){
ciur[j]+=i;
}
x=ciur[i]+1-i;
x=max(x,-x);
if(i>=a){
sol+=x;
}
}
cout<<sol;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |