Skip to main content

CodePuller

Assisting the problem solver by describing how to solve the problem | Algorithm

Search This Blog

Home

Home

Home

Showing posts from September, 2021

Posts

Print all Permutation by Backtracking

on September 30, 2021

Get link
Facebook
X
Pinterest
Email
Other Apps

Recursion Problem Solve

on September 29, 2021

Get link
Facebook
X
Pinterest
Email
Other Apps

LightOJ 1003 Solution

on September 26, 2021

Get link
Facebook
X
Pinterest
Email
Other Apps

LightOJ 1002 Solution

on September 25, 2021

Get link
Facebook
X
Pinterest
Email
Other Apps

LightOJ 1101 Solution

on September 25, 2021

Get link
Facebook
X
Pinterest
Email
Other Apps

Aubdur Rob Anik: Bangladesh

Archive

September 20223
July 20225
June 20221
March 20221
February 20225
January 20222
October 202111
September 202115
August 20213
July 202116

Show more Show less

Labels

Alogrithm
C++
Graph
Kattis Solution
LightOJ
Python Basic
Python Code
Python File Handling
Spoj Solution
STL

Technic
Toph Solution
Uva Solution

Show more Show less

Translate

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...

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; ...

Powered by Blogger