Submission #153840

#TimeUsernameProblemLanguageResultExecution timeMemory
153840bogdan_buzatuSavrsen (COCI17_savrsen)C++14
30 / 120
17 ms8440 KiB
#include <iostream> #include <algorithm> #define pozitie second #define numar first using namespace std; int n,x,sol,ciur[1000100],a,b; int main(){ cin>>a>>b; if(a==1){ sol=1; } for(int i=2;i<=b;i++){ for(int j=i*2;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 timeMemoryGrader output
Fetching results...