Submission

PPPPPPPPPPPPPPPPPPPP

Score: 100

User: Dormon

Problemset: มุมขวาบน

Language: cpp

Time: 0.002 second

Submitted On: 2024-12-11 18:08:53

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <numeric>

#define debug(...) Debug(#__VA_ARGS__, __VA_ARGS__)
using namespace std;
const bool TEST_CASE = 0;

template<typename T>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* name, T value) {
    std::cout << name << " : " << value << '\n';
}

template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {
    for(auto &x : a) out << x << ' '; 
    return out;
};
template<typename T, typename... Args>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* names, T value, Args... args) {
    const char* comma = strchr(names, ',');
    std::cout.write(names, comma - names) << " : " << value << " | ";
    Debug(comma + 1, args...);
}

void solve(){
    int64_t n, ans = 1ll, cnt = 6+0ll;
    cin >> n;
    while (ans + cnt <= n)
        ans += cnt, cnt += 8 + 0ll;
    if (ans + cnt == n+2)
        cout << "Cannot find top-right corner.\n";
    else
        cout << ans << '\n';
}

#define DORMON

int main()
{
    #ifndef DORMON
        ios_base::sync_with_stdio(0); 
    #endif
    cin.tie(0);
    int q = 1; 
    if (TEST_CASE) cin >> q;
    while (q--){
        solve();
    }
}