#practiceLinkDiv { display: ingen !viktigt; }Givet ett positivt heltal n hitta antalet positiva heltal i så att 0<= i <= n and n+i = n^i
Exempel:
Input : n = 7 Output : 1 Explanation: 7^i = 7+i holds only for only for i = 0 7+0 = 7^0 = 7 Input: n = 12 Output: 4 12^i = 12+i hold only for i = 0 1 2 3 for i=0 12+0 = 12^0 = 12 for i=1 12+1 = 12^1 = 13 for i=2 12+2 = 12^2 = 14 for i=3 12+3 = 12^3 = 15Recommended Practice Lika summa och XOR Prova!
Metod 1 (enkel):
En enkel lösning är att iterera över alla värden på i 0<= i <= n and count all satisfying values.
C++
/* C++ program to print count of values such that n+i = n^i */ #include
/* Java program to print count of values such that n+i = n^i */ import java.util.*; class GFG { // function to count number of values // less than equal to n that satisfy // the given condition public static int countValues (int n) { int countV = 0; // Traverse all numbers from 0 to n // and increment result only when // given condition is satisfied. for (int i = 0; i <= n; i++ ) if ((n + i) == (n ^ i) ) countV++; return countV; } /* Driver program to test above function */ public static void main(String[] args) { int n = 12; System.out.println(countValues(n)); } } // This code is contributed by Arnav Kr. Mandal.
# Python3 program to print count # of values such that n+i = n^i # function to count number # of values less than # equal to n that satisfy # the given condition def countValues (n): countV = 0; # Traverse all numbers # from 0 to n and # increment result only # when given condition # is satisfied. for i in range(n + 1): if ((n + i) == (n ^ i)): countV += 1; return countV; # Driver Code n = 12; print(countValues(n)); # This code is contributed by mits
/* C# program to print count of values such that n+i = n^i */ using System; class GFG { // function to count number of values // less than equal to n that satisfy // the given condition public static int countValues (int n) { int countV = 0; // Traverse all numbers from 0 to n // and increment result only when // given condition is satisfied. for (int i = 0; i <= n; i++ ) if ((n + i) == (n ^ i) ) countV++; return countV; } /* Driver program to test above function */ public static void Main() { int n = 12; Console.WriteLine(countValues(n)); } } // This code is contributed by anuj_67.
// PHP program to print count // of values such that n+i = n^i // function to count number // of values less than // equal to n that satisfy // the given condition function countValues ($n) { $countV = 0; // Traverse all numbers // from 0 to n and // increment result only // when given condition // is satisfied. for ($i = 0; $i <= $n; $i++ ) if (($n + $i) == ($n^$i) ) $countV++; return $countV; } // Driver Code $n = 12; echo countValues($n); // This code is contributed by m_kit ?> <script> /* JavaScript program to print count of values such that n+i = n^i */ // function to count number of values less than // equal to n that satisfy the given condition function countValues (n) { let countV = 0; // Traverse all numbers from 0 to n and // increment result only when given condition // is satisfied. for (let i=0; i<=n; i++ ) if ((n+i) == (n^i) ) countV++; return countV; } // Driver program let n = 12; document.write(countValues(n)); // This code is contributed by Surbhi Tyagi. </script>
Produktion:
4
Tidskomplexitet: På)
Utrymmes komplexitet: O(1)
Metod 2 (effektiv):
En effektiv lösning är följande
vi vet att (n+i)=(n^i)+2*(n&i)
Så n + i = n ^ i antyder n & i = 0
Därför minskar vårt problem till att hitta värden på i så att n & i = 0. Hur hittar man antalet sådana par? Vi kan använda antalet oinställda bitar i den binära representationen av n. För att n & i ska vara noll måste jag avaktivera alla set-bitar av n. Om den k:te biten är inställd på en viss in n k:te bit i i måste alltid vara 0 annars kan den kth biten av i vara 0 eller 1
Därför är det totala antalet sådana kombinationer 2^(antal oinställda bitar i n)
Betrakta till exempel n = 12 (Binär representation: 1 1 0 0).
Alla möjliga värden på i som kan avaktivera alla bitar av n är 0 0 0/1 0/1 där 0/1 innebär antingen 0 eller 1. Antalet sådana värden på i är 2^2 = 4.
Följande är programmet som följer idén ovan.
C++/* c++ program to print count of values such that n+i = n^i */ #include
/* Java program to print count of values such that n+i = n^i */ import java.util.*; class GFG { // function to count number of values // less than equal to n that satisfy // the given condition public static int countValues(int n) { // unset_bits keeps track of count // of un-set bits in binary // representation of n int unset_bits=0; while (n > 0) { if ((n & 1) == 0) unset_bits++; n=n>>1; } // Return 2 ^ unset_bits return 1 << unset_bits; } /* Driver program to test above function */ public static void main(String[] args) { int n = 12; System.out.println(countValues(n)); } } // This code is contributed by Arnav Kr. Mandal.
/* C# program to print count of values such that n+i = n^i */ using System; public class GFG { // function to count number of values // less than equal to n that satisfy // the given condition public static int countValues(int n) { // unset_bits keeps track of count // of un-set bits in binary // representation of n int unset_bits=0; while (n > 0) { if ((n & 1) == 0) unset_bits++; n=n>>1; } // Return 2 ^ unset_bits return 1 << unset_bits; } /* Driver program to test above function */ public static void Main(String[] args) { int n = 12; Console.WriteLine(countValues(n)); } } // This code is contributed by umadevi9616
# Python3 program to print count of values such # that n+i = n^i # function to count number of values less than # equal to n that satisfy the given condition def countValues(n): # unset_bits keeps track of count of un-set # bits in binary representation of n unset_bits = 0 while(n): if n & 1 == 0: unset_bits += 1 n = n >> 1 # Return 2 ^ unset_bits return 1 << unset_bits # Driver code if __name__=='__main__': n = 12 print(countValues(n)) # This code is contributed by rutvik
/* PHP program to print count of values such that n+i = n^i */ // function to count number of // values less than equal to n // that satisfy the given // condition function countValues( $n) { // unset_bits keeps track // of count of un-set bits // in binary representation // of n $unset_bits = 0; while ($n) { if (($n & 1) == 0) $unset_bits++; $n = $n >> 1; } // Return 2 ^ unset_bits return 1 << $unset_bits; } // Driver code $n = 12; echo countValues($n); // This code is contributed // by Anuj_67. ?> <script> // Javascript program to print count of values // such that n+i = n^i // Function to count number of values // less than equal to n that satisfy // the given condition function countValues(n) { // unset_bits keeps track of count // of un-set bits in binary // representation of n let unset_bits = 0; while (n > 0) { if ((n & 1) == 0) unset_bits++; n = n >> 1; } // Return 2 ^ unset_bits return 1 << unset_bits; } // Driver Code let n = 12; document.write(countValues(n)); // This code is contributed by susmitakundugoaldanga </script>
Utgång:
4
Tidskomplexitet: O(log(n))
Utrymmes komplexitet: O(1)
https://www.youtube.com/watch?v=zhu605v9KOI&feature=youtu.be