Skip to main content

CodePuller

Search This Blog

Home

Posts

Method Overridden.py

on April 07, 2024

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Spoj EDIST Solution

on September 24, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Minimum Edit Distance

on September 24, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Minimum Edit Distance By Recursion

on September 24, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Longest Palindromic Subsequence Print

on July 27, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Longest Palindromic Subsequence

on July 27, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

LightOJ 1232 Solution

on July 24, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

LightOJ 1231 Solution

on July 18, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

LightOJ 1094 Solution

on July 17, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Kadane's Algorithm(Print Sub-Array)

on June 25, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Spoj KNAPSACK Solution

on March 06, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

0-1 knapsack(recursively)

on February 12, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Find minimum number of coins that make a given value when use one coin many times

on February 11, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Find minimum number of coins that make a given value when use one coin many times by recursion

on February 10, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Find minimum number of coins that make a given value when use one coin only one by DP

on February 09, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Find minimum number of coins that make a given value when use one coin only one by recursion

on February 09, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Toph Eet Izz Phet! Solution

on January 09, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

String Hashing

on January 01, 2022

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Wrong Doing

on October 23, 2021

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Aubdur Rob Anik: Bangladesh

Archive

April 20241
September 20223
July 20225
June 20221
March 20221
February 20225
January 20222
October 202112
September 202115
August 20213

Show more Show less

Labels

Alogrithm
C++
Graph
Kattis Solution
LightOJ
Python Basic
Python Code
Python File Handling
Python OOP
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 << 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