Submission

PPPPPPPPPP

Score: 100

User: Nagornz

Problemset: โชว์ของโลมา

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-14 13:45:38

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n; cin >> n;
    if (n == 1) {
        cout << 1;
        return 0;
    }
    vector <int> a(n);
    a[0] = n * 3 - 2;
    a[n - 1] = n * n + (n % 2) - 1;
    for (int i = 1; i < n - 1; i++) {
        a[i] = a[i - 1] + 1;
        if (i % 2 == 0) {
            a[i] += 2 * (n - i + 1);
            a[i] += 2 * (n - i - 3);
        }
    }
    int sum = 0;
    for (auto e : a) sum += e % 10;
    cout << sum;
}