12345678910111213141516171819202122232425#include#includeusing namespace std;int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, clusterSize; long long int result = 0; vector fileSize; cin >> n; for (int i = n, temp; i--; fileSize.push_back(temp)) cin >> temp; cin >> clusterSize; for (int i = 0; i

1234567891011121314151617181920212223242526272829303132333435#includeint main(){ int price1[6] = { 5000000,3000000,2000000,500000,300000,100000 }, t, a, b, res = 0; for (scanf("%d", &t); t--; printf("%d\n", res)) { res = 0; scanf("%d %d", &a, &b); if (a > 0) { for (int i = 0; ++i

123456789101112131415161718192021222324252627#include#includeusing namespace std;int main(){ string oct; cin >> oct; if (oct == "0") { cout

123456789101112131415161718192021222324252627282930#includeusing namespace std;int LCM(int a, int b){ int t = a * b; for (int temp; a%b != 0; b = temp % b) { temp = a; a = b; } return t / b;}int main(){ int num[5]; int best = 1000000; for (int i = 5; i--; scanf("%d", num + i)); for (int i = 0; i

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657#include#includeusing namespace std;int checkQueue(queue *q, queue *gacha);void reverseQueue(queue *q);int main(){ queue q1, q2, gachaNumbers; int qSize, gachaCount, result = 0; scanf("%d %d", &qSize, &gachaCount); for (int i = 0; i

123456789101112#includeint main(){ int zero[41] = { 1,0 }, one[41] = { 0,1 }, t, n; for (int i = 2; i

123456789101112131415#include#include#includeusing namespace std;int main(){ int nNum[100001], n, max = 0; scanf("%d", &n); for (int i = 0; i

1234567891011121314151617181920212223242526272829303132333435#include#includeusing namespace std;int main(){ int num[100], in = 1, count, max, ans; while (1) { ans = 0; count = 0; max = 0; do { scanf("%d", &in); if (in == -1) return 1; num[count++] = in; } while (in != 0); sort(num, num + count - 1); max = num[count - 2]; max /= 2; for (int i = 0; num[i]

123456789101112131415#includeint main(){ int n, ans = 0; scanf("%d", &n); for (int num = 9, i = 9, count = 1; 1; num = ((num+1)*10)-1, i *= 10, ++count) if (num

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354#include#include using namespace std;int main(){ queue q; priority_queue pq; int t, n, m, paper, ans = 0, pos, now; for (scanf("%d", &t); t--; ans = 0) { scanf("%d %d", &n, &m); pos = m; now = n; for (int i = 0; i