๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.55K photos
3 videos
95 files
9.64K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
#include<bits/stdc++.h>
using namespace std;

int ByServer(vector<int>& req) {
    int b = 0;
    for(int i = 0; i < req.size(); i += 2) {
        b += req[i];
    }
    return b;
}

int main() {
    int n;
    cin >> n;

    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    cout << ByServer(a) << endl;
    return 0;
}
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
#include <iostream>
#include <cmath>
#include <iomanip>

using namespace std;

double areaOfIntersection(int centerx1, int centery1, int radius1,
                          int centerx2, int centery2, int radius2) {
    double distance = sqrt(pow(centerx2 - centerx1, 2) + pow(centery2 - centery1, 2));

    if(distance >= (radius1 + radius2)) {
        return 0.0;
    }

    double part1 = radius1 * radius1 * acos((distance * distance + radius1 * radius1 - radius2 * radius2) / (2 * distance * radius1));
    double part2 = radius2 * radius2 * acos((distance * distance + radius2 * radius2 - radius1 * radius1) / (2 * distance * radius2));
    double part3 = 0.5 * sqrt((-distance + radius1 + radius2) * (distance + radius1 - radius2) * (distance - radius1 + radius2) * (distance + radius1 + radius2));

    return part1 + part2 - part3;
}

int main() {
    int centerx1, centery1, radius1, centerx2, centery2, radius2;

    cin >> centerx1 >> centery1 >> radius1 >> centerx2 >> centery2 >> radius2;

    double answer = areaOfIntersection(centerx1, centery1, radius1, centerx2, centery2, radius2);

    cout << fixed << setprecision(6) << answer << endl;

    return 0;
}

C++โœ…
#include<bits/stdc++.h>
using namespace std;

int maxWeeks(vector<int>& a) {
    int n = a.size();
    sort(a.begin(), a.end(), greater<int>());

    int b = 0;
    int c = 0;
    int d = -1;

    while (true) {
        if (c != d && a[c] > 0) {
            a[c]--;
            b++;
            d = c;
            c = 0;
        } else {
            c++;
            if (c == n) break;
        }
    }
    return b;
}

int main() {
    int e;
    cin >> e;

    vector<int> a(e);
    for (int i = 0; i < e; i++) {
        cin >> a[i];
    }

    cout << maxWeeks(a) << endl;
    return 0;
}

C++โœ