제출 #633877

#제출 시각아이디문제언어결과실행 시간메모리
633877inksamuraiSavrsen (COCI17_savrsen)C++17
0 / 120
1223 ms78576 KiB
#include <bits/stdc++.h> #define int ll using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define rng(i,c,n) for(int i=c;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3PGDklf ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e const int _n=10000001; int ps[_n]; signed main(){ _3PGDklf; for(int i=1;i<_n;i++){ for(int j=2*i;j<_n;j+=i){ ps[j]-=i; } } for(int i=1;i<_n;i++){ ps[i]+=ps[i-1]; } int l,r; cin>>l>>r; auto f=[&](int n){ return n==0?0:n*(n+1)/2+ps[n]; }; print(f(r)-f(l-1)); }
#Verdict Execution timeMemoryGrader output
Fetching results...