Pagini recente » Cod sursa (job #1377001) | Cod sursa (job #1741755) | Cod sursa (job #1796544) | Cod sursa (job #2123852) | Cod sursa (job #156211)
Cod sursa(job #156211)
#include<fstream.h>
int mat[4001][2],tt,n;
int gasit(int m)
{ int k,i;
for(k=1;k<=n;k++)
for(i=mat[k][1];i<mat[k][2];i++)
if(i==m) return 1;
return 0;
}
int main(void)
{ int min,max,i,tt,k,act;
ifstream in("heavymetal.in");
in>>n>>min>>max;
mat[1][1]=min;
mat[1][2]=max;
for(i=2;i<=n;i++)
{ in>>mat[i][1];
if(mat[i][1]<min)min=mat[i][1];
in>>mat[i][2];
if(mat[i][2]>max)max=mat[i][2];
}
in.close();
ofstream out("heavymetal.out");
act=min+1;
tt=1;
while(act!=max)
{ if(gasit(act)) tt++;
act++;
}
out<<tt;
out.close();
return 0;
}