Pagini recente » Cod sursa (job #1742078) | Cod sursa (job #2672331) | Cod sursa (job #1775046) | Cod sursa (job #249726) | Cod sursa (job #133787)
Cod sursa(job #133787)
#include<fstream.h>
int main()
{int n,i,j,min[8001],max[8001],nr=0,a;
ifstream f("reactivi.in");
ofstream g("reactivi.out");
f>>n; nr=n;
for(i=1;i<=n;i++)
f>>min[i]>>max[i];
for(i=1;i<n;i++)
{a=1;
for(j=i+1;j<=n && a;j++)
if(min[i]<=min[j] && max[i]>=max[j] && a)
{ a=0; nr--;}
else if(min[j]<=min[i] && max[j]>=max[i] && a)
{min[j]=min[i]; max[j]=max[i]; a=0; nr--;}
else if(min[i]>=min[j] && min[i]<=max[j] && a)
{min[j]=min[i];
a=0; nr--;}
else if(max[i]<=max[j] && max[i]>=min[j] && a)
{max[j]=max[i];
a=0; nr--;}; }
g<<nr;
f.close(); g.close();
return 0;
}