Submission #58669281

---

Source Code Expand

/** SmartCoder **/
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace __gnu_pbds;
using namespace std;

#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define minei(x) min_element(x.begin(), x.end()) - (x).begin()
#define maxei(x) max_element(x.begin(), x.end()) - (x).begin()
#define LSOne(S) (S & (-S))

#define uns(v) sort((v).begin(), (v).end()), v.erase(unique(v.begin(), v.end()), v.end())
#define acusum(x) accumulate(x.begin(), x.end(), 0ll)
#define bits(x) __builtin_popcount(x)
#define inf 1000000000
#define MAXN 1000000
#define MOD 100000000
#define debug(x) cerr << (#x) << " = " << (x) << '\n';
typedef long long ll;

const double pi = acos(-1.0);
const double eps = 1e-11;

void _solve()
{
    int n, res = 0;
    string s;
    cin >> n >> s;
    for (int i = 0; i < n - 2; i++)
    {
        res += (s[i] == '#' && s[i + 2] == '#' && s[i + 1] == '.');
    }
    cout << res << "\n";
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        _solve();
    }

    return 0;
}

Submission Info

Judge Result