Pagini recente » Cod sursa (job #1387315) | Cod sursa (job #332921) | Cod sursa (job #1875832) | Cod sursa (job #272201) | Cod sursa (job #253880)
Cod sursa(job #253880)
#include<fstream.h>
int sol1[110],sol2[110],ok,a[110],k=1,poz[110],n=1,m,i,j,p,q;
char c;
int main()
{
ifstream f("episoade.in");
ofstream g("episoade.out");
poz[1]=1;
f.get(c);
while(c!='\n')
{ if(c=='#') {poz[++k]=n+1; n++;}
else if(c=='>') n++;
else sol1[n]=sol1[n]*10+(c-48);
f.get(c);
}
poz[++k]=n+1;
for(i=k-1;i>0;i--)
{ p=poz[i]; q=poz[i+1];
for(j=p;j<q;j++)
sol2[++m]=sol1[j];
}
f>>m>>n;
for(j=1;j<=m;j++)
{ for(i=1;i<=n;i++) f>>a[i]; ok=1;
for(i=1;i<=n;i++) if(a[i]!=sol1[i]) {ok=0; break;}
if(!ok)
{
ok=1; for(i=1;i<=n;i++) if(a[i]!=sol2[i]) {ok=0; break;}
}
g<<ok<<'\n';
}
f.close();
g.close();
return 0;
}