Pagini recente » Diferente pentru happy-coding-2005-2/solutii intre reviziile 11 si 12 | Cod sursa (job #1995213) | Borderou de evaluare (job #1970338) | Cod sursa (job #159556) | Cod sursa (job #128351)
Cod sursa(job #128351)
#include<fstream.h>
int main()
{ unsigned long n,m,k,i;
struct { unsigned long x1,x2;}v[100000];
ifstream f("stergeri.in");
ofstream g("stergeri.out");
f>>n>>m>>k;
for(i=1;i<=m;i++)
f>>v[i].x1>>v[i].x2;
for(i=m;i>=1;i--)
if(v[i].x1<k)
k+=(v[i].x2-v[i].x1)+1;
g<<k;
return 0;
}