1 solutions
-
0
C :
#include<stdio.h> struct R { double xmin,xmax,ymin,ymax; }r[10000]; int main() { int n,i,j,c; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%lf%lf%lf%lf",&r[i].xmin,&r[i].xmax,&r[i].ymin,&r[i].ymax); for(c=i=0;i<n;i++) for(j=0;j<n;j++) if(i!=j&&r[i].xmin>=r[j].xmin&&r[i].xmax<=r[j].xmax&&r[i].ymin>=r[j].ymin&&r[i].ymax<=r[j].ymax) { c++; break; } printf("%d\n",c); } return 0; }C++ :
#include<stdio.h> struct R { double xmin,xmax,ymin,ymax; }r[10000]; int main() { int n,i,j,c; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%lf%lf%lf%lf",&r[i].xmin,&r[i].xmax,&r[i].ymin,&r[i].ymax); for(c=i=0;i<n;i++) for(j=0;j<n;j++) if(i!=j&&r[i].xmin>=r[j].xmin&&r[i].xmax<=r[j].xmax&&r[i].ymin>=r[j].ymin&&r[i].ymax<=r[j].ymax) { c++; break; } printf("%d\n",c); } return 0; }Java :
import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner in=new Scanner(System.in); while(in.hasNext()){ int n=in.nextInt();double[][] a=new double[n][4]; for(int u=0;u<n;u++){ for(int w=0;w<4;w++){ a[u][w]=in.nextDouble(); } }int c=0; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(i!=j&&a[i][0]>=a[j][0]&&a[i][1]<=a[j][1]&&a[i][2]>=a[j][2]&&a[i][3]<=a[j][3]) { c++; break; } } }System.out.println(c);}} }
- 1
Information
- ID
- 20048
- Time
- 1000ms
- Memory
- 32MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By