Submission #8918706
Source Code Expand
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
typedef long long int lint;
typedef pair<int, int> P;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
vector<char>NUM(10);
NUM = { '0','1','2' ,'3' ,'4' ,'5' ,'6' ,'7' ,'8' ,'9' };
*/
int main() {
string S;
cin >> S;
lint Z = S.size();
lint ans = S[0] - '0';
lint cnt = 0;
for (int i = 1; i <= (Z-1)/2; i++) {
if (S[2 * i-1] == '+') {
if (ans != 0) {
cnt++;
}
ans = (S[2 * i]-'0');
}
else {
ans *= (S[2 * i]-'0');
}
}
if (ans != 0) {
cnt++;
}
cout << cnt << endl;
}
Submission Info
Submission Time |
|
Task |
C - 数式の書き換え |
User |
mimitch |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1505 Byte |
Status |
WA |
Exec Time |
5 ms |
Memory |
512 KB |
Judge Result
Set Name |
sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt, sample-03.txt |
All |
00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name |
Status |
Exec Time |
Memory |
00.txt |
AC |
1 ms |
256 KB |
01.txt |
AC |
1 ms |
256 KB |
02.txt |
AC |
1 ms |
256 KB |
03.txt |
AC |
1 ms |
256 KB |
04.txt |
AC |
1 ms |
256 KB |
05.txt |
AC |
1 ms |
256 KB |
06.txt |
AC |
1 ms |
256 KB |
07.txt |
AC |
1 ms |
256 KB |
08.txt |
AC |
1 ms |
256 KB |
09.txt |
AC |
1 ms |
256 KB |
10.txt |
AC |
1 ms |
256 KB |
11.txt |
AC |
1 ms |
256 KB |
12.txt |
AC |
1 ms |
256 KB |
13.txt |
AC |
1 ms |
256 KB |
14.txt |
AC |
1 ms |
256 KB |
15.txt |
AC |
1 ms |
256 KB |
16.txt |
AC |
1 ms |
256 KB |
17.txt |
AC |
5 ms |
512 KB |
18.txt |
WA |
4 ms |
512 KB |
19.txt |
AC |
5 ms |
512 KB |
20.txt |
AC |
4 ms |
512 KB |
21.txt |
AC |
4 ms |
512 KB |
22.txt |
AC |
4 ms |
512 KB |
23.txt |
AC |
5 ms |
512 KB |
24.txt |
AC |
5 ms |
512 KB |
25.txt |
AC |
5 ms |
512 KB |
26.txt |
AC |
4 ms |
512 KB |
27.txt |
AC |
4 ms |
512 KB |
28.txt |
AC |
5 ms |
512 KB |
29.txt |
AC |
5 ms |
512 KB |
30.txt |
AC |
5 ms |
512 KB |
31.txt |
AC |
5 ms |
512 KB |
32.txt |
AC |
4 ms |
512 KB |
33.txt |
AC |
5 ms |
512 KB |
34.txt |
AC |
5 ms |
512 KB |
35.txt |
AC |
5 ms |
512 KB |
36.txt |
AC |
5 ms |
512 KB |
37.txt |
AC |
4 ms |
512 KB |
38.txt |
AC |
4 ms |
512 KB |
39.txt |
AC |
4 ms |
512 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |
sample-03.txt |
AC |
1 ms |
256 KB |