#includelong long tile[1001];int main(){tile[1] = 1;tile[2] = 3;int n;scanf("%d", &n);for (int i = 3; i

#includelong long tile[1001];int main(){tile[1] = 1;tile[2] = 2;int n;scanf("%d", &n);for (int i = 3; i

#include#define csDown() {--cs; h = (h > n[cs]) ? n[cs] : h;}#define ceUp() {++ce;h = (h > n[ce]) ? n[ce] : h;}#define min(a,b) (a>b)?b:a#define max(a,b) (a>b)?a:b#define ll long longint n[100001];ll findMax(int s, int m, int e);int main(){scanf("%d", &n[0]);if (n[0] == 0)return 1;for (int i = 1; i = s && ce s && ce n[ce + 1]){csDown();}else{ceUp();}else if (cs > s){csDown();..

#include#define csDown() {--cs; h = (h > n[cs]) ? n[cs] : h;}#define ceUp() {++ce;h = (h > n[ce]) ? n[ce] : h;}#define min(a,b) (a>b)?b:a#define max(a,b) (a>b)?a:b#define ll long longint n[100001];ll findMax(int s, int m, int e);int main(){while (1){scanf("%d", &n[0]);if (n[0] == 0)return 1;for (int i = 1; i = s && ce s && ce n[ce + 1]){csDown();}else{ceUp();}else if (cs > s)..

#include#includeint main(){int bgn[101], n, m;scanf("%d %d", &n, &m);for (int i = 1; i

#include#includeint main(){int bgn[101], n, m;scanf("%d %d", &n, &m);for (int i = 1; i

#include#includeint alp[26];int main(){char text[101];scanf("%s", &text);for (int i = 0; i < strlen(text); ++i)++alp[text[i] - (int)'a'];for (int i = 0; i < 26; ++i)printf("%d ", alp[i]);}

#include#includeusing namespace std;int main(){multiset num;int n, a;scanf("%d", &n);while (n--){scanf("%d", &a);num.insert(a);}scanf("%d", &a);printf("%d", num.count(a));}

#include#includeusing namespace std;int main(){string text;int n = 1;cin >> text;for (int i = 0; i < text.size(); ++i)if (text[i] == ',')++n;cout

#include#include#includeusing namespace std;int main(){string text;while (getline(cin, text)){int ans[4] = { 0,0,0,0 };for (int i = 0; i = 'a' && text[i] = 'A' && text[i] = '0' && text[i]