Competitive_Programming/DCEPC504.cpp at master · apsc/Competitive_Programming · GitHub

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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<stdio.h>
#include<conio.h>
long long a[1000];
long long min(long long a, long long b)
{
     if(a<b)
     return a;
     else return b;
     }
int main()
{
                    int i,t;
                    scanf("%d",&t);
while(t--)
{
    long long n,n1,level,k;
    scanf("%lld%lld",&level,&n);
/*    k=1;
    level--;
    if(level<=51)
    {
                 for(i=1;i<=level;i++)
                 k*=2;
                 printf("%lld\n",k);
                 k=min(k,n);
                 }
    else
    k=n;
    n=k;*/
    if(n==1)
    {
            printf("Male\n");continue;}
    if(n==2)
    {
            printf("Female\n");continue;}
    n1=n;
    int cnt=0;
    while(n1!=2)
    {
                if(n1&1)
                {
                        n1=(n1+1)/2;
                        a[cnt++]=n1;
                }
                else
                {
                    n1=n1/2;
                    a[cnt++]=n1;
                    }
                    }
//    for(i=0;i<cnt;i++)
  //  printf("%lld ",a[i]);
    int flag=0;
    for(i=0;i<cnt;i++)
    {
                      if(a[i]%2==0)
                      flag^=1;
                      }
    if(n&1)
    {}
    else
    flag^=1;
    //printf("%d\n",flag);
    if(flag==0)
    printf("Male\n");
    else
    printf("Female\n");
}
    getch();
}