Accenture codes are available 👍

@mrtrueliving_ix

▶️▶️▶️▶️▶️▶️▶️▶️▶️


7pm slots are available

Book your slots @mrtrueliving_ix ☄️🚀▶️

💜Remembering the legendary Puneeth Rajkumar on his 3rd death anniversary💜

Your legacy lives on in our hearts

🫠May your memories continue to inspire us✅

Rest in peace, Power Star

#PuneethRajkumar #Appu #PowerStar #KannadaCinema #Legend #RIP

#include <iostream>
#include <vector>
using namespace std;

int min_revisions(int N, vector<pair<int, int>>& teams) {
    int revisions = 0;
    for (int i = N - 1; i >= 0; i--) {
        int A = teams[i].first;
        int B = teams[i].second;
        int remainder = (A + revisions) % B;
        if (remainder != 0) {
            int increment_needed = B - remainder;
            revisions += increment_needed;
        }
    }
    return revisions;
}

int main() {
    int N;
    cin >> N;
    vector<pair<int, int>> teams(N);
    for (int i = 0; i < N; i++) {
        cin >> teams[i].first >> teams[i].second;
    }
    cout << min_revisions(N, teams) << endl;
    return 0;
}

Zupee // equal division ➗👍

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int largestUseableLandArea(vector<vector<char>>& matrix) {
        if (matrix.empty()) return 0;

        int M = matrix.size();
        int N = matrix[0].size();
        vector<vector<bool>> visited(M, vector<bool>(N, false));
        int maxArea = 0;

        vector<pair<int, int>> directions = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

        function<int(int, int)> dfs = [&](int x, int y) {
            if (x < 0 || x >= M || y < 0 || y >= N || matrix[x][y] == '1' || visited[x][y])
                return 0;

            visited[x][y] = true;
            int area = 1;

            for (const auto& dir : directions) {
                area += dfs(x + dir.first, y + dir.second);
            }

            return area;
        };

        for (int i = 0; i < M; ++i) {
            for (int j = 0; j < N; ++j) {
                if (matrix[i][j] == '0' && !visited[i][j]) {
                    maxArea = max(maxArea, dfs(i, j));
                }
            }
        }

        return maxArea;
    }
};

int main() {
    int M, N;
    cin >> M >> N;
    vector<vector<char>> matrix(M, vector<char>(N));

    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            cin >> matrix[i][j];
        }
    }

    Solution sol;
    int result = sol.largestUseableLandArea(matrix);
    cout << result << endl;

    return 0;
}

Zupee // encode 👍

Get ready.....▶️

Cognizant ✅