Submission

Status:

[PPPP-SSSS]

Score: 0

User: tankunkid

Problemset: ขนมของเซ้น143 (v.ง่าย)

Language: cpp

Time: 0.026 second

Submitted On: 2025-03-15 14:44:30

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    long long int sum = (n*(n+1))/2;
    vector<long long int> a(n-1);
    for (int i=0; i<n-1; i++) {
        long long int s1 = sum-((i+1)*(i+2))/2;
        long long int s2 = sum-s1;
        if (s1 >= s2) a[i] = s1-s2;
        else a[i] = s2-s1;
    }
    sort(a.begin(), a.end());
    cout << a[0];
}