Algorithms/Make_It.cpp at main · MohammadFahad1/Algorithms · 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
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
bool vis[N];

bool bfs(int src, int target)
{
    queue<int> q;
    q.push(src);
    vis[src] = true;

    while (!q.empty())
    {
        int front = q.front();
        q.pop();

        if (front == target)
            return true;

        if (front * 2 < N && !vis[front * 2])
        {
            q.push(front * 2);
            vis[front * 2] = true;
        }
        if (front + 3 < N && !vis[front + 3])
        {
            q.push(front + 3);
            vis[front + 3] = true;
        }
    }

    return false;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        memset(vis, false, sizeof(vis));

        int x;
        cin >> x;
        if (bfs(1, x))
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
}