OJ Board

Hello,

i use your input and get the same output.. i dont know what is wrog..
someone has some others inputs?

my code:

#include <stdio.h>
#define ABS(a) ((a>0)?(a):-(a))
#define MAX 51

long long c1[MAX];
long long c2[MAX];

int main()
{
long long r;
int i, j, n;

while ( scanf("%d", &n) == 1 ...

i did some more test cases to test my problem:
2S 3S 4S 5S 6S 7H 8H 9H TH JH
5C 5C 2H 4H 6H 5C 5C 2H 4H 6H
AS KS JH TC 9S AH KS JS 9H 8C
5C 5C 2H 4H 6H 4H 4H 2C 5H 6H
7C 7C 2H 5H 6H 7H 7H 2C 4H 6H
7C 7C 3H 5H 6H 7H 7H 2C 5H 6H
7C 7C 3H 5H 6H 7H 7H 3C 5H 6H
2C 2C 4H 4H 5S 4H 4H 3S 3S 5S
2C 2C 4H 4H ...