-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy path1155C. Alarm Clocks Everywhere.cpp
133 lines (111 loc) · 4.5 KB
/
1155C. Alarm Clocks Everywhere.cpp
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/***
Bismillahir Rahmanir Rahim
Read in the name of Allah, who created you!!!
Author : Shah Newaj Rabbi Shishir,
Department of CSE, City University, Bangladesh.
***/
#include <bits/stdc++.h>
using namespace std;
#define jeno_joyer_khuda_thake int main (void)
#define kaj_shesh return 0
#define sf scanf
#define pf printf
#define ssf sscanf
#define spf sprintf
#define fsf fscanf
#define fpf fprintf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define whilecase while (tc--)
#define sn sf ("%d",&n)
#define eof while (cin >> n)
#define pcase pf ("Case %d: ",pos)
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define for0(i,n) for (i=0; i<n; i++)
#define for1(i,n) for (i=1; i<=n; i++)
#define forab(i,a,b) for (i=a; i<=b; i++)
#define rof0(i,n) for (i=n-1; i>=0; i--)
#define rof1(i,n) for (i=n; i>=1; i--)
#define rofab(i,a,b) for (i=b; i>=a; i--)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define vi vector <int>
#define vlld vector <lld>
#define si set <int>
#define slld set <lld>
#define ss set <string>
#define vs vector <string>
#define pii pair <int,int>
#define mii map <int,int>
#define msi map <string,int>
#define pb push_back
#define in insert
#define B begin()
#define E end()
#define F first
#define S second
#define iterate(it,x) for (it=x.B; it!=x.E; it++)
#define sortFull(x) sort (x.B,x.E)
#define sortRange(x,a,b) sort (x.B+a,x.B+b+1)
#define revFull(x) reverse (x.B,x.E)
#define revRange(x,a,b) reverse (x.B+a,x.B+b+1)
#define endl "\n"
const int MOD = 1000000007;
const int MAX = 105;
const double PI = acos(-1.0);
int SetBit (int n, int X) { return n | (1 << X); }
int ClearBit (int n, int X) { return n & ~(1 << X); }
int ToggleBit (int n, int X) { return n ^ (1 << X); }
bool CheckBit (int n, int X) { return (bool)(n & (1 << X)); }
lld gcd (lld a, lld b)
{
if (b == 0)
return a;
return gcd (b, a%b);
}
jeno_joyer_khuda_thake
{
/*
freopen ("input.txt","r",stdin);
freopen ("output.txt","w",stdout);
*/
int n,m,i,k;
lld g,q;
while (sf ("%d %d",&n,&m) != EOF)
{
vlld x(n),p(m),v(n-1);
for (i=0; i<n; i++)
sf ("%lld",&x[i]);
for (i=0; i<m; i++)
sf ("%lld",&p[i]);
for (i=0; i<n-1; i++)
v[i] = x[i+1]-x[i];
if (n == 2)
g = v[0];
else
{
g = v[0];
for (i=1; i<n-1; i++)
g = gcd (g,v[i]);
}
k = 0;
for (i=0; i<m; i++)
{
if (g % p[i] == 0)
{
pf ("YES\n%lld %d",x[0],i+1);
k = 1;
break;
}
}
if (!k)
pf ("NO");
pf ("\n");
x.clear();
p.clear();
v.clear();
}
kaj_shesh;
}