Skip to main content

CodePuller

Search This Blog

Home

Showing posts from October, 2019

Posts

Uva 1585 Solution

on October 31, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10101 Solution

on October 30, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10970 Solution

on October 29, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 499 Solution

on October 28, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11942 Solution

on October 28, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11936 Solution

on October 26, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10281 Solution

on October 25, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 12279 Solution

on October 25, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11877 Solution

on October 25, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10019 Solution

on October 24, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 541 Solution

on October 22, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10487 Solution

on October 20, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10008 Solution

on October 19, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11287 Solution

on October 19, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 492 Solution

on October 19, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11991 Solution

on October 18, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 412 Solution

on October 18, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 438 Solution

on October 17, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 350 Solution

on October 16, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10110 Solution

on October 15, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11530 Solution

on October 15, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 10260 Solution

on October 15, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 465 Solution

on October 14, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 465 Solution

on October 14, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11827 Solution

on October 14, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 11388 Solution

on October 13, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 489 Solution

on October 12, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 12798 Solution

on October 12, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 160 Solution

on October 10, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Uva 884 Solution

on October 09, 2019

+

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Legendre’s formula

on October 07, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Combination Count(ShortCut)

on October 07, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Parenthesis Combination

on October 06, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Print combinations of distinct numbers which add up to give sum N

on October 05, 2019

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

All Factors Combination

on October 05, 2019

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