1569A - Balanced Substring - CodeForces Solution

implementation *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n = int(input())
    s = input()
    for i in range(n-1):
        if s[i] != s[i+1]:
            print(i+1, i+2)
            break
    else:
            print("-1 -1")

C++ Code: 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
#ifdef ONLINE_JUDGE
#define dbg(...)
#else
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug = true, dbg_out(__VA_ARGS__), debug = false
#endif
int main(){
    int t; cin>>t;
    while(t--){
        int n; cin>>n; string s; cin>>s; int f=0,k;
        for(int i=0;i<n-1;i++){
            if(s[i]+s[i+1]==195){
                f=1;k=i; break;
            }
        }
        if(f)
        cout<<k+1<<" "<<k+2<<"\n";
        else
        cout<<"-1 -1\n";
        
    }
}


Comments

Submit
0 Comments
More Questions

Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree