結果
問題 | No.49 算数の宿題 |
ユーザー |
![]() |
提出日時 | 2018-12-12 00:35:28 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,643 bytes |
コンパイル時間 | 2,015 ms |
コンパイル使用メモリ | 171,780 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-23 02:01:03 |
合計ジャッジ時間 | 2,339 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
#include <cassert>#include <cctype>#include <cerrno>#include <cfloat>#include <ciso646>#include <climits>#include <clocale>#include <cmath>#include <csetjmp>#include <csignal>#include <cstdarg>#include <cstddef>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>#include <ccomplex>#include <cfenv>#include <cinttypes>#include <cstdbool>#include <cstdint>#include <ctgmath>#include <cwchar>#include <cwctype>// C++#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <typeinfo>#include <utility>#include <valarray>#include <vector>#include <array>#include <atomic>#include <chrono>#include <condition_variable>#include <forward_list>#include <future>#include <initializer_list>#include <mutex>#include <random>#include <ratio>#include <regex>#include <scoped_allocator>#include <system_error>#include <thread>#include <tuple>#include <typeindex>#include <type_traits>#include <unordered_map>#include <unordered_set>//#include <boost/foreach.hpp>//#include <boost/range/algorithm.hpp>#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)#define ll long long#define Sort(v) sort(all(v))#define INF 1000000000#define END return 0#define pb push_back#define se second#define fi first#define pb push_back#define all(v) (v).begin() , (v).end()#define MP make_pair#define MOD 1000000007LLusing namespace std;int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};int main (){string s;cin>>s;vector<int> v;queue<char> q;int n=0;rep(i,0,s.size()){if('0'<=s[i]&&s[i]<='9')n=n*10+(s[i]-'0');else {v.push_back(n);n=0;q.push(s[i]);}}v.push_back(n);int ans=0;rep(i,0,v.size()){if(i==0){ans=v[i];continue;}if(q.front()=='*')ans+=v[i];else ans*=v[i];q.pop();}cout<<ans<<endl;}/*3 81 3 1 100 2 31 2 3 201 1 2 50 3 21 1 3 71 2 1 90 2 35 161 1 2 3437501 1 3 33431 1 4 3473921 1 5 54971 2 3 1233941 2 4 5454921 2 5 4581 3 4 3439831 3 5 8434681 4 5 159340 2 10 4 10 3 20 4 20 4 30 5 30 0*/