### PROBLEM LINK:

https://www.codechef.com/problems/GSRM01B

**Author:** Omkar Prabhu

**Tester:** Omkar Prabhu

**Editorialist:** Omkar Prabhu

### DIFFICULTY:

EASY

### PROBLEM:

You have to find the number of common occurrences of time.

### EXPLANATION:

Given two arrays A[] and B[].

For every A[i] from 1 to N, check if there is B[i].

Increment your counter, every time, you find a match.

Print your counter value.

### AUTHOR’S AND TESTER’S SOLUTIONS:

Solution: http://ideone.com/WPrczf