SCHOOL OF CODE BUILDERS
Learn To CODE. Become A DEVELOPER.
Pages
HOME
DATA STRUCTURES
STRINGS
ARRAYS
MATRIX
BINARY TREES
LINKED LIST
STACK
QUEUE
SORTING
SEARCHING
C
PYTHON
PSEUDOCODE
CONTEST PROBLEMS
ALGORITHMS
PATTERNS
PHP
C PUZZLES
C INTERVIEW QUESTIONS
JAVA
C++
HASHING
RECURSION
BASIC C PROGRAMS
TCS-CODEVITA
FACEBOOK
CONTACT US
ICPC Team Management : HackerEarth Problem Solution
ICPC Team Management : HackerEarth Problem Solution
#include
#include
#define MAX 1000000 #define MIN 10000 using namespace std; int main() { long int T,N,K,hash[100]={0},arr[MAX],no[MAX]; char str[MIN]; scanf("%ld",&T); while(T--) { scanf("%ld %ld",&N,&K); long int i=0,u=0,j=0; long int quo=N/K; while(N--) { cin>>str; arr[i++]=strlen(str); if(hash[arr[i-1]]==0) { no[j++]=arr[i-1]; u++; hash[arr[i-1]]++; } if(hash[arr[i-1]]==K) hash[arr[i-1]]=0; } for(i=0;i
1) cout<<"Not possible\n"; else if(K==1) cout<<"Possible\n"; else if(quo==u) cout<<"Possible\n"; else cout<<"Not possible\n"; } return 0; }
PREVIOUS
NEXT
HOME