1900A - Cover in Water - CodeForces Solution


constructive algorithms implementation

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
 
using namespace std;
 
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long

const int N = 2e5 + 5;
const ll MOD = 1e9 + 7;

void solve()
{   
    ll n;
    cin >> n;
    string s;
    cin >> s;
    ll cnt = 0, yes = 0;
    for (int i = 0; i < n; i++)
    {
        if (s[i] == '.')cnt++;
        if (i <= n - 3)
        {
            if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')yes = 1;
        }
    }
    if (yes)cout << "2\n";
    else cout << cnt << '\n';
    return;
}

int main()
{    
    IO
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array