Skip to main content

CodePuller

Search This Blog

Bitwise Operation Link

on March 30, 2020

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

https://returnzerooo.wordpress.com/2016/06/30/%E0%A6%AC%E0%A6%BF%E0%A6%9F%E0%A7%87%E0%A6%B0-%E0%A6%AE%E0%A6%9C%E0%A6%BE-%E0%A6%AE%E0%A6%9C%E0%A6%BE%E0%A6%B0-%E0%A6%AC%E0%A6%BF%E0%A6%9F/

http://shoshikkha.com/archives/2017

http://shoshikkha.com/archives/2021

https://anindyaspaul.com/blog/2013/07/27/bitwise-operator/

https://askmeanything.info/check-even-odd-using-bitwise-operator/

https://www.zubaircse.com/swapping-%E0%A6%A8%E0%A6%BF%E0%A7%9F%E0%A7%87-%E0%A6%AE%E0%A6%9C%E0%A6%BE%E0%A6%B0-%E0%A6%AE%E0%A6%9C%E0%A6%BE%E0%A6%B0-%E0%A6%9F%E0%A6%BF%E0%A6%AA%E0%A6%B8%E0%A7%8D%E2%80%8C/

https://www.geeksforgeeks.org/power-set/

https://en.cppreference.com/w/cpp/utility/bitset

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Comments

Post a Comment

Labels

Alogrithm52 C++3 Graph15 Kattis Solution2 LightOJ23 Python Basic56 Python Code6 Python File Handling12 Python OOP18 Spoj Solution17

STL3 Technic52 Toph Solution1 Uva Solution87

Show more Show less

Popular Posts

Uva 12347 Solution

#include<bits/stdc++.h> using namespace std; struct node{ int data; node *left; node *right; }; node *newnode(int data){ node *temp = (node*) malloc(sizeof(node)); temp->data = data; temp->left = temp->right = NULL; return temp; } node *inserti(node *node, int data) { if(node == NULL) return newnode(data); else if(data < node->data) node->left = inserti(node->left, data); else if(data > node->data) node->right = inserti(node->right, data); return node; } void postorder(node *node){ if(node == NULL) return; postorder(node->left); postorder(node->right); cout << node->data <<endl; } int main() { int n; int i = 1; node *root = NULL; while(cin >> n) { if(i == 1) { root = inserti(root, n);

Spoj CLFLARR Solution

#include<bits/stdc++.h> using namespace std; int parent[3000000]; int Find(int x) { if(parent[x] == x) return x; return parent[x] = Find(parent[x]); } void Union(int a, int b) { int u = Find(a); int v = Find(b); int indx = max(u, v); /// max() function use for update parent index parent[u] = indx; parent[v] = indx; } int main() { int n, q; cin >> n >> q; int l[q+5], r[q+5], c[q+5], v[n+5]; for(int i=1;i<=n+1;i++) { parent[i] = i; v[i] = 0; } for(int i=0;i<q;i++) cin >> l[i] >> r[i] >> c[i]; for(int i=q-1;i>=0;i--) { int left = Find(l[i]); while(left <= r[i]) { v[left] = c[i]; Union(left, left+1); /// for index update left = Find(left); /// for index increment } } for(int i=1;i<=n;i++) cout << v[i] << "\n"; return 0; }

URI 1094 Solution

#include<stdio.h> int main() { int an, i, sumc = 0, sumr = 0, sums = 0, sum = 0, n; double a, b, c; char ch; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d %c",&an,&ch); if(ch == 'C') { sumc = sumc + an; } else if(ch == 'R') { sumr = sumr + an; } else if(ch == 'S') { sums = sums + an; } sum = sum + an; } a = ((float)sumc*100)/(float)sum; b = ((float)sumr*100)/(float)sum; c = ((float)sums*100)/(float)sum; printf("Total: %d cobaias\n",sum); printf("Total de coelhos: %d\n",sumc); printf("Total de ratos: %d\n",sumr); printf("Total de sapos: %d\n",sums); printf("Percentual de coelhos: %0.2lf %c\n",a,37); printf("Percentual de ratos: %0.2lf

Powered by Blogger