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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. Alex vs Fedor
  5. Discussions

Alex vs Fedor

Problem
Submissions
Leaderboard
Discussions
Editorial

Sort 11 Discussions, By:

recency

Please Login in order to post a comment

  • yashparihar729
    1 day ago+ 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Alex vs Fedor Problem Solution

    0|
    Permalink
  • mineman1012221
    2 months ago+ 0 comments

    Here is the solution of Alex vs Fedor Click Here

    0|
    Permalink
  • thecodingsoluti2
    4 months ago+ 0 comments

    Here is problem solution - https://programs.programmingoneonone.com/2021/07/hackerrank-alex-vs-fedor-problem-solution.html

    0|
    Permalink
  • znie1
    4 years ago+ 1 comment

    The time limit is very tight for Python. When calculating the determinant, there is a dilemma between accuracy and speed. One way to optimize is to solve an mod p solution for small values of p. (p=1000003, 1000033,1000037 for example) Then we use the Chinese Remainder Theorem to find the actual value. The correctness is given by the constraint (#spanning trees < 10^18). This method is much faster than using the fraction module or mod a prime > 10^18.

    0|
    Permalink
  • lvsz_
    5 years ago+ 1 comment

    I was working a solution in Racket, but suddenly that language is no longer available?

    1|
    Permalink
Load more conversations

Need Help?


View editorial
View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy