Bitwise and (or &) of a range - GeeksforGeeks

Recommended PracticeAND operationTry It! A simple solution is to traverse all numbers from x to y and do bit-wise and of all numbers in range. Skiptocontent CoursesForWorkingProfessionalsLIVEDSALiveClassesSystemDesignJavaBackendDevelopmentFullStackLIVEExploreMoreSelf-PacedDSA-SelfPacedSDETheoryAllDevelopmentCoursesExploreMoreForStudentsLIVECompetitiveProgrammingGATELiveCourse2023DataScienceExploreMoreSelf-PacedDSA-SelfPacedCIPJAVA/Python/C++ExploreMoreSchoolCoursesSchoolGuidePythonProgrammingLearnToMakeAppsExploremoreAllCoursesTutorialsAlgorithmsAnalysisofAlgorithmsAsymptoticAnalysisWorst,AverageandBestCasesAsymptoticNotationsLittleoandlittleomeganotationsLowerandUpperBoundTheoryAnalysisofLoopsSolvingRecurrencesAmortizedAnalysisWhatdoes'SpaceComplexity'mean?Pseudo-polynomialAlgorithmsPolynomialTimeApproximationSchemeATimeComplexityQuestionSearchingAlgorithmsSortingAlgorithmsGraphAlgorithmsPatternSearchingGeometricAlgorithmsMathematicalBitwiseAlgorithmsRandomizedAlgorithmsGreedyAlgorithmsDynamicProgrammingDivideandConquerBacktrackingBranchandBoundAllAlgorithmsDataStructuresArraysLinkedListStackQueueBinaryTreeBinarySearchTreeHeapHashingGraphAdvancedDataStructureMatrixStringsAllDataStructuresInterviewCornerCompanyPreparationTopTopicsPracticeCompanyQuestionsInterviewExperiencesExperiencedInterviewsInternshipInterviewsCompetititveProgrammingDesignPatternsSystemDesignTutorialMultipleChoiceQuizzesLanguagesCC++JavaPythonC#JavaScriptjQuerySQLPHPScalaPerlGoLanguageHTMLCSSKotlinML&DataScienceMachineLearningDataScienceCSSubjectsMathematicsOperatingSystemDBMSComputerNetworksComputerOrganizationandArchitectureTheoryofComputationCompilerDesignDigitalLogicSoftwareEngineeringGATEGATEComputerScienceNotesLastMinuteNotesGATECSSolvedPapersGATECSOriginalPapersandOfficialKeysGATE2021DatesGATECS2021SyllabusImportantTopicsforGATECSWebTechnologiesHTMLCSSJavaScriptAngularJSReactJSNodeJSBootstrapjQueryPHPSoftwareDesignsSoftwareDesignPatternsSystemDesignTutorialSchoolLearningSchoolProgrammingMathematicsNumberSystemAlgebraTrigonometryStatisticsProbabilityGeometryMensurationCalculusMathsNotes(Class8-12)Class8NotesClass9NotesClass10NotesClass11NotesClass12NotesNCERTSolutionsClass8MathsSolutionClass9MathsSolutionClass10MathsSolutionClass11MathsSolutionClass12MathsSolutionRDSharmaSolutionsClass8MathsSolutionClass9MathsSolutionClass10MathsSolutionClass11MathsSolutionClass12MathsSolutionPhysicsNotes(Class8-11)Class8NotesClass9NotesClass10NotesClass11NotesChemistryNotesClass8NotesClass9NotesClass10NotesCSExams/PSUsISROISROCSOriginalPapersandOfficialKeysISROCSSolvedPapersISROCSSyllabusforScientist/EngineerExamUGCNETUGCNETCSNotesPaperIIUGCNETCSNotesPaperIIIUGCNETCSSolvedPapersStudentCampusAmbassadorProgramSchoolAmbassadorProgramProjectGeekoftheMonthCampusGeekoftheMonthPlacementCourseCompetititveProgrammingTestimonialsStudentChapterGeekontheTopInternshipCareersJobsApplyforJobsPostaJobHirewithUsKnowaboutJobathonJobathonPracticeAllDSAProblemsProblemoftheDayInterviewSeries:WeeklyContestsBi-WizardCoding:SchoolContestsContestsandEventsPracticeSDESheetCuratedDSAListsTop50ArrayProblemsTop50StringProblemsTop50TreeProblemsTop50GraphProblemsTop50DPProblems ComewritearticlesforusandgetfeaturedLearnandcodewiththebestindustryexpertsGetaccesstoad-freecontent,doubtassistanceandmore!ComeandfindyourdreamjobwithusGeeksDigestQuizzesGeeksCampusGblogArticlesIDECampusMantriHomeSavedVideosCoursesGBlogPuzzlesWhat'sNew? ChangeLanguage ArrayMatrixStringsHashingLinkedListStackQueueBinaryTreeBinarySearchTreeHeapGraphSearchingSortingDivide&ConquerMathematicalGeometricBitwiseGreedyBacktrackingBranchandBoundDynamicProgrammingPatternSearchingRandomized CompleteInterviewPreparationat20%off|Usecode:PREPAREKAROCheckNow RelatedArticles ▲RelatedArticlesBitwiseand(or&)ofarangeBitwiseOperatorsinC/C++WriteaonelineCfunctiontoroundfloatingpointnumbersImplementYourOwnsizeofHowtocountsetbitsinafloatingpointnumberinC?HowtoChangetheOutputofprintf()inmain()inC?ImplementationofaFallingMatrixWhatdoesbufferflushmeansinC++?kbhitinClanguageCodetoGeneratetheMapofIndia(WithExplanation)OperatorsinC/C++Bitsmanipulation(Importanttactics)BitwiseHacksforCompetitiveProgrammingBitTricksforCompetitiveProgrammingAProgramtocheckifstringsarerotationsofeachotherornotCheckifstringsarerotationsofeachotherornot|Set2Checkifastringcanbeobtainedbyrotatinganotherstring2placesConvertingRomanNumeralstoDecimallyingbetween1to3999ConvertingDecimalNumberlyingbetween1to3999toRomanNumeralsCount‘d’digitpositiveintegerswith0asadigitCountnumberofbitstobeflippedtoconvertAtoBCountsetbitsinanintegerCounttotalsetbitsinallnumbersfrom1tonCounttotalsetbitsinallnumbersfrom1ton|Set2Counttotalsetbitsinallnumbersfrom1toN|Set3LeftShiftandRightShiftOperatorsinC/C++TravellingSalesmanProblem|Set1(NaiveandDynamicProgramming)Howtoswaptwonumberswithoutusingatemporaryvariable?Bitwiseand(or&)ofarangeBitwiseOperatorsinC/C++WriteaonelineCfunctiontoroundfloatingpointnumbersImplementYourOwnsizeofHowtocountsetbitsinafloatingpointnumberinC?HowtoChangetheOutputofprintf()inmain()inC?ImplementationofaFallingMatrixWhatdoesbufferflushmeansinC++?kbhitinClanguageCodetoGeneratetheMapofIndia(WithExplanation)OperatorsinC/C++Bitsmanipulation(Importanttactics)BitwiseHacksforCompetitiveProgrammingBitTricksforCompetitiveProgrammingAProgramtocheckifstringsarerotationsofeachotherornotCheckifstringsarerotationsofeachotherornot|Set2Checkifastringcanbeobtainedbyrotatinganotherstring2placesConvertingRomanNumeralstoDecimallyingbetween1to3999ConvertingDecimalNumberlyingbetween1to3999toRomanNumeralsCount‘d’digitpositiveintegerswith0asadigitCountnumberofbitstobeflippedtoconvertAtoBCountsetbitsinanintegerCounttotalsetbitsinallnumbersfrom1tonCounttotalsetbitsinallnumbersfrom1ton|Set2Counttotalsetbitsinallnumbersfrom1toN|Set3LeftShiftandRightShiftOperatorsinC/C++TravellingSalesmanProblem|Set1(NaiveandDynamicProgramming)Howtoswaptwonumberswithoutusingatemporaryvariable?Bitwiseand(or&)ofarangeViewDiscussion ImproveArticle SaveArticle LikeArticle DifficultyLevel: MediumLastUpdated: 01Jul,2022Giventwonon-negativelongintegers,xandygivenx<=y,thetaskistofindbit-wiseandofallintegersfromxandy,i.e.,weneedtocomputevalueofx&(x+1)&…&(y-1)&y.7 Examples:  Input:x=12,y=15 Output:12 12&13&14&15=12 Input:x=10,y=20 Output:0 RecommendedPracticeANDoperationTryIt!Asimplesolutionistotraverseallnumbersfromxtoyanddobit-wiseandofallnumbersinrange.Anefficientsolutionistofollowfollowingsteps. 1)FindpositionofMostSignificantBit(MSB)inbothnumbers. 2)IfpositionsofMSBaredifferent,thenresultis0. 3)Ifpositionsaresame.Letpositionsbemsb_p. ……a)Weadd2msb_ptoresult. ……b)Wesubtract2msb_pfromxandy, ……c)Repeatsteps1,2and3fornewvaluesofxandy. Example1: x=10,y=20 Resultisinitially0. PositionofMSBinx=3 PositionofMSBiny=4 Sincepositionsaredifferent,returnresult. Example2: x=17,y=19 Resultisinitially0. PositionofMSBinx=4 PositionofMSBiny=4 Sincepositionsaresame,wecompute24. Weadd24toresult. Resultbecomes16. Wesubtractthisvaluefromxandy. Newvalueofx=x-24=17-16=1 Newvalueofy=y-24=19-16=3 PositionofMSBinnewx=1 PositionofMSBinnewy=2 Sincepositionsaredifferent,wereturnresult. C++//AnefficientC++programtofindbit-wise&ofall//numbersfromxtoy.#includeusingnamespacestd;typedeflonglongintll; //FindpositionofMSBinn.Forexampleifn=17,//thenpositionofMSBis4.Ifn=7,valueofMSB//is3intmsbPos(lln){    intmsb_p=-1;    while(n)    {        n=n>>1;        msb_p++;    }    returnmsb_p;} //FunctiontofindBit-wise&ofallnumbersfromx//toy.llandOperator(llx,lly){    llres=0;//Initializeresult     while(x&&y)    {        //FindpositionsofMSBinxandy        intmsb_p1=msbPos(x);        intmsb_p2=msbPos(y);         //Ifpositionsarenotsame,return        if(msb_p1!=msb_p2)            break;         //Add2^msb_p1toresult        llmsb_val= (1<0){            n=n>>1;            msb_p++;        }                 returnmsb_p;    }     //FunctiontofindBit-wise&ofall    //numbersfromxtoy.    staticlongandOperator(longx,longy)    {                 longres=0;//Initializeresult         while(x>0&&y>0){                         //FindpositionsofMSBinxandy            intmsb_p1=msbPos(x);            intmsb_p2=msbPos(y);             //Ifpositionsarenotsame,return            if(msb_p1!=msb_p2)                break;             //Add2^msb_p1toresult            longmsb_val=(1<0):             n=n>>1        msb_p+=1         returnmsb_p #FunctiontofindBit-wise&of#allnumbersfromxtoy.defandOperator(x,y):     res=0#Initializeresult     while(x>0andy>0):             #FindpositionsofMSBinxandy        msb_p1=msbPos(x)        msb_p2=msbPos(y)         #Ifpositionsarenotsame,return        if(msb_p1!=msb_p2):            break         #Add2^msb_p1toresult        msb_val=(1<0)        {            n=n>>1;            msb_p++;        }        returnmsb_p;    }         //FunctiontofindBit-wise    //&ofallnumbersfromx    //toy.    staticlongandOperator(longx,longy)    {        //Initializeresult        longres=0;             while(x>0&&y>0)        {            //FindpositionsofMSBinxandy            intmsb_p1=msbPos(x);            intmsb_p2=msbPos(y);                 //Ifpositionsarenotsame,return            if(msb_p1!=msb_p2)                break;                 //Add2^msb_p1toresult            longmsb_val=(1<0)    {        $n=$n>>1;        $msb_p++;    }    return$msb_p;} //FunctiontofindBit-wise&//ofallnumbersfromxtoy.functionandOperator($x,$y){    $res=0;//Initializeresult     while($x>0&&$y>0)    {        //Findpositionsof        //MSBinxandy        $msb_p1=msbPos($x);        $msb_p2=msbPos($y);         //Ifpositionsarenot        //same,return        if($msb_p1!=$msb_p2)            break;         //Add2^msb_p1toresult        $msb_val=(1<JavascriptOutput8TimeComplexity:O(log(max(x,y)))AuxiliarySpace:O(1)Moreefficientsolution  FliptheLSBofb.Andcheckifthenewnumberisinrange(ausingnamespacestd;typedeflonglongintll;  //FunctiontofindBit-wise&ofallnumbersfromx//toy.llandOperator(llx,lly){    //Iterateoverallbitsofy,startingfromthelsb,ifit'sequalto1,flipit    for(inti=0;i=y,otherwisereturntheanswer.        if(y<=x){            returny;        }        if(y&(1<=y,otherwisereturnthe      //answer.      if(y<=x){        returny;      }      if((y&(1<=y,otherwisereturntheanswer        if(y<=x):            returny        if(y&1<=y,otherwisereturntheanswer.        if(y<=x){            returny;        }        if(y&(1<>1)andb/=2(b>>1)toreduceabitfromend.Runawhileloopaslongasa!=banda>0Rightshiftaby1andrightshiftbby1incrementshiftcountafterwhileloopreturnleft*2^(shiftcount)C++//AnefficientC++programtofindbit-wise&ofall//numbersfromxtoy.#includeusingnamespacestd;#defineintlonglongint //FunctiontofindBit-wise&ofallnumbersfromx//toy.intandOperator(inta,intb){      //ShiftCountvariablescountstillwhichbiteveryvaluewillconvertto0      intshiftcount=0;    //Iteratethrougheverybitofaandbsimultaneously      //Ifa==bthenweknowthatbeyondthattheandvaluewillremainconstant      while(a!=banda>0){          shiftcount++;          a=a>>1;          b=b>>1;    }      returnint64_t(a<0):        shiftcount=shiftcount+1        a=a>>1        b=b>>1             returna<0){          shiftcount++;          a=a>>1;          b=b>>1;    }      return(a<