Gold Balanced Lineup Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12334 Accepted: 3618 Description Farmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ has

#include<stdio.h>#include <iostream>#include <string.h>using namespace std;const int MAX = 100010;const int Mod = 1001007;int Hash[Mod+100];int sum[MAX][40],cmp[MAX][40];int n,k;int has(int *s)//