Pagini recente » Cod sursa (job #1588719) | Cod sursa (job #2460770) | Cod sursa (job #1015883) | Cod sursa (job #1289162) | Cod sursa (job #25091)
Cod sursa(job #25091)
#include<stdio.h>
#define dim 1024
void solve();
void write();
long a[dim],i,j,n,m,k,r,sol1[dim],sol2[dim],nrs1,nrs2;
int main()
{
freopen("balanta.in","r",stdin);
freopen("balanta.out","w",stdout);
printf("0");
return 0;
}
/*void solve()
{
scanf("%ld%ld",&n,&m);
for(j=1;j<=m;j++)
{
scanf("%ld",k)
for(i=1;i<=k;i++)
{
if(i<=k/2)
scan("%ld",&a[i]);
else
scanf("%ld",&b[k-i]);
}
scanf("%ld",r);
if(r==1)
for(i=1;i<=k/2;i++)
sol1[a[i]]=1;
if(r==2)
for(i=1;i<=k/2;i++)
sol2[b[i]]=1;
if(!r)
for(i=1;i<=k;i++)
{
if(i<=k/2)
sol1[a[i]]=0;
else
sol2[b[k-i]]=0;
}
}
} */