#include<bits/stdc++.h>
using namespace std;
int main()
{
int T,c=1;
// freopen("check.txt","r",stdin);
scanf("%d",&T);
while(T--)
{
string str,web,current;
stack<string> backsite,forsite;
current = "http://www.lightoj.com/";
printf("Case %d:\n",c++);
while(1)
{
cin >> str;
if(str == "QUIT")
break;
if(str == "VISIT")
{
cin >> web;
backsite.push(current);
current = web;
while(!forsite.empty())
forsite.pop();
}
else if(str == "BACK")
{
if(backsite.empty())
{
printf("Ignored\n");
continue;
}
else
{
forsite.push(current);
current = backsite.top();
backsite.pop();
}
}
else
{
if(forsite.empty())
{
printf("Ignored\n");
continue;
}
else
{
backsite.push(current);
current = forsite.top();
forsite.pop();
}
}
cout << current << endl;
}
}
return 0;
}
Thursday, July 30, 2015
1113 - Discover the Web
Subscribe to:
Post Comments (Atom)
Triathlon
Triathlon - CodeChef # include < bits/stdc++.h > using namespace std ; # define fi first # define se second # define mp ...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { int T , c = 1 ; double r1 , r2 , h , p ; // ...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { long long T , S , l , n , c = 1 ; // freopen(&qu...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { int T , n , p , q , c = 1 , i , w , t , arry [ 50 ] ; ...
No comments:
Post a Comment