-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
48 lines (47 loc) · 1.11 KB
/
C.cpp
File metadata and controls
48 lines (47 loc) · 1.11 KB
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
/*
© 2020-09-04 09:35:02 Franco1010 All Rights Reserved
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
#define deb(x) cout << #x": " << (x) << endl;
void solve(){
lli n, x, y; cin >> n >> x >> y;
fore(i, 1, 51){
fore(j, 1, 51){
bool y1 = false, y2 = false;
lli cnt = n;
for(lli k = j; cnt--; k += i){
// cout << k << ' ';
if(k == x) y1 = true;
if(k == y) y2 = true;
}
// cout << ENDL;
if(y1 and y2){
cnt = n;
for(lli k = j; cnt--; k += i) cout << k << ' '; cout << ENDL;
return;
}
}
}
}
int main(){ _
lli t; cin >> t;
while(t--){
solve();
}
return 0;
}