Pagini recente » Cod sursa (job #835045) | Cod sursa (job #2844830) | Cod sursa (job #248128) | Cod sursa (job #2610746) | Cod sursa (job #656021)
Cod sursa(job #656021)
#include <fstream>
using namespace std;
ifstream f("episoade.in");
ofstream g("episoade.out");
long long i,j,A[1005],poz,t,ok,v[10005],n,n2,p, w,q;
string s;
int main()
{
f>>s;
n2=s.length();
while (w<n2-1)
{
q++,ok=0;
if (s[w]=='>')
{
v[q]=-1;
w++;
ok=1;
}
if (s[w]=='#'&&ok==0)
{
v[q]=-3,w++;
ok=1;
}
while (ok==0&&s[w]<='9'&&s[w]>='0'&&w<n2-1)
{
v[q]=s[w]-'0';
w++;
}
}
f>>t>>n;
n2=q;
for(p=1; p<=t; p++)
{
ok=0;
for(i=1; i<=n; i++)
{
f>>A[i],poz=0;
for(j=1; j<=n2; j++)
{
if (v[j]==A[i]&&v[j-1]==-1)
if (v[j-2]!=A[i-1]) ok=1;
}
}
if (ok==0) g<<1<<'\n';
else g<<0<<'\n';
}
f.close();
g.close();
return 0;
}