목록알고리즘문제들/codeground (13)
VioletaBabel
#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
#include#include#include#include#include#includeusing namespace std;bool check(string in, set c);int main(int argc, char** argv){int T, test_case;string chemical[114] = {"h", "he", "li", "be", "b", "c", "n", "o", "f", "ne","na", "mg", "al", "si", "p", "s", "cl", "ar", "k", "ca","sc", "ti", "v", "cr", "mn", "fe", "co", "ni", "cu", "zn","ga", "ge", "as", "se", "br", "kr", "rb", "sr","y", "zr","nb"..
#includeusing namespace std;int main(int argc, char** argv){int Answer, *tower, temp[3];long long total;int T, test_case, n, now;setbuf(stdout, NULL);scanf("%d", &T);for (test_case = 0; test_case < T; test_case++){total = 0, Answer = 0, now = 0;scanf("%d", &n);tower = new int[n];for (int i = 0; i < n; ++i){scanf("%d", &tower[i]);total += tower[i];}while (total != 0){for(int i = 0; i < 3; ++i)tem..
#includeusing namespace std;long long Answer;int main(int argc, char** argv){setbuf(stdout, NULL);char move[300001];int T, test_case, x, y, n, k, temp;scanf("%d", &T);for (test_case = 0; test_case < T; test_case++){scanf("%d %d", &n, &k);x = y = 1;Answer = 1;scanf("%s", &move);for (int i = 0; i < k; ++i, Answer += temp){if (move[i] == 'U')y -= 1;else if (move[i] == 'D')y += 1;else if (move[i] ==..
#include#includeusing namespace std;int Answer, degVal[40] = { 6,13,13,4,4,18,18,1,1,20,20,5,5,12,12,9,9,14,14,11,11,8,8,16,16,7,7,19,19,3,3,17,17,2,2,15,15,10,10,6 };int main(int argc, char** argv){setbuf(stdout, NULL);int T, test_case, a, b, c, d, e, n, x, y, score, degree;double l;scanf("%d", &T);for (test_case = 0; test_case < T; test_case++){Answer = 0;scanf("%d %d %d %d %d %d", &a, &b, &c,..