| @@ -0,0 +1,62 @@ | ||
| //#include <bits/stdc++.h> | ||
|
|
||
| #include <algorithm> | ||
| #include <iostream> | ||
| #include <vector> | ||
| #include <string> | ||
| #include <math.h> | ||
| #include <map> | ||
| #include <set> | ||
|
|
||
| using namespace std; | ||
|
|
||
| typedef long long int ll; | ||
|
|
||
|
|
||
| void solution(ll n, ll m, vector<ll> a){ | ||
|
|
||
|
|
||
| } | ||
|
|
||
| void solution2(ll n, ll m, vector<ll> a){ | ||
|
|
||
|
|
||
| } | ||
|
|
||
| void validation(ll start_seed, ll end_seed, ll n) { | ||
|
|
||
| for(ll s=start_seed; s<=end_seed; s++) { | ||
| srand(s); | ||
| vector<ll> a; | ||
| for(ll i=0; i<n; i++) { | ||
| a.push_back(rand()%16); | ||
| } | ||
| //for (auto x : a) { | ||
| // printf("%lld, ", x); | ||
| //} | ||
| //printf("\n"); | ||
| //if(solution2(n, a) != solution(n, a)) { | ||
| // printf("failed at seed: %lld\n", s); | ||
| //} | ||
|
|
||
| } | ||
|
|
||
| } | ||
|
|
||
| int main() { | ||
|
|
||
| // variables | ||
| ll n, m; | ||
| cin >> n >> m; | ||
|
|
||
| vector<ll> arr; arr.resize(n); | ||
| for(ll i=0; i<n; i++) { | ||
| scanf("%lld", &arr[i]); | ||
| } | ||
|
|
||
| //validation(0, 10, 10) | ||
| solution(n, m, arr); | ||
|
|
||
| return 0; | ||
| } | ||
|
|
| @@ -0,0 +1,15 @@ | ||
| # use this as the main template for python problems | ||
|
|
||
| if __name__ == "__main__": | ||
|
|
||
| # single variables | ||
| n, m = [int(val) for val in input().split()] | ||
|
|
||
| # vectors | ||
| arr = [int(val) for val in input().split()] | ||
|
|
||
| # solve it! | ||
| solution() | ||
|
|
||
|
|
||
|
|
| @@ -0,0 +1,2 @@ | ||
|
|
||
|
|
| @@ -0,0 +1,4 @@ | ||
| all: code.cpp | ||
| g++ -std=c++11 code.cpp | ||
| cat input.txt | ./a.out | ||
|
|
| @@ -0,0 +1,62 @@ | ||
| //#include <bits/stdc++.h> | ||
|
|
||
| #include <algorithm> | ||
| #include <iostream> | ||
| #include <vector> | ||
| #include <string> | ||
| #include <math.h> | ||
| #include <map> | ||
| #include <set> | ||
|
|
||
| using namespace std; | ||
|
|
||
| typedef long long int ll; | ||
|
|
||
|
|
||
| void solution(ll n, ll m, vector<ll> a){ | ||
|
|
||
|
|
||
| } | ||
|
|
||
| void solution2(ll n, ll m, vector<ll> a){ | ||
|
|
||
|
|
||
| } | ||
|
|
||
| void validation(ll start_seed, ll end_seed, ll n) { | ||
|
|
||
| for(ll s=start_seed; s<=end_seed; s++) { | ||
| srand(s); | ||
| vector<ll> a; | ||
| for(ll i=0; i<n; i++) { | ||
| a.push_back(rand()%16); | ||
| } | ||
| //for (auto x : a) { | ||
| // printf("%lld, ", x); | ||
| //} | ||
| //printf("\n"); | ||
| //if(solution2(n, a) != solution(n, a)) { | ||
| // printf("failed at seed: %lld\n", s); | ||
| //} | ||
|
|
||
| } | ||
|
|
||
| } | ||
|
|
||
| int main() { | ||
|
|
||
| // variables | ||
| ll n, m; | ||
| cin >> n >> m; | ||
|
|
||
| vector<ll> arr; arr.resize(n); | ||
| for(ll i=0; i<n; i++) { | ||
| scanf("%lld", &arr[i]); | ||
| } | ||
|
|
||
| //validation(0, 10, 10) | ||
| solution(n, m, arr); | ||
|
|
||
| return 0; | ||
| } | ||
|
|
| @@ -0,0 +1,15 @@ | ||
| # use this as the main template for python problems | ||
|
|
||
| if __name__ == "__main__": | ||
|
|
||
| # single variables | ||
| n, m = [int(val) for val in input().split()] | ||
|
|
||
| # vectors | ||
| arr = [int(val) for val in input().split()] | ||
|
|
||
| # solve it! | ||
| solution() | ||
|
|
||
|
|
||
|
|
| @@ -0,0 +1,2 @@ | ||
|
|
||
|
|