codeforces 1140B（水题）

codeforces 1140B

You have a string s of length n 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 \le t \le 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 \le n \le 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

3
2
<>
3
><<
1
>

Output

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: > < < \rightarrow→ < < \rightarrow→ <.

题目大意：
如果选择 ”>“就删除这个字符的后面一个，如果选择 ”<“就删除这个字符的前面一个。从字符串中删除最小字符数s，让选择后字符串中将仅保留一个字符
题解：
先删除后选择操作
（1）如果是这样的字符串”>XXXXXXX“ ，因为第一个是”>“ 所以不用删除，一直选择第一个字符就是good string。
（2）如果是这样的字符串”XXXXXXX<“ ，因为最后一个是”<“ 所以不用删除，一直选择最后一个字符就是good string。
（3）如果第一个字符不是">"，最后一个字符不是"<" ，我们可以从头遍历找到">",累计要删除的个数 L, 从后面遍历找到"<",累计要删除的个数R,比较L和R 输出最小的那个。

#include<stdio.h>
int main() {
	int t;
	scanf("%d",&t);
	while(t--) {
		int n;
		scanf("%d",&n);
		char a[150];
		scanf("%s",a);
		//(1) (2)
		/*if(a[0]=='>'||a[n-1]=='<') {
			printf("0\n");
			continue;
		}*/ //可以不要（第(3)种包含（1）（2））
		//（3）
		int l=0,r=0;
		for(int i=0; i<n; i++) {
			if(a[i]=='>') {
				break;
			}
			l++;
		}
		for(int i=n-1; i>=0; i--) {
			if(a[i]=='<') {
				break;
			}
			r++;
		}
		l<r ? printf("%d\n",l):printf("%d\n",r);
	}
}