def ss(D, H, Mi, S, M, L, N):
    ww = (D * 24 * 60 * 60) + (H * 60 * 60) + (Mi * 60) + S
    
    s = M * L * N
    e = ww // s
    a = ww % s
    
    r = a // (L * N)
    a = a % (L * N)
    
    d = a // N
    q = a % N
    
    return e, r, d, q
D, H, Mi, S = map(int, input().split())
M, L, N = map(int, input().split())

ww = ss(D, H, Mi, S, M, L, N)
print(f"{ww[0]} {ww[1]} {ww[2]}  {ww[3]}")

TVS✅

Company Name: Urban Company
Role: SDE 1

Batch eligible: 2024 grads

Apply: https://docs.google.com/forms/d/1-ctraB4lJb2OHVDrqM1FZB3y5Tld1E9o3IyMKyurOVI/viewform

#include <bits/stdc++.h>
using namespace std;

const int P = 1000000007;

int solve(string N, int K) {
    if (K == 0) {
        return 1;
    }

    int len = N.size();
    int num[1010] = {0};
    int f[1010][1010][2] = {0};
    int ans = 0;

    for (int i = 2; i <= 1000; i++) {
        num[i] = num[__builtin_popcount(i)] + 1;
    }

    f[0][0][0] = 1;

    for (int i = 0; i < len; i++) {
        for (int j = 0; j <= i; j++) {
            for (int k = 0; k < 2; k++) {
                for (int l = 0; l <= (k ? 1 : (N[i] - '0')); l++) {
                    (f[i + 1][j + l][k | (l < N[i] - '0')] += f[i][j][k]) %= P;
                }
            }
        }
    }

    for (int i = 1; i <= 1000; i++) {
        if (num[i] == K - 1) {
            (ans += f[len][i][0]) %= P;
            (ans += f[len][i][1]) %= P;
        }
    }

    if (K == 1) {
        ans = (ans + P - 1) % P;
    }

    return ans;
}

int main() {
    string s;
    int k;
    cin >> s >> k;
    cout << solve(s, k) << endl;
    return 0;
}

Possible decryption ✅

int solve(int x1, int y1, int x2, int y2, int cx, int cy, int R)
{
    int count = 0;
    int R_squared = R * R;
    for (int y = y1; y <= y2; ++y)
    {
        int dy_squared = (y - cy) * (y - cy);
        if (dy_squared > R_squared)
            continue;
        int dx = static_cast<int>(sqrt(R_squared - dy_squared));
        int min_x = std::max(x1, cx - dx);
        int max_x = std::min(x2, cx + dx);
        if (min_x <= max_x)
        {
            count += (max_x - min_x + 1);
        }
    }

    return count;
}

int main()
{

    int x1 = 1, y1 = 1, x2 = 100000, y2 = 100000, cx = 50000, cy = 50000, R = 1000;
    cin >> x1 >> y1 >> x2 >> y2 >> cx >> cy >> R;
    cout << solve(x1, y1, x2, y2, cx, cy, R) << endl;
    return 0;
}

//Cordinates sprinkler ✅

Understand this and never hesitate to start with a small!!

#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
    return b == 0 ? a : gcd(b, a % b);
}
int main() {
    int n, a, b;
    cin >> n >> a >> b;
    map<pair<int, int>, int> slope_map;
    for (int i = 0; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        int dy = y - b;
        int dx = x - a;
        int g = gcd(dx, dy);
        dy /= g;
        dx /= g;
        if (dx < 0) {
            dy = -dy;
            dx = -dx;
        } else if (dx == 0) {
            dy = abs(dy);
        }

        slope_map[{dy, dx}]++;
    }
    int aa = 0;
    for (auto &entry : slope_map) {
        int count = entry.second;
        aa += count * (count - 1) / 2;
    }
    cout << aa << endl;
    return 0;
}

MAQ Software ✅