思路:最开始想了一些很傻逼的思路,弄了好久都没过
用一个二维数组承接,对于范围内的就赋值为1,最后统计等于1的个数。
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[][] mj = new int[101][101];
int x1=0,x2=0,y1=0,y2=0,count=0;
for (int i = 0;i<n;i++){
x1=input.nextInt();
y1=input.nextInt();
x2=input.nextInt();
y2=input.nextInt();
for (int j = y1;j<y2;j++){
for (int k = x1; k < x2;k++){
mj[j][k]=1;
}
}
}
for (int i =0;i<101;i++){
for (int j = 0; j <101;j++){
if (mj[i][j]==1){
count++;
}
}
}
System.out.println(count);
}
}
原题链接:http://118.190.20.162/view.page?gpid=T15