123456789101112131415161718192021222324#include #include #include #include using namespace std;int main(){ int n, p = 5527, m = -5527, result; cin >> n; cin.ignore(); for (int i = 0; i > t; cin.ignore(); if(t>0) p = (tm) ? t : m; } if(p == 5527 && m == -5527) result = 0; else result = (p > (m*(-1))) ? m : p; cout

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970#include #include #include #include using namespace std;int main(){ int lightX; int lightY; int initialTX; int initialTY; cin >> lightX >> lightY >> initialTX >> initialTY; cin.ignore(); while (1) { int remainingTurns; cin >> remainingTurns; cin.ignore(); if(initialT..

123456789101112131415161718192021222324252627#include #include #include #include using namespace std;int main(){ int mh[8], target, th; while (1) { target = 0; th = 0; for (int i = 0; i > mountainH; cin.ignore(); mh[i] = mountainH; } for(int i = 0; i th) { target = i; th = mh[i]; } cout

1234567891011121314151617181920#include#include#includeusing namespace std;int main() { string str; cin >> str; unordered_set hash; for (int i = 0; i

#include using namespace std;int Answer;int main(int argc, char** argv){int T, test_case, m, max;bool zero, check, countz;long long num[100000], a, b;cin >> T;for (test_case = 0; test_case > m >> a;for (int i = 1; i > b;num[i - 1] = b - a;a = b;if (max < num[i - 1])max = num[i - 1];if (num[i - 1] != 0)++zero;else++co..

#include #include using namespace std;int Answer;int main(int argc, char** argv){int T, test_case, n, m, p[201], a, b;cin >> T;for (test_case = 0; test_case > n >> m;fill_n(&p[0], n+1, 0);for (int i = 0; i > a >> b;if (p[a] == 0 && p[b] == 0){p[a] = 1;p[b] = 2;}else if (p[a] == 0 || p[b] == 0)if (p[a] != 0)p[b] = (p[a] == 1) ? 2 : 1;elsep[a] = (p[b] == 1) ? 2 : 1;else if(p[a] == p[b])Answer = 0;..

#include using namespace std;char Answer;int main(int argc, char** argv){int T, test_case, k, n, m, ns[30], ms[20];cin >> T;for (test_case = 0; test_case > n >> m >> k;for (int i = 0; i > ns[i];for (int i = 0; i > ms[i];for (int i = 0; i

#include using namespace std;int Answer;int main(int argc, char** argv){int T, test_case, a, b, d;cin >> T;for (test_case = 0; test_case > a >> b >> d;Answer = 1;d -= a;a -= b;if (d > 0)Answer += d / a;if ((double)d / (double)a != d / a)++Answer;cout

#include using namespace std;int main(int argc, char** argv) {setbuf(stdout, NULL);int T;int test_case;scanf("%d", &T);for (test_case = 1; test_case

#includeusing namespace std;int main(void){int T, test_case, n, m, k, **chess;setbuf(stdout, NULL);scanf("%d", &T);for (test_case = 0; test_case < T; test_case++){scanf("%d %d %d", &n, &m, &k);chess = new int*[n + 1];for (int i = 0; i < n + 1; ++i)chess[i] = new int[m + 1];for (int i = 1; i