Educational Codeforces Round 62 (Rated for Div. 2) B Good String

题意：(题意引自牛逼网友)

给一个由'>' '<' 组成的字符串，对于'>'可以删除这个字符右边的字符（想到这里，如果'>'在最左边，岂不是可以一次性把右边所有的全部删除），同样，对于'<'可以删除这个字符左边的字符（如果'<'在最右边，也可以将其左边所有的字符全部删除)，题目要求通过上面两种变化使得整个字符串只剩下一个字符'>‘或'<'
 

题解:

min(左边">"前面符号的数量，右边"<"后面符号的数量)

水题一个，题意懂了，就会了...

 

AC代码：

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
using namespace std;
#define int long long 

const int maxn=2e5+5;

signed main(){
    int t;cin>>t;
    while(t--){
        int n;cin>>n;
        string s;cin>>s;
        int one=0;int two=0;
        for(int i=0;i<s.size();i++){//for left
            if(s[i]=='<')one++;
            else break;
        }
        
        for(int i=s.size()-1;i>=0;i--){//for right
            if(s[i]=='>')two++;
            else break;

        }
        cout<<min(one,two)<<endl;//for min
    }
    return 0;
}

B. Good String

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You have a string ss of length nn consisting of only characters > and <. You may do some operations with this string, for each operation you have to choose some character that still remains in the string. If you choose a character >, the character that comes right after it is deleted (if the character you chose was the last one, nothing happens). If you choose a character <, the character that comes right before it is deleted (if the character you chose was the first one, nothing happens).

For example, if we choose character > in string > > < >, the string will become to > > >. And if we choose character < in string > <, the string will become to <.

The string is good if there is a sequence of operations such that after performing it only one character will remain in the string. For example, the strings >, > > are good.

Before applying the operations, you may remove any number of characters from the given string (possibly none, possibly up to n−1n−1, but not the whole string). You need to calculate the minimum number of characters to be deleted from string ss so that it becomes good.

Input

The first line contains one integer tt (1≤t≤1001≤t≤100) – the number of test cases. Each test case is represented by two lines.

The first line of ii-th test case contains one integer nn (1≤n≤1001≤n≤100) – the length of string ss.

The second line of ii-th test case contains string ss, consisting of only characters > and <.

Output

For each test case print one line.

For ii-th test case print the minimum number of characters to be deleted from string ss so that it becomes good.

Example

input

Copy

3
2
<>
3
><<
1
>

output

Copy

1
0
0

Note

In the first test case we can delete any character in string <>.

In the second test case we don't need to delete any characters. The string > < < is good, because we can perform the following sequence of operations: > < < →→ < < →→ <.