Competitive-Programming-Problems/Counter Game.cpp at master · JorgeIba/Competitive-Programming-Problems · 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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include <bits/stdc++.h>
using namespace std;

stack<long long unsigned int> binarios;
long long unsigned int contador1=1;

void ContarBinario(long long unsigned int n)
{
    long long unsigned int i=1;
    long long unsigned int x=1;
    while ((x<<i)<=n)
    {
        binarios.push(x<<i);
        i++;
    }
}

void ContarUltimoBit(long long unsigned int n)
{
    long long unsigned int i=1;
    contador1=1;
    while ((n>>i)!=1)
    {
        contador1++;
        i++;
    }
}

long long unsigned int Potencia2Cercano(long long unsigned int n)
{
	while (binarios.size()!=0)
	{
		if (n>binarios.top())
		{
			return binarios.top();
		}
		else
		{

			binarios.pop();
		}
	}
	return 0;
}

bool EsONo(long long unsigned int n)
{
    bool res=true;
    res=(n&&(n&(n-1)));
    return res;
}


bool FuncionBergas()
{
    bool ganador=false;
    long long unsigned int n=0;
    cin>>n;

    ContarBinario(n);
    while (n!=1)
    {
        ganador= !ganador;

        if (EsONo(n)==false)
        {
        	ContarUltimoBit(n);
            if ((contador1%2)!=0)
            {
                return ganador;
            }
            else
            {
                return !ganador;
            }
        }
        else
        {
            n=n-Potencia2Cercano(n);
            binarios.pop();
        }
    };
    return ganador;
}

int main()
{
    ios::sync_with_stdio(false);
    int t=0;
    cin>>t;
    for (int i=0; i<t; i++)
    {
        if (FuncionBergas()==true)
        {
            cout<<"Louise\n";
        }
        else
        {
            cout<<"Richard\n";
        }
    }
    return 0;
}