tutorials/covidrun.cpp at master · amendasanta/tutorials · 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
#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define mod 1000000007

ll binpow(ll a,ll b){

    a %= mod;

    ll res = 1;

    while (b > 0) {

        if (b & 1)

            res = res * a % mod;

        a = a * a % mod;

        b >>= 1;

    }

    return res;

}

int main(){

  ll t;

  cin>>t;

  while(t--){

    ll n,k,x,y;

    cin>>n>>k>>x>>y;

    bool arr[n]={0};

    arr[x]=true;

    int f=1;

    int p=(x+k)%n;

    while(f!=n&&arr[p]!=true){

      arr[p]=true;

      if(arr[y])

        break;

      p=(p+k)%n;

    }

    if(arr[y]){

      cout<<"YES\n";

    }

    else{

      cout<<"NO\n";

    }

  }

  return 0;

}