-
Notifications
You must be signed in to change notification settings - Fork 0
/
template.cpp
153 lines (128 loc) · 2.93 KB
/
template.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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define MOD 1000000007
#define MOD1 998244353
#define vsz 200005
#define ff first
#define ss second
#define REP(i,a,n) for(ll i=a;i<n;i++)
#define REPR(i,n,a) for(ll i=n;i>a;i--)
#define mp make_pair
#define pll pair<ll,ll>
#define ppll pair<ll,pair<ll,ll>>
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
// #define gcd(a,b) __gcd(a,b)
// #define lcm(a,b) (a*(b/gcd(a,b)))
void init_code(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
ll gcd(ll a, ll b){
if(b==0){
return a;
}
return gcd(b,a%b);
}
ll lcm(ll a, ll b){
return a*(b/gcd(a,b));
}
ll neg_mod(ll a, ll b){
ll r=a%b;
return r<0 ? r+b : r;
}
ll new_ceil(ll a, ll b){
return (a+b-1)/b;
}
ll mod_pow(ll base, ll exp, ll mod){
ll ans=1;
while(exp){
if(exp%2==0){
base=(base*base)%mod;
exp/=2;
}else{
ans=(ans*base)%mod;
exp--;
}
}
return ans%mod;
}
// SIEVE //
// const ll maxN=1000000;
// ll prime[maxN+1];
// void sieve(){
// prime[0]=prime[1]=1;
// for(ll i=2;i<=maxN;i++){
// if(prime[i]==0){
// for(ll j=i*i;j<=maxN;j+=i){
// prime[j]=1;
// }
// }
// }
// }
// SEGMENT TREE //
// vector<ll> a;
// vector<ll> tree;
// void build(ll node, ll start, ll end){
// if(start==end){
// tree[node]=a[start];
// return;
// }
// ll mid=start+((end-start)/2);
// build(2*node,start,mid);
// build(2*node+1,mid+1,end);
// tree[node]=tree[2*node]+tree[2*node+1];
// }
// ll query(ll node, ll start, ll end, ll l, ll r){
// if(start>r || end<l){
// return 0;
// }
// if(l<=start && end<=r){
// return tree[node];
// }
// ll mid=start+((end-start)/2);
// ll left=query(2*node,start,mid,l,r);
// ll right=query(2*node+1,mid+1,end,l,r);
// return left+right;
// }
// void modify_tree(ll node, ll start, ll end, ll index, ll val){
// if(start==end){
// tree[node]=val;
// return;
// }
// ll mid=start+((end-start)/2);
// if(index<=mid){
// modify_tree(2*node,start,mid,index,val);
// }else{
// modify_tree(2*node+1,mid+1,end,index,val);
// }
// tree[node]=tree[2*node]+tree[2*node+1];
// }
// GRID //
// vector<int> d4x {0,1,0,-1};
// vector<int> d4y {-1,0,1,0};
// vector<int> d8x {0,1,1,1,0,-1,-1,-1};
// vector<int> d8y {-1,-1,0,1,1,1,0,-1};
void solve(){
}
int main(){
fast_io;
init_code();
ll t=1;
cin>>t;
// ll a=t;
while(t--){
// cout<<"Case #"<<a-t<<": ";
solve();
}
return 0;
}