Submission #8912055

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#include <boost/algorithm/string/classification.hpp>
#include <boost/algorithm/string/split.hpp>
using boost::algorithm::is_any_of;
using boost::algorithm::split;


#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n))
#define sz(x) ((ll)(x).size())
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1000000007;

template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

/*
https://atcoder.jp/contests/abc033/tasks/abc033_c
*/

int main() {
  string S;
  cin >> S;
  vector<string> sp;
  split(sp, S, is_any_of("+"));
  int ans = 0;
  for (auto s : sp) {
    if (s.find('0') == string::npos)
      ans++;
  }
  cout << ans << endl;
}

Submission Info

Judge Result