Pagini recente » Cod sursa (job #2974737) | Cod sursa (job #45592) | Cod sursa (job #65434) | Cod sursa (job #583328) | Cod sursa (job #253980)
Cod sursa(job #253980)
#include<fstream.h>
#include<string.h>
int sw1=1,t,i,n,m,j,l1,l2,nxt[140],sw;
char s[1100];
int main()
{
ifstream f("episoade.in");
f>>s;
f>>t>>n;
m=strlen(s);
for (i=0;i<m;i++)
{
if ((s[i]-'0'>=0) && (s[i]-'0'<=9))
if (i<m-1)
if (s[i+1]=='>') nxt[s[i]-'0']=s[i+2]-'0';
else nxt[s[i]-'0']=0;
else nxt[s[i]-'0']=0;
if (s[i]=='(') sw1=0;
}
ofstream g("episoade.out");
if (sw1)
{
for (j=1;j<=t;j++)
{
f>>l1;
sw=1;
for (i=2;i<=n;i++)
{
f>>l2;
if ((nxt[l1]!=0) && (nxt[l1]!=l2)) sw=0;
l1=l2;
}
g<<sw<<'\n';
}
}
/*else
{
nrd=0;
max=0;
for (i=0;i<=m;i++)
if (s[i]=='(') {nrd++;if (nrd>max) max=nrd;}
else if (s[i]==')') nrd--;
nrp=0;
nr=0;
for (i=0;i<=max;i++)
{
j=0;
while (j<m)
if ((s[i]-'0'>=0) && (s[i]-'0'<=9))
{
if ((nrp==i) && (nrp==0)) {
a[++nr][0]=1;
a[nr][1]=s[j]-'0';
}
}
*/
g.close();
f.close();
return 0;
}