eolymp
bolt
Try our new interface for solving problems
Məsələlər

Спальные вагоны

dərc olunub 10.01.24 17:33:09

include <bits/stdc++.h>

define ll long long

define ld long double

using namespace std; int main(){

ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string n;
cin>>n;
ll ans = 0, mx = -1;
for(int i = 0; i<n.size(); i++){
    if(n[i] == 'k'){
        ans++;
    }
    else{
        ans = 0;
    }
    mx = max(ans, mx);
}
cout<<mx;

} //TECHNOBLADE NEVER DIE

dərc olunub 16.01.24 20:52:06

python: s = input() cnt = 1 mx = 0 deyis = True for i in range(0,len(s)-1): if s[i] == s[i+1] and s[i]=='k': cnt += 1 else: mx = max(mx, cnt) cnt = 1 deyis = False mx = max(mx, cnt) if s.count('k') == 0: deyis = False mx = 0 if deyis: mx = len(s) print(mx)

cpp:

include <bits/stdc++.h>

using namespace std;

int main() { string x; cin >> x; bool check = true; int cnt = 0, mx = -1; for(int i=0; i<x.size(); i++){ if(x[i] == x[i+1] && x[i] == 'k'){ if(check){ cnt+=2; check = false; } else { cnt++; } } else if(x[i] != x[i+1] || x[i] == 'p') { mx = max(mx,cnt); cnt = 0; check = true; } } cout << mx;

}