mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
46 lines
736 B
C++
46 lines
736 B
C++
#if __cplusplus >= 201103L
|
|
#include <bits/stdc++.h>
|
|
#endif
|
|
#include <algorithm>
|
|
#include <bitset>
|
|
#include <cassert>
|
|
#include <cctype>
|
|
#include <climits>
|
|
#include <cmath>
|
|
#include <complex>
|
|
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <cstring>
|
|
#include <ctime>
|
|
#include <functional>
|
|
#include <iomanip>
|
|
#include <iostream>
|
|
#include <list>
|
|
#include <map>
|
|
#include <numeric>
|
|
#include <queue>
|
|
#include <set>
|
|
#include <stack>
|
|
#include <string>
|
|
#include <vector>
|
|
using namespace std;
|
|
|
|
typedef long long ll;
|
|
const int N = 100005;
|
|
const int M = 1000000007;
|
|
|
|
int n, m;
|
|
int a[N];
|
|
|
|
int main() {
|
|
int C = 0, T;
|
|
scanf("%d", &T);
|
|
while (++C <= T) {
|
|
scanf("%d", &n);
|
|
for (int i = 0; i < n; i++) {
|
|
scanf("%d", &a[i]);
|
|
}
|
|
|
|
}
|
|
}
|