Bit Manipulation
- To find no of set bits: num&(num-1)
- To find the rightmost set digit: num&(-num)
- num&~(num-1)
DP-Fibonacci Memoisation
#include <bits/stdc++.h> using namespace std; int f(int n, vector<int>&dp) { if(n<=1) return n; if(dp[n]!=-1) return dp[n]; return dp[n]=f(n-1,dp)+f(n-2,dp); } int main() { // your code goes here int n; cin>>n; vector<int>dp(n+1,-1); cout<<f(n,dp); return 0; }
Comments
Post a Comment