#include<iostream>using namespace std;int m[1001], first, last, M, N, num;int main() {cin >> M >> N;for (int i = 0; i < N; i++) {int w, j;cin >> w;for (j = first; j < las

#include<iostream>using namespace std;int m[1001], first, last, M, N, num;int main() {cin >> M >> N;for (int i = 0; i < N; i++) {int w, j;cin >> w;for (j = first; j < las

#include<iostream>#include<cmath>using namespace std;int n, k, x[21], num;bool prime(int n){if (2 == n)return true;else if (0 == n % 2)return false;elsefor (int i = 3; i <= sqrt(n); i +

#include<iostream>#include<string>using namespace std;int k;string s;int main(){cin >> s >> k;for (int i = 0; i < k; i++){int l = s.length();for (int j = 0; j < l - 1; j+

#include<iostream>#include<algorithm>using namespace std;constexpr int MAX_LENGTH = 300;int n, h[MAX_LENGTH], g[MAX_LENGTH + 10];long long sum;int main(){cin >> n;for (int i = 0; i &

#include<iostream>#include<algorithm>using namespace std;int n;int num[10] = { 1,2,3,4,5,6,7,8,9 }, temp[10];bool str_equal(){for (int i = 0; i < n; i++)if (num[i] != temp[i])return fal

#include<iostream>using namespace std;unsigned long long a[1000];int N;void find(){for (int j = 0; j <= N; j++){unsigned long long sum = 0;if (j == 1 || j == 0)sum = 1;elsefor (int i = 0; i &