I hope I could solve Task A~D.

I hope I solve A,B,C,D,E.

Hopefully I solve A,B,C,D!!

I hope I will solve A,B,C,D.(%%%) (I am a Chinese student)

Irregular

Hope not rubbish round.

Why is this ABC contest on Sunday instead of Saturday?

i HOPE ...

I hope that we won’t get another TERRIBLE problem like last time’s Problem D.

hope i can wirite A,B,C,D.my Rated is to low

I hope it

Thank god this contest starts on 12:10（UTC+8）（I have to go to school at 18:00）！

Why Sunday?

Maybe I can't solve D,I think it's hard.

Solve only A problem

没人AK吗？（Chinese Students）

Well,I solve the D.

YESSSS Finally solved A-D!!! I think I had the idea for E but couldn't implement in time

How do you solve E?Greedy?

i am idiot.

zero...

0x3f.... > 1e18 :(

ac

**HOW F?61/71 **

#include<bits/stdc++.h>
#define I return
#define AK 0
#define IOI ;
using namespace std;
long long t, n, mx, m, k, a[1234567], z = 1, ans;
vector<long long>g[234567];
int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i], mx = max(mx, a[i]);
		for(int j = i + i; j <= n; j += i)g[j].push_back(i);
	}
	for(int i = n; i >= 1; i--) {
		if(!z)break;
		k = 0;
		if(a[i] < mx) {
			k = mx - a[i], a[i] = mx, ans += k;
			for(int j : g[i]) {
				a[j] += k;
				if(a[j] > mx)z = 0;
			}
		}
	}
	if(z)cout << ans;
	else cout << -1;
	I AK IOI
}

Why there's still no official editorial?

I think that I am very weak than the bosses. I just passed problem G once! This maybe because this problem is so similar to abc454_e, and I solved it ago.

I hope I could solve Task A~C.

For problem G, how to prove that a correct k satisfies k%2=0 ?