CodePuller

Search This Blog

While Loop.py

on July 04, 2020

Get link
Facebook
X
Pinterest
Email
Other Apps

#1 To 100 Even Number ::

i = 1
print("Odd Number Are :: ")
while i <= 100 :
    print(i)
    i+=2

i = 2
print("\nEven Number Are :: ")
while i <= 100 :
    print(i)
    i+=2

Python Basic

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Labels

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

Technic52 Toph Solution1 Uva Solution87

Show more Show less

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

Uva 11150 - Cola Solution

#include<stdio.h> int main() { int n, sum = 0, rem, a = 0, r; while(scanf("%d",&n) == 1) { sum = 0; a = 0; r = 0; while(n != 0) { sum = sum + n; rem = n%3; a = a + rem; n = n/3; } r = a/2; printf("%d\n",sum+r); } return 0; }

Powered by Blogger

While Loop.py

Comments

Post a Comment