Cod sursa(job #253781)
Utilizator | Patru Ovidiu Roflmao | Data | 6 februarie 2009 12:25:14 |
---|---|---|---|
Problema | Episoade | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Marime | 0.55 kb |
#include<iostream.h>
#include<fstream.h>
#include<string.h>
int main()
{
char x[1200];
int n,t,i,j,k,a[200],s;
fstream f,g;
f.open("episoade.in",ios::in);
g.open("episoade.out",ios::out);
f.getline(x,1100);
f>>t>>n;
for(k=1;k<=t;k++)
{
s=1;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-1;i++)
{
for(j=0;j<=n;j++)
if(x[j]==a[i]+48)
break;
if(x[j+1]=='>'&&a[i+1]+48!=x[j+2])
{
s=0;
break;
}
}
g<<s<<endl;
}
f.close();
g.close();
return 0;
}