Pagini recente » Cod sursa (job #1955648) | Cod sursa (job #2365178) | Cod sursa (job #572371) | Cod sursa (job #1448516) | Cod sursa (job #25306)
Cod sursa(job #25306)
#include <fstream.h>
int maimari[1024];
int nmm=1024;
int n,m,k,r;
int cant[2048];
void cauta(int *mul,int q){
int x=nmm,m[1024],c=0,i,j;
for(i=0;i<q;i++)
for(j=0;j<x;j++)
if(maimari[j]==mul[i]){
m[c]=maimari[j];
c++;
break;
}
for(i=0;i<c;i++) maimari[i]=m[i];
nmm=c;
}
int main(){
ifstream f("balanta.in");
f>>n>>m;
int mul[1024],q,p;
//initializare
for(int i=0;i<1024;i++) maimari[i]=i+1;
for(i=0;i<m;i++){
f>>k;
for(int j=0;j<k*2;j++) f>>cant[j];
f>>r;
if(r==1) for(p=0;p<k;p++){ mul[p]=cant[p]; q=k; }
if(r==2) for(p=0;p<k;p++){ mul[p]=cant[p+k]; q=k; }
if(r==1||r==2) cauta(mul,q);
}
f.close();
ofstream g("balanta.out");
if(nmm==0) g<<0;
else g<<maimari[0];
g.close();
return 0;
}