Pagini recente » Cod sursa (job #1071910) | Cod sursa (job #512557) | Cod sursa (job #2239509) | Cod sursa (job #414673) | Cod sursa (job #254283)
Cod sursa(job #254283)
#include<string.h>
#include<fstream.h>
int main()
{
ifstream f("episoade.in");
ofstream g("episoade.out");
char a[1001];
int t,n,i,k=1,l,p[1000],ok,j,nr;
struct {int x,y;}sol[1000];
f.get(a,1000);
f.get();
f>>t>>n;
for(i=0;i<strlen(a);i++)
if(a[i]=='>')
{
j=i-1;
nr=0;
while(a[j]>='0'&&a[j]<='9')
j--;
for(l=j+1;l<=i-1;l++)
nr=nr*10+(a[l]-48);
sol[k].x=nr;
nr=0;
j=i+1;
while(a[j]<='9'&&a[j]>='0')
{ nr=nr*10+(a[j]-48);
j++;
}
sol[k++].y=nr;
//sol[k].x=(a[i-1]-48);
//sol[k].y=(a[i+1]-48);
//k++;
}
for(l=1;l<=t;l++)
{
for(i=1;i<=n;i++)
f>>p[i];
ok=0;
for(i=1;i<k;i++)
{
ok=0;
for(j=1;j<=n;j++)
if(sol[i].x==p[j]&&sol[i].y==p[j+1])
ok=1;
if(ok==0)
break;
}
g<<ok<<"\n";
}
return 0;
}