# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466959 | XBoRickie | Savrsen (COCI17_savrsen) | C++11 | 919 ms | 78552 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 <bits/stdc++.h>
using namespace std;
long long imperf[10000001];
int A, B;
int main(){
cin >> A >> B;
for(int i=2; i*i<=B; i++){
for(int j=i; j*i<=B; j++){
if(i==j){
imperf[i*j] += i;
}
else{
imperf[i*j] += i+j;
}
}
}
imperf[1] = 1;
/*
for(int i=0; i<=B; i++){
cout << " " << abs(imperf[i]+1-i);
}
cout << endl;
*/
long long sum = 0;
for(int i=A; i<=B; i++){
sum += abs(imperf[i]+1-i);
}
cout << sum << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |