This is a very problem.
Explanation: Elimination continues till there is a single maid remains. If number of keka maids are odd at beginning it never becomes even through the elimination process so it will reach at 1 first. And if the number of keka maids starts with even number it never becomes odd according to the elimination process. As if last two killed persons are from same tribe add a gega maid and add a keka maid only if last two killed persons are from different tribes.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
#include <iostream> #include <cstdio> #include <cstring> #include <string> #define GG 1 #define KK 2 using namespace std; int arr[2005]; int main() { int n,m,k; while(cin>>n) { cin>>m>>k; if(n+m+k==0) break; if(m%2==0) cout<<"Gared\n"; else cout<<"Keka\n"; } return 0; } |