forked from rachitiitr/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 8
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
7408c07
commit 8a5b995
Showing
1 changed file
with
40 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
#include<bits/stdc++.h> | ||
using namespace std; | ||
#define gc getchar_unlocked | ||
#define fo(i,n) for(i=0;i<n;i++) | ||
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1) | ||
#define ll long long | ||
#define deb(x) cout << #x << "=" << x << endl | ||
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl | ||
#define all(x) x.begin(), x.end() | ||
#define clr(x) memset(x, 0, sizeof(x)) | ||
#define sortall(x) sort(all(x)) | ||
#define PI 3.1415926535897932384626 | ||
typedef pair<int, int> pii; | ||
typedef vector<int> vi; | ||
typedef vector<pii> vpii; | ||
typedef vector<vi> vvi; | ||
//======================= | ||
const int MOD = 1'000'000'007; | ||
const int N = 2e6+13, M = N; | ||
//======================= | ||
vi g[N]; | ||
int a[N]; | ||
int n, m, k; | ||
//======================= | ||
|
||
void solve() { | ||
cin >> n; | ||
} | ||
|
||
int main() { | ||
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); | ||
|
||
int t = 1; | ||
cin >> t; | ||
while(t--) { | ||
solve(); | ||
} | ||
|
||
return 0; | ||
} |