Hoshino orz

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
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define hoshino ios::sync_with_stdio(0)
#define orz cin.tie(0)
#define osz cout.tie(0)
const int INF = 1e9;
const int MOD = 1e9+7;

inline void solve(){
    
}

signed main(){
    hoshino;
    orz,osz;
    int T = 1;
    //cin>>T;
    for(int i = 0; i<T; i++){
        // cout<<"Case #"<<i+1<<'\n';
        solve();
    }
    return 0;
}