結果
問題 | No.49 算数の宿題 |
ユーザー |
![]() |
提出日時 | 2016-01-12 22:24:18 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,681 bytes |
コンパイル時間 | 1,697 ms |
コンパイル使用メモリ | 161,392 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-23 01:48:07 |
合計ジャッジ時間 | 2,009 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
// template {{{#include <bits/stdc++.h>using namespace std;// #define int long long#define GET_MACRO(a, b, c, d, NAME, ...) NAME#define REP2(i, n) REP3(i, 0, n)#define REP3(i, a, b) REP4(i, a, b, 1)#define REP4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += s)#define RREP2(i, n) RREP3(i, 0, n)#define RREP3(i, a, b) for (ll i = (b) - 1; i >= (ll)(a); i--)#define rep(...) GET_MACRO(__VA_ARGS__, REP4, REP3, REP2)(__VA_ARGS__)#define rrep(...) GET_MACRO(__VA_ARGS__,, RREP3, RREP2)(__VA_ARGS__)#define eb emplace_back#define ef emplace_front#define pb pop_back#define pf pop_front#define all(c) begin(c), end(c)#define mp make_pair#define mt make_tuple#define fi first#define se second#define popcnt __builtin_popcountllusing uint = unsigned;using ll = long long;using ull = unsigned long long;using ld = long double;using vi = vector<int>;using vvi = vector<vi>;template<typename T>using maxheap = priority_queue<T, vector<T>, less<T>>;template<typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;const int INF = 1e9 + 10;const ll LLINF = 1e18 + 10;const int dx[] = {-1, 0, 1, 0};const int dy[] = {0, -1, 0, 1};const int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};const int dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};template<typename T>inline T sq(T x){return x * x;}template<typename T, typename U>inline bool chmax(T &x, U y){if (x >= y) return false;x = y;return true;}template<typename T, typename U>inline bool chmin(T &x, U y){if (x <= y) return false;x = y;return true;}template<typename T>inline T& sort(T &c){sort(all(c));return c;}template<typename T>inline T& reverse(T &c){reverse(all(c));return c;}template<typename T>inline T& unique(T &c){sort(all(c));c.erase(unique(all(c)), end(c));return c;}template<typename T>inline T sorted(const T &c){T d = c;return sort(d);}template<typename T>inline T reversed(const T &c){T d = c;return reverse(d);}template<typename T>inline T uniqued(const T &c){T d = c;return unique(d);}template<typename T>T power(T x, long long r, const T &e = 1){T res(e);while (r){if (r & 1) res = res * x;x = x * x;r >>= 1;}return res;}// }}}using R = const int&;int main(){string s;cin >> s;auto it = begin(s);auto num = [&]{int r = 0;while (isdigit(*it)){r = r * 10 + *it++ - '0';}return r;};auto opr = [&]() -> function<int(R, R)> {if (*it == '*') return ++it, plus<int>();if (*it == '+') return ++it, multiplies<int>();return [](R x, R) -> int { cout << x << endl; exit(0); };};int c = num();while (true){auto t = opr();c = t(c, num());}}