How to solve this problem using minimum number of operations?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
How to solve this problem using minimum number of operations?
Can you guys help me out with the following code.On compilation it is showing segmentation fault.
int n; cin>>n; string s; cin>>s; int j=0; char c; while(s[j]&&s[j]==s[n-1]) { s.push_back(s[n-1]); j++; } int ans=0;
for(int i=j;i<s.length();i++) { int ctr=0; c=s[i]; while(s[i]&&s[i]==c) { ctr++; i++; } if(ctr>=3) ans+=ctr/3; }
cout<<ans; cout<<s; cout<<"\n";
P.S.:-This is the solution of Problem 1392D Omkar and Bed Wars recently asked in Global Codeforces round 10.Please help me:(
Name |
---|