Compare text

Find the difference between two text files

Real-time diff

Unified diff

Collapse lines

Highlight change

Syntax highlighting

Tools

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Comparing sensitive data, confidential files or internal emails?

Most legal and privacy policies prohibit uploading sensitive data online. Diffchecker Desktop ensures your confidential information never leaves your computer. Work offline and compare documents securely.

Download Diffchecker Desktop Learn more

cf diff

Created 5 months agoDiff never expires

1 removal

68 lines

7 additions

74 lines

#include <iostream>

#include <vector>

#define int long long

int gcd(int a, int b) {

if (b == 0) return a;

return gcd(b, a % b);

}

std::vector<std::vector<bool>> isposs;

bool isPoss(int value, std::vector<std::vector<int>> &grid) {

int n = grid.size(), m = grid[0].size();

std::vector<std::vector<bool>> isposs(n, std::vector<bool>(m, 0));

for (int i = 0; i < n; i++) {

for (int j = 0; j < m; j++) {

isposs[i][j] = 0;

}

isposs[0][0] = 1;

for (int i = 1; i < m; i++) {

if (grid[0][i] % value == 0 && isposs[0][i - 1]) isposs[0][i] = 1;

}

for (int i = 1; i < n; i++) {

if (grid[i][0] % value == 0 && isposs[i - 1][0]) isposs[i][0] = 1;

}

for (int i = 1; i < n; i++) {

for (int j = 1; j < m; j++) {

if (grid[i][j] % value == 0 &&

(isposs[i][j - 1] || isposs[i - 1][j]))

isposs[i][j] = 1;

}

return isposs[n - 1][m - 1];

}

void solve() {

int n, m;

std::cin >> n >> m;

isposs.resize(n, std::vector<bool>(m));

std::vector<std::vector<int>> grid(n, std::vector<int>(m));

for (int i = 0; i < n; i++) {

for (int j = 0; j < m; j++) {

std::cin >> grid[i][j];

}

int res = gcd(grid[0][0], grid[n - 1][m - 1]);

int ans = 1;

for (int i = 1; i * i <= res; i++) {

if (res % i) continue;

int div = res / i;

if (isPoss(div, grid)) {

std::cout << div << "\n";

return;

}

if (i != 1 && isPoss(i, grid)) ans = i;

}

std::cout << ans << "\n";

}

signed main() {

std::ios::sync_with_stdio(false);

std::cin.tie(0);

std::cout.tie(0);

int t;

std::cin >> t;

while (t--) {

solve();

}

return 0;

}

Saved diffs

Original text

Open file

#include <iostream>
#include <vector>

#define int long long

int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

bool isPoss(int value, std::vector<std::vector<int>> &grid) {
    int n = grid.size(), m = grid[0].size();
    std::vector<std::vector<bool>> isposs(n, std::vector<bool>(m, 0));
    isposs[0][0] = 1;
    for (int i = 1; i < m; i++) {
        if (grid[0][i] % value == 0 && isposs[0][i - 1]) isposs[0][i] = 1;
    }
    for (int i = 1; i < n; i++) {
        if (grid[i][0] % value == 0 && isposs[i - 1][0]) isposs[i][0] = 1;
    }

for (int i = 1; i < n; i++) {
        for (int j = 1; j < m; j++) {
            if (grid[i][j] % value == 0 &&
                (isposs[i][j - 1] || isposs[i - 1][j]))
                isposs[i][j] = 1;
        }
    }
    return isposs[n - 1][m - 1];
}

void solve() {
    int n, m;
    std::cin >> n >> m;
    std::vector<std::vector<int>> grid(n, std::vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            std::cin >> grid[i][j];
        }
    }

int res = gcd(grid[0][0], grid[n - 1][m - 1]);
    int ans = 1;
    for (int i = 1; i * i <= res; i++) {
        if (res % i) continue;
        int div = res / i;
        if (isPoss(div, grid)) {
            std::cout << div << "\n";
            return;
        }
        if (i != 1 && isPoss(i, grid)) ans = i;
    }
    std::cout << ans << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);

int t;
    std::cin >> t;
    while (t--) {
        solve();
    }

return 0;
}

Changed text

Open file

#include <iostream>
#include <vector>

#define int long long

int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

std::vector<std::vector<bool>> isposs;
bool isPoss(int value, std::vector<std::vector<int>> &grid) {
    int n = grid.size(), m = grid[0].size();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            isposs[i][j] = 0;
        }
    }
    isposs[0][0] = 1;
    for (int i = 1; i < m; i++) {
        if (grid[0][i] % value == 0 && isposs[0][i - 1]) isposs[0][i] = 1;
    }
    for (int i = 1; i < n; i++) {
        if (grid[i][0] % value == 0 && isposs[i - 1][0]) isposs[i][0] = 1;
    }

void solve() {
    int n, m;
    std::cin >> n >> m;
    isposs.resize(n, std::vector<bool>(m));
    std::vector<std::vector<int>> grid(n, std::vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            std::cin >> grid[i][j];
        }
    }

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);

int t;
    std::cin >> t;
    while (t--) {
        solve();
    }

return 0;
}