Untitled

mail@pastecode.io avatar
unknown
c_cpp
a month ago
1.0 kB
2
Indexable
Never
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define int long long 
#define NNN 200005
#define pb push_back
#define mp make_pair
#define INF 2E18
#define mod 1000000007
#define pii pair<int,int>
#define vi vector<int>
#define all(a) a.begin(), a.end()
#define F first
#define S second
using namespace std;
template<class t> using pqmin=priority_queue<t,vector<t>,greater<t>>;
template<class t> using pqmax=priority_queue<t>;
//#define endl '\n'
 

//using namespace __gnu_pbds;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;//s.find_by_order()//s.order_of_key()
//mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());


void solve()
{
	
}

int32_t main()
{
	ios::sync_with_stdio(0), cin.tie(0);
	int t=1;
	cin>>t;
	while(t--)
	{
		solve();
	}
}

/*
for(int i=1;i<=n;i++)


for(int i=0;i<n;i++)

*/

// By Yufe1210  ; )
Leave a Comment