Ural 1654 [stack application]

Data structure, stack application!

# Include <vector> # include <list> # include <map> # include <set> # include <queue> # include <string. h> # include <deque> # include <stack> # include <bitset> # include <algorithm> # include <functional> # include <numeric> # include <utility> # include <sstream> # include <iostream> # include <iomanip> # include <cstdio> # include <cmath> # include <cstdlib> # include <limits. h> using namespace STD; # define ll long # define PI ACOs (-1) # define n 5005 # define INF int_max # define EPS 1e-8 //************************** ***************** // Ural 1654 stack //************** * ***************************** stack <char> S; int main () {freopen ("a.txt", "r", stdin); char STR [200010]; while (gets (STR) {int Len = strlen (STR ); int I, j; for (I = len-1; I> = 0; I --) {If (S. empty () {S. push (STR [I]); continue;} If (STR [I] = S. top () {S. pop ();} else if (STR [I]! = S. Top () {S. Push (STR [I]) ;}} while (! S. empty () {char c = S. top (); printf ("% C", c); S. pop () ;}printf ("\ n") ;}return 0 ;}