제출 #640036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640036		IWTIM	Savrsen (COCI17_savrsen)	C++17	120 / 120	1082 ms	78568 KiB

savrsen

# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;	// or double, if TL is tight
using str = string;	// yay python! 
 
// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;
 
#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
	const int MOD = 998244353;
const int MX = 1e7 + 5;
const ll BIG = 1e18;	// not too close to LLONG_MAX
const db PI = acos((db) - 1);
const int dx[4]
{
	1, 0, -1, 0
}, dy[4]
{
	0, 1, 0, -1
};	// for every grid problem!!
mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());
template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;
struct DSU
{
	vi e;
	void init(int N)
	{
		e = vi(N, -1);
	}
 
	int get(int x)
	{
		return e[x] < 0 ? x : e[x] = get(e[x]);
	}
 
	bool sameSet(int a, int b)
	{
		return get(a) == get(b);
	}
 
	int size(int x)
	{
		return -e[get(x)];
	}
 
	bool unite(int x, int y)
	{
		// union by size
		x = get(x), y = get(y);
		if (x == y) return 0;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y];
		e[y] = x;
		return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void > struct is_iterable : false_type {};
	tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
	                                  decltype(end(declval < T>()))
	                                 >
	                       > : true_type {};
	tcT > constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void > struct is_readable : false_type {};
	tcT > struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	//	// https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void > struct is_printable : false_type {};
	tcT > struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cout <<declval < T>()), ostream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double;	// or double, if TL is tight
using str = string;	// yay python! 
 
// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;
 
#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
	template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void > struct is_iterable : false_type {};
	tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
	                                  decltype(end(declval < T>()))
	                                 >
	                       > : true_type {};
	tcT > constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void > struct is_readable : false_type {};
	tcT > struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	//	// https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void > struct is_printable : false_type {};
	tcT > struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cout <<declval < T>()), ostream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
ll t,n,cnt[MX];
main() {
    ll a,b;
    cin>>a>>b;
    for (ll i = 1; i <= b; i++){
    	for (ll j = 2 * i; j <= b; j+=i) {
    		cnt[j] += i;
		}
	}
	ll ans = 0;
	for (ll i = a; i <= b; i++) {
		ans += abs(i - cnt[i]);
	}
	cout<<ans<<"\n";
}

컴파일 시 표준 에러 (stderr) 메시지

savrsen.cpp:209:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  209 | main() {
      | ^~~~

• Subtask 1: 120 / 120