Repository navigation
Expand file tree
/
Copy pathtemplate.cpp
More file actions
62 lines (53 loc) · 1.61 KB
/
Copy pathtemplate.cpp
File metadata and controls
62 lines (53 loc) · 1.61 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
56
57
58
59
60
61
62
// Bismillahir rahmanir rahim
// Arman Hossain C193033
// Programming is fun with emotion
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<ll>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vpi = vector<pair<int, int>>;
using vvs = vector<vector<string>>;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(s) (s).length()
#define digits(x) trunc(log10(x)) + 1
#define all(x) (x).begin(), (x).end()
#define sumvec(x) accumulate((x).begin(), (x).end(), 0)
#define rev_sort(x) sort((x).begin(), (x).end(), greater<int>())
#define uniq_element(x) unique((x).begin() , (x).end()) - (x).begin()
#define maxelement(x) max_element((x).begin(), (x).end()) - (x).begin()
#define minelement(x) min_element((x).begin(), (x).end()) - (x).begin()
#define uptolow(x) transform((x).begin(), (x).end(), (x).begin(), :: tolower);
#define lowtoup(x) transform((x).begin(), (x).end(), (x).begin(), :: toupper);
int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
bool cmp(pair<int,int>a, pair<int,int>b) {
if(a.first != b.first)
return a.first < b.first;
else
return a.second > b.second;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("F:input.txt", "r", stdin);
freopen("F:output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while(t--) {
ll count = 0, sum = 0;
bool flag = true, f = 1;
}
return 0;
}