[洛谷Java解题分享]入门P1047 [NOIP2005 普及组] 校门外的树

import java.util.HashSet;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner reader=new Scanner(System.in);
        int l=reader.nextInt();
        int m=reader.nextInt();
        int group[][]=new int[m][2];
        for (int i=0;i<m;i++){
            group[i][0]=reader.nextInt();
            group[i][1]=reader.nextInt();

        }
        HashSet<Integer> map=new HashSet<>();
        for (int i=0;i<m;i++){
            for (int j=group[i][0];j<=group[i][1];j++){
                map.add(j);
            }
        }
        System.out.println(l+1-map.size());
    }
}