Solution:
/*************************************
******** Team : BUBT_HIDDEN **********
**************************************
*********** Shipu Ahamed *************
*************************************/
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define ll long long
#define sc scanf
#define pf printf
#define pi 2*acos(0.0)
#define ft first
#define se second
#define st(s) s.size();
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define Sort(v) sort(v.begin(),v.end())
#define un(v) Sort(v), v.erase(unique(v.begin(),v.end()),v.end())
#define cover(a,d) memset(a,d,sizeof(a))
using namespace std;
int main()
{
input;
output;
int t,s,b[100000];
while(sc("%d",&t)==1)
{
if(t==0)
break;
vectorv;
int f=0;
while(1)
{
for(int i=0;ist;
int c=0;
s=v.size();
for(int i=0;it)
break;
}
v.clear();
if(!st.empty()){
pf("No\n");
}
else
pf("Yes\n");
}
}
return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/514/514.cpp