IT

Challenge: Primitive Problem Subdomeniu: Number Theory (number-theory) Scor cont: 20.0 / 20 Submission status: Accepted Submission score: 1.0 Submission ID: 464721731 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/primitive-problem/problem Cerinta We define a *primitive root* of prime number $p$ to be some integer

Challenge: Prime Sum Subdomeniu: Number Theory (number-theory) Scor cont: 70.0 / 70 Submission status: Accepted Submission score: 1.0 Submission ID: 464736447 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/prime-sum/problem Cerinta The problem is quite simple. You're given a number N and a positive

Challenge: Power of large numbers Subdomeniu: Number Theory (number-theory) Scor cont: 40.0 / 40 Submission status: Accepted Submission score: 1.0 Submission ID: 464733595 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/power-of-large-numbers/problem Cerinta The city of Hackerland has formed a new football club and

Challenge: Period Subdomeniu: Number Theory (number-theory) Scor cont: 100.0 / 100 Submission status: Accepted Submission score: 1.0 Submission ID: 464737207 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/period/problem Cerinta You are given 2 integers **a** and **b**. Let a number be defined as

Challenge: Order of Prime in Factorial Subdomeniu: Number Theory (number-theory) Scor cont: 100.0 / 100 Submission status: Accepted Submission score: 1.0 Submission ID: 464775450 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/order-of-prime-in-factorial/problem Cerinta For a given prime $p$, define $\operatorname{ord}_p(k)$ as the multiplicity

Challenge: Number of zero-xor subsets Subdomeniu: Number Theory (number-theory) Scor cont: 40.0 / 40 Submission status: Accepted Submission score: 1.0 Submission ID: 464739172 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/number-of-subsets/problem Cerinta You are given an integer $N$. Consider set $S = \{0,\

Challenge: Number of M-Coprime Arrays Subdomeniu: Number Theory (number-theory) Scor cont: 70.0 / 70 Submission status: Accepted Submission score: 1.0 Submission ID: 464757847 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/number-of-m-coprime-arrays/problem Cerinta An array of integers is called $m$-coprime if the following conditions

Challenge: Nice Clique Subdomeniu: Number Theory (number-theory) Scor cont: 100.0 / 100 Submission status: Accepted Submission score: 1.0 Submission ID: 464735691 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/niceclique/problem Cerinta Given a sequence of $n$ numbers, $D = (d_1, d_2, \dots, d_n)$, what's

Challenge: nCr Subdomeniu: Number Theory (number-theory) Scor cont: 120.0 / 120 Submission status: Accepted Submission score: 1.0 Submission ID: 464776690 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/ncr/problem Cerinta Given two integers $n$ and $r$. In how many ways can $r$ items be

Challenge: Minion of the Year Subdomeniu: Number Theory (number-theory) Scor cont: 120.0 / 120 Submission status: Accepted Submission score: 1.0 Submission ID: 464775701 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/minion-of-the-year/problem Cerinta Gru wanted to upgrade the quality of his minions' despicableness through