Algorithm
Diamonds and Sand
By Neilor Tonin, URI 
Brazil
John is working in a diamond mine, trying to extract the highest number of diamond "<>". He must exclude all sand particles found "." in this process and after a diamond can be extracted, new diamonds can be formed. If he has as an input. <... << .. >> ....> .... >>>. three diamonds are formed. The first is taken from <..> resulting. <... <> ....> .... >>>. The second diamond is then removed, leaving. <.......> .... >>>. The third diamond is then removed, leaving at the end ..... >>>. without the possibility of extracting new diamonds.
Input
Read an integer N that is the number of test cases. Then follows N lines each up to 1000 characters, including "<" ,">" and "."
Output
You must print the amount of diamonds that can be extrated in each test case.
| Input Sample | Output Sample |
|
2 |
3 |
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <iostream>
using namespace std;
int main() {
int n, size, counter, tmp;
string s;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s;
size = s.length();
counter = 0;
tmp = 0;
for (int j = 0; j < size; ++j) {
if(s[j] == '<'>
tmp++;
if (s[j] == '>' && tmp > 0) {
counter++;
tmp--;
}
}
cout << counter << endl;
}
return 0;
}
Input
Output