1 solutions
-
0
C :
#include <stdio.h> int main() { int n; scanf("%d",&n); int a[n][4]; int i; int j; for(i = 0;i < n;i ++) for(j = 0;j < 4;j ++) scanf("%d",&a[i][j]); int i1,j1; for(i1 = 0;i1 < n;i1 ++) { if((a[i1][0] == a[i1][2] && a[i1][1] == a[i1][3])||(a[i1][0] == a[i1][3] && a[i1][1] == a[i1][2])) printf("YES\n"); else printf("Sorry\n"); } return 0; }C++ :
#include<stdio.h> int main(void) { int T, a, b, m, n; scanf("%d", &T); while(T--) { scanf("%d%d%d%d", &a, &b, &m, &n); if((a==m&&b==n)||(b==m&&a==n)) printf("YES\n"); else printf("Sorry\n"); } return 0; }Pascal :
var a,b,m,n,t,i:longint; begin read(t); for i:=1 to t do begin read(a,b,m,n); if ((a=m)and(b=n)) or ((a=n)and(b=m)) then writeln('YES') else writeln('Sorry'); end; end.
- 1
Information
- ID
- 19369
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- (None)
- # Submissions
- 0
- Accepted
- 0
- Uploaded By