Codeforces Round 958 Div 2 | Problem C | Increasing Sequence with Fixed OR | Editorial.

Codeforces Round 958 Div 2 | Problem C | Increasing Sequence with Fixed OR | Editorial.
Increasing Sequence with Fixed OR
Codeforces Round 958
Divison 2
Problem C
Solution : codeforces.com...
#IncreasingSequencewithFixedOR
#codeforces
#divison2 2
#Problem
#codechefsolution
#MaximumPointsAfterEnemyBattles
#AlternatingGroupsII
#NumberofSubarraysWithANDValueofK
#inversion
#leetcode
#3176
#3177
#BiweeklyContest
#132
#dp
#segmenttree
#lazypropogation
#hindisolution
#ProgrammingTutorial
#AlgorithmExplanation
#StringManipulation
#codinginhindi
#dynamicprogramming
#CodeChefContest
#problemsolving
#BinaryStrings
#programminginhindi
#CompetitiveProgrammingTutorial
#AlgorithmExplanationInHindi
#StringManipulationTutorial
#codingtutorial
#HindiCodingTutorial
#CodeChefContest
#problemsolving
#BinaryStrings
#programminginhindi
#CompetitiveProgrammingTutorial
#AlgorithmExplanationInHindi
#StringManipulationTutorial
#codingtutorial
#HindiCodingTutorial
#algorithmanalysis
#programminglogic
#problemsolvingtechniques
#StringManipulationTechniques
#codeexplanation
#HindiProgrammingTutorial
#codingtips
#programmingeducation
#OnlineProgrammingContest
#ProgrammingSkills
#computersciencetutorial

[@palashmalu2065]

great explanation bhai

[@pretestpassed157]

Thankyou

[@priyanshkumar17]

thanks bhaiya!!! Great explanation

[@pretestpassed157]

Thankyou

[@rpdesigns3545]

nice bro

[@pretestpassed157]

Thankyou

[@Random-yc3dx]

Nice explaination bhaiya

[@pretestpassed157]

Thankyou

[@Random-yc3dx]

@@pretestpassed157 Aap Nit patna me padhte the na

[@pretestpassed157]

Yes

[@gyanikumari4973]

Thank you for the video🎉

[@pretestpassed157]

Thankyou

[@factsbyawadheshgupta6961]

void solve() {
cin>>n;
string s = itos(n);
int m = s.size();
set ans;
int i = 0;
while(i < m) {
if(s[i] == '1') {
string t = s;
t[i] = '0';
int y = stoll(t, nullptr, 2);
if(y) ans.insert(y);
}
i++;
}
ans.insert(n);
cout

[@pretestpassed157]

Nice

[@reactcode9148]

Thanks, just waiting for problem C editorial.

[@pretestpassed157]

Thankyou

[@OmjiKesharwani-b5t]

sir how you have calculated the size of the vector to be 60 ??

[@pretestpassed157]

Because the maximum value of n is till upto 10^18 and number of set bit till 10^18 is 59 ( as 2 to power 60 is greater then 10^18 ) so the maximum size will be 60

[@abhinavkumar7801]

Hi Sir,
I have used similar idea but in a different approach.
Can you please help me where am I missing?
It is giving wrong answer.
#include
#include
using namespace std;
#define ll long long int
string decToBinary(ll n){string s="";int i = 0;while (n > 0) {s =to_string(n % 2)+s;n = n / 2;i++;}return s;}
ll binaryToDecimal(string n){string num = n;ll dec_value = 0;int base = 1;int len = num.length();for(int i = len - 1; i >= 0; i--){if (num[i] == '1')dec_value += base;base = base * 2;}return dec_value;}


void print(vector& v)
{
for(auto x: v)
cout