POJ 2665 Trees
2007-05-16 19:43
225 查看
#include<stdio.h>
#define MAX_M 5000
int a[MAX_M][2];
int main()
{
int l, m, i, k;
while(scanf("%d", &l) && scanf("%d", &m))
{
if(!l && !m)
break;
k = 0;
for(i=0; i<m; i++)
{
scanf("%d", a[i]);
scanf("%d", a[i]+1);
}
k = l + 1;
for(i=0; i<m; i++)
{
k -= (a[i][1] - a[i][0] + 1);
}
printf("%d/n", k);
}
return 0;
}
相关文章推荐
- POJ 2665 Trees(我的水题之路——移树,POJ100题啦!)
- POJ 2665 Trees
- poj2665 Trees!
- POJ 2665 Trees(水~)
- POJ 2665 Trees(水题)
- POJ 2665 Trees 水
- poj 2665 Trees
- POJ2665 Trees
- (7.3.18)POJ 2665 Trees(原本打算用线段树做的,后来看了一下题目,如同当头一棒)
- poj 2665 Trees
- POJ 2029 Get Many Persimmon Trees [dp]
- zoj 1716 || poj 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees
- poj 2029 Get Many Persimmon Trees
- POJ 1105 S-Trees (模拟)
- POJ 2104 | HDU 2665 - K-th Number (划分树)
- POJ 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees
- poj 2029 Get Many Persimmon Trees
- poj 1095 Trees Made to Order