We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. Hacker Country
  5. Discussions

Hacker Country

Sort by

recency

|

17 Discussions

|

  • mosartimol90
     + 0 comments

    Hello. I'm a huge DayZ fan but I've found myself in situations where the odds are stacked against me and I can't help but wonder if I'm missing something. While some may argue that using hacks is against the spirit of the game, others argue that they are effective. The beginning of my foray into this world was marked by curiosity and skepticism. During my research, I discovered a huge number of powerful dayz hacks available, promising everything from increased stealth to high accuracy. Using these hacks allows you to face challenges with ease, learn from failures and enjoy victories earned through sincere efforts.

  • yashparihar729
     + 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Hacker Country Problem Solution

  • mineman1012221
     + 0 comments

    Here is the solution of Hacker Country Click Here

  • thecodingsoluti2
     + 0 comments

    Here is problem solution - https://programs.programmingoneonone.com/2021/07/hackerrank-hacker-country-problem-solution.html

  • konetikirankumar
     + 1 comment

    c++

    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

const int N = 510;
const int inf = (int)1e9;

int a[N][N];
int d[N][N];

int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) scanf("%d", a[i] + j);
    for (int i = 0; i < n; i++) d[0][i] = 0;
    for (int it = 0; it < n; it++) {
        for (int i = 0; i < n; i++) d[it + 1][i] = inf;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) {
              if (i == j) {
                continue;
              }
              int dt = d[it][i] + a[i][j];
              if (dt < d[it + 1][j]) {
                  d[it + 1][j] = dt;
              }
            }
    }
    long long p = inf, q = 1;
    for (int i = 0; i < n; i++) {
        long long pp = 0, qq = 1;
        for (int it = 0; it < n; it++) {
            long long num = d[n][i] - d[it][i];
            long long den = n - it;
            if (num * qq > pp * den) {
                pp = num;
                qq = den;
            }
        }
        if (pp * q < p * qq) {
            p = pp;
            q = qq;
        }
    }
    int xx = p, yy = q;
    while (xx > 0 && yy > 0)
        if (xx > yy) xx %= yy;
        else yy %= xx;
    int g = xx + yy;
    p /= g;
    q /= g;
    printf("%d/%d", (int)p, (int)q);
    return 0;
}