結果
問題 | No.111 あばばばば |
ユーザー | penguinshunya |
提出日時 | 2020-01-29 01:59:57 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,550 bytes |
コンパイル時間 | 1,707 ms |
コンパイル使用メモリ | 167,684 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-15 16:32:06 |
合計ジャッジ時間 | 2,159 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < int(n); i++)#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)#define reps(i, n) for (int i = 1; i <= int(n); i++)#define rreps(i, n) for (int i = int(n); i >= 1; i--)#define repc(i, n) for (int i = 0; i <= int(n); i++)#define rrepc(i, n) for (int i = int(n); i >= 0; i--)#define repi(i, a, b) for (int i = int(a); i < int(b); i++)#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)#define each(x, y) for (auto &x : y)#define all(a) (a).begin(), (a).end()#define bit(b) (1ll << (b))using namespace std;using i32 = int;using i64 = long long;using u64 = unsigned long long;using f80 = long double;using vi32 = vector<i32>;using vi64 = vector<i64>;using vu64 = vector<u64>;using vf80 = vector<f80>;using vstr = vector<string>;inline void yes() { cout << "Yes" << '\n'; exit(0); }inline void no() { cout << "No" << '\n'; exit(0); }inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng)= mi; } return ok; }template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }void solve() {i64 L;cin >> L;i64 c = (L - 1) / 2;cout << c * (L - c - 1) << endl;}