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
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. Prepare
  2. Mathematics
  3. Fundamentals
  4. Connecting Towns
  5. Discussions

Connecting Towns

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • wwuyxg
    2 years ago+ 0 comments
    connectingTowns(n, routes):
        p = 1
        for x in range(n-1):
            p = p * routes[x]
        return p%1234567
    

    lol..what a troll, this is just the number of ways to walk routes. hahahhaahahaha

    3|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature