Submission

Status:

------TTTT

Subtask/Task Score:

0/100

Score: 0

User: Gump2011

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

Language: cpp

Time: 1.096 second

Submitted On: 2026-03-08 14:35:23

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N;
    cin >> N;

    long long r = 1, c = 1;
    long long val = 1;
    long long ans = 0;

    int dr[6] = {0,1,0,1,0,-1};
    int dc[6] = {1,0,-1,0,1,0};

    long long k = 0;

    while (val <= N*N) {
        long long len;

        if (k == 0) len = N;
        else if (k % 3 == 1) len = 1;
        else len = N - (k - k/3);

        if (len <= 0) break;

        int dir = k % 6;

        for (long long i = 0; i < len && val <= N*N; i++) {
            if (!(k == 0 && i == 0)) {
                r += dr[dir];
                c += dc[dir];
                val++;
            }
            if (r == N) ans += val % 10;
        }

        k++;
    }

    cout << ans << "\n";
}