Breaking News: Grepper is joining You.com. Read the official announcement!

nice pairs codechef solution

Kshitij Sharma answered on August 18, 2022 Popularity 7/10 Helpfulness 5/10

answer nice pairs codechef solution

nice pairs codechef solution

Comment

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll t;
    cin >> t;
    while (t--)
    {
        ll n;
        cin >> n;
        string s;
        cin >> s;
        ll ans = 0;
        for (ll i=0; i<n; i++)
        {
            ll temp = min(i+9, n-1);
            for (ll j=i+1; j<=temp; j++)
            {
                if (abs(s[j]-s[i]) == j-i)
                {
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}

Popularity 7/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: c++ nice solution

Link to this answer
Share Copy Link

Contributed on Aug 18 2022

Kshitij Sharma

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

nice pairs codechef solution

Contents

More Related Answers

nice pairs codechef solution

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.