-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathDryRun.cpp
More file actions
55 lines (51 loc) · 1.29 KB
/
DryRun.cpp
File metadata and controls
55 lines (51 loc) · 1.29 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
49
50
51
52
53
54
55
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll mod = 1000000007;
const ll inf = 1e18;
#define all(x) begin(x), end(x)
#define loop(i, n) for (int i = 0; i < n; i++)
#define print_array(arr) \
loop(z, sizeof(arr) / sizeof(arr[0])) cout << arr[z] << " "; \
cout << "\n"
#define print_vector(vvv) \
loop(z, vvv.size()) cout << vvv[z] << " "; \
cout << "\n"
#define print_vector_pair(vvv) \
loop(z, vvv.size()) cout << vvv[z].first << " "vvv[z].second<<"\n"; \
cout << "\n"
#define fill_my(arr,q) fill(all(arr),q)
void solve()
{
int arr[] = {8, 6, 47, 9, 51, 2, 3, 6, 5, 47,33};
vector<pair<int,int>> v;
int w = sizeof(arr) / sizeof(arr[0]);
for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++)
{
v.emplace_back(arr[i],arr[i+1]);
}
//fill_my(arr,5);
//print_vector_pair(v);
for (int i = 0; i < w; i++)
{
cout<<v[i].first<<" "<<v[i].second<<"\n";
}
}
int main()
{
clock_t time_req;
time_req = clock();
cin.sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--)
{
solve();
}
time_req = clock() - time_req;
cout << "Processor time " << (float)time_req / CLOCKS_PER_SEC
<< " sec" << endl;
return 0;
}