Submission #8906065
Source Code Expand
/* ∫ ∫ ∫ ノヽ (_ ) (_ ) (______ ) ヽ(´・ω・)ノ | / UU */ #include <bits/stdc++.h> typedef long long ll; using namespace std; using P = pair<ll, ll>; typedef vector<int> vi; const int MOD = (int)1e9 + 7; const ll INF = 1LL << 60; const int inf = 1<<30; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } #define REP(i, n) for (int i = 0; i < (n); i++) #define FOR(i,s,n) for (int i = s; i < (n); i++) #define ALL(obj) (obj).begin(), (obj).end() //コンテナじゃないと使えない!! #define debug(x) cerr << #x << ": " << x << "\n"; #define mp make_pair template <typename T> ostream& operator<<(ostream& os, vector<T> &V){ int N = V.size(); REP(i,N){ os << V[i]; if (i!=N-1) os << " "; } os << "\n"; return os; } template <typename T> ostream& operator<<(ostream& os, pair<T,T> const&P){ os << P.first; os << " "; os << P.second; return os; } template <typename T> ostream& operator<<(ostream& os, set<T> &S){ auto it=S.begin(); while(it!=S.end()){ os << *it; os << " "; it++; } os << "\n"; return os; } template <typename T> ostream& operator<<(ostream& os, deque<T> &q){ for(auto it=q.begin();it<q.end();it++){ os<<*it; os<<" "; } os<<endl; return os; } vector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)}; //fixed<<setprecision(10)<<ans<<endl; int main(){ cin.tie(0); ios::sync_with_stdio(false); string S; cin >> S; S+='+'; int ans = 0; bool zero_include = false; for(auto s:S){ if(s=='+'){ if(!zero_include) ans++; zero_include=false; }else if(s=='0'){ zero_include=true; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 数式の書き換え |
User | petite_prog |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2063 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 512 KB |
Judge Result
Set Name | sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 2 ms | 512 KB |
18.txt | AC | 2 ms | 512 KB |
19.txt | AC | 2 ms | 512 KB |
20.txt | AC | 2 ms | 512 KB |
21.txt | AC | 2 ms | 512 KB |
22.txt | AC | 2 ms | 512 KB |
23.txt | AC | 2 ms | 512 KB |
24.txt | AC | 2 ms | 512 KB |
25.txt | AC | 2 ms | 512 KB |
26.txt | AC | 2 ms | 512 KB |
27.txt | AC | 2 ms | 512 KB |
28.txt | AC | 2 ms | 512 KB |
29.txt | AC | 2 ms | 512 KB |
30.txt | AC | 2 ms | 512 KB |
31.txt | AC | 2 ms | 512 KB |
32.txt | AC | 2 ms | 512 KB |
33.txt | AC | 2 ms | 512 KB |
34.txt | AC | 2 ms | 512 KB |
35.txt | AC | 2 ms | 512 KB |
36.txt | AC | 2 ms | 512 KB |
37.txt | AC | 2 ms | 512 KB |
38.txt | AC | 2 ms | 512 KB |
39.txt | AC | 2 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 |