Submission #1898648

---

Source Code Expand

#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <functional>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;

using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

int main(){
	string s;
	int a;
	int cnt = 0;
	cin >> s;
	while (1){
		a = (int)s.find("0");
		if (a == -1){
			break;
		}
		s.replace(a, 1, "1");
		cnt++;
	}
	cout << cnt << endl;


	return 0;
}

Submission Info

Judge Result