Match makers : HackerEarth Problem Solution

Match makers : HackerEarth Problem Solution

Input:

2
4
1 6 9 12
4 12 3 9
4
2 2 2 2
2 2 2 2

Output:

2
4

Implementation:

#include <stdio.h> #define MAX 1000000 int main() { int B[MAX],G[MAX]; int t,N,i,count,j,temp; scanf("%d",&t); while(t--) { count=0; scanf("%d",&N); for(i=0;i<N;i++) { scanf("%d",&B[i]); } for(i=0;i<N;i++) { scanf("%d",&G[i]); } for(i=0;i<N;i++) for(j=i+1;j<N;j++) { if(B[i]<B[j]) continue; else { temp=B[i]; B[i]=B[j]; B[j]=temp; } } for(i=0;i<N;i++) for(j=i+1;j<N;j++) { if(G[i]>G[j]) continue; else { temp=G[i]; G[i]=G[j]; G[j]=temp; } } for(i=0;i<N;i++) if((B[i]%G[i])==0 || (G[i]%B[i])==0) count++; printf("%d\n",count); } return 0; }