123456789101112131415161718#includeint main(){ int a, b, count = 0, limit = 1, ans = 0; scanf("%d %d", &a, &b); for (int i = 0; i = limit) { count = 0; ++limit; } if (i >= a - 1) ans += limit; } printf("%d", ans);}Colored by Color Scriptercs

123456789101112131415161718192021222324252627282930#include#includeint main(){ bool nop = true; int n, count=0; char name[151][31]; scanf("%d", &n); for (int i = 0; i

123456789101112131415#includeint main(){ char cs[8][9]; int ans = 0; for (int i = 0; i

1234567891011#include#includeusing namespace std;int main(){ int n, num[50]; scanf("%d", &n); for (int i = 0; i

12345678910111213141516171819#includeint main(){ int t, a, b; for (scanf("%d", &t);t--;) { scanf("%d %d", &a, &b); if (b % 4 == 0) a = (a*a*a*a) % 10; else if (b % 4 == 3) a = (a*a*a) % 10; else if (b % 4 == 2) a = (a*a) % 10; else a %= 10; a = (a == 0) ? 10 : a; printf("%d\n", a); }}cs

123456789101112131415161718192021#include#include#includeusing namespace std;int main(){ int n, a; scanf("%d", &n); priority_queue q1; priority_queue q2; for (int nn = n; nn--; q1.push(a)) scanf("%d", &a); for (int nn = n; nn--; q2.push(a)) scanf("%d", &a); for (a = 0; n--;q2.pop()) { a += (q1.top() * q2.top()); q1.pop(); } printf("%d\n", a);}Colored by Color Scriptercs

#include #include using namespace std;#define inf 1000000000int main(){ int n, m, route[101][101], a, b, ans = 1;fill_n(&route[0][0], 101 * 101, inf);for (scanf("%d %d", &n, &m); m--; route[a][b] = 1, route[b][a] = 1)scanf("%d %d", &a, &b);for (int i = 1; i

#include #include using namespace std;#define inf 1000000000int main(){ int n, route[101][101];scanf("%d", &n);for (int i = 1; i

#include #include using namespace std;#define inf 1000000000int main(){ int n, m, a, b, c, route[101][101]; scanf("%d %d", &n, &m); fill_n(&route[0][0], 10201, inf); for (int i = 1; i

#include #define max 2097152 // 2^21long long sum(int l, int r, int nl, int nr, int nodeNum);void update(int i, int v);long long num[max];int main() {int a, b, c, n, m, k, rn;scanf("%d %d %d", &n, &m, &k);for (rn = 1; rn -1; --i)num[i] = num[i * 2 + 1] + num[i * 2 + 2];for (int i = 0; i < m + k;..