Solve 1133, 1191m 1194, 1200, 1550, 1552, 1764 and 1774 from URI

Author: AliOsm

URI/1133 - Rest of a Division.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int main() {
+	long long x, y;
+	cin >>x >> y;
+	
+	long long n = min(x, y);
+	long long m = max(x, y);
+	for(int i = n + 1; i < m; i++) {
+		if(i % 5 == 2 || i % 5 == 3)
+			cout<<i<<endl;
+	}
+    
+	return 0;
+}

URI/1191 - Tree Recovery.cpp

@@ -0,0 +1,71 @@
+#include <iostream>
+#include <memory.h>
+
+using namespace std;
+
+struct node {
+	node *left, *right;
+	char value;
+	static node *sentinel;
+
+	node() {
+		memset(this, 0, sizeof *this);
+	}
+
+	node(char key) {
+		left = right = sentinel;
+		this->value = key;
+	}
+};
+
+node *node::sentinel = new node();
+
+void free_bst(node *cur) {
+	if(cur == node::sentinel)
+		return;
+
+	free_bst(cur->left);
+	free_bst(cur->right);
+
+	delete cur;
+}
+
+void post_order(node *cur) {
+	if(cur == node::sentinel)
+		return;
+
+	post_order(cur->left);
+	post_order(cur->right);
+	cout << cur->value;
+}
+
+string preord, inord;
+node *root;
+
+void build_bst(node *&cur, int l, int r) {
+	if(l > r)
+		return;
+
+	cur = new node(preord[0]);
+
+	int cur_in = inord.find(preord[0]);
+	preord.erase(0, 1);
+
+	build_bst(cur->left, l, cur_in - 1);
+	build_bst(cur->right, cur_in + 1, r);
+}
+
+int main() {
+	while(cin >> preord >> inord) {
+		root = NULL;
+
+		build_bst(root, 0, preord.length() - 1);
+		post_order(root);
+		cout << endl;
+
+		free_bst(root);
+	}
+
+	return 0;
+}
+

URI/1194 - Pre, In and Post.cpp

@@ -0,0 +1,75 @@
+#include <stdio.h>
+#include <iostream>
+#include <memory.h>
+
+using namespace std;
+
+struct node {
+	node *left, *right;
+	char value;
+	static node *sentinel;
+
+	node() {
+		memset(this, 0, sizeof *this);
+	}
+
+	node(char key) {
+		left = right = sentinel;
+		this->value = key;
+	}
+};
+
+node *node::sentinel = new node();
+
+void free_bst(node *cur) {
+	if(cur == node::sentinel)
+		return;
+
+	free_bst(cur->left);
+	free_bst(cur->right);
+
+	delete cur;
+}
+
+void post_order(node *cur) {
+	if(cur == node::sentinel)
+		return;
+
+	post_order(cur->left);
+	post_order(cur->right);
+	cout << cur->value;
+}
+
+string preord, inord;
+node *root;
+
+void build_bst(node *&cur, int l, int r) {
+	if(l > r)
+		return;
+
+	cur = new node(preord[0]);
+
+	int cur_in = inord.find(preord[0]);
+	preord.erase(0, 1);
+
+	build_bst(cur->left, l, cur_in - 1);
+	build_bst(cur->right, cur_in + 1, r);
+}
+
+int main() {
+	int t, n;
+	cin >> t;
+	while(t-- != 0) {
+		cin >> n >> preord >> inord;
+		root = NULL;
+
+		build_bst(root, 0, preord.length() - 1);
+		post_order(root);
+		cout << endl;
+
+		free_bst(root);
+	}
+
+	return 0;
+}
+

URI/1200 - BST Operations I.cpp

@@ -0,0 +1,113 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <memory.h>
+
+using namespace std;
+
+struct node {
+	node *left, *right;
+	char value;
+	static node *sentinel;
+
+	node() {
+		memset(this, 0, sizeof *this);
+	}
+
+	node(char value) {
+		left = right = sentinel;
+		this->value = value;
+	}
+};
+
+node *node::sentinel = new node;
+
+vector<char> trav;
+
+node * insert(node *cur, char &value) {
+	if(cur == node::sentinel) return new node(value);
+	if(cur->value == value) return cur;
+	cur->value > value ? cur->left = insert(cur->left, value) : cur->right = insert(cur->right, value);
+	return cur;
+}
+
+bool search(node *cur, char value) {
+	if(cur == node::sentinel) return false;
+	if(cur->value == value) return true;
+	return cur->value > value ? search(cur->left, value) : search(cur->right, value);
+}
+
+void pre_order(node *cur) {
+	if(cur == node::sentinel) return;
+	trav.push_back(cur->value);
+	pre_order(cur->left);
+	pre_order(cur->right);
+}
+
+void in_order(node *cur) {
+	if(cur == node::sentinel) return;
+	in_order(cur->left);
+	trav.push_back(cur->value);
+	in_order(cur->right);
+}
+
+void post_order(node *cur) {
+	if(cur == node::sentinel) return;
+	post_order(cur->left);
+	post_order(cur->right);
+	trav.push_back(cur->value);
+}
+
+void print() {
+	for(int i = 0; i < (int)trav.size(); ++i)
+		cout << (i ? " " : "") << trav[i];
+	cout << endl;
+}
+
+void free_bst(node *cur) {
+	if(cur == node::sentinel)
+		return;
+
+	free_bst(cur->left);
+	free_bst(cur->right);
+
+	delete cur;
+}
+
+int main() {
+	node *root = NULL;
+
+	string s;
+	char c;
+	while(cin >> s) {
+		trav.clear();
+
+		if(s == "PREFIXA") {
+			pre_order(root);
+			print();
+		} else if(s == "INFIXA") {
+			in_order(root);
+			print();
+		} else if(s == "POSFIXA") {
+			post_order(root);
+			print();
+		} else if(s == "I") {
+			cin >> c;
+			if(root == NULL)
+				root = new node(c);
+			else
+				insert(root, c);
+		} else {
+			cin >> c;
+			if(search(root, c))
+				cout << c << " existe" << endl;
+			else
+				cout << c << " nao existe" << endl;
+		}
+	}
+
+	free_bst(root);
+
+	return 0;
+}
+

URI/1550 - Inversion.cpp

@@ -0,0 +1,63 @@
+#include <stdio.h>
+#include <memory.h>
+#include <queue>
+
+using namespace std;
+
+int from, to;
+bool vis[1000001];
+queue<int> qu;
+
+int reverse(int x) {
+	int tmp = 0;
+	while(x != 0) {
+		tmp *= 10;
+		tmp += x % 10;
+		x /= 10;
+	}
+	return tmp;
+}
+
+int BFS() {
+	while(!qu.empty()) qu.pop();
+	qu.push(from);
+
+	int size, fr, cost = 0;
+	while(!qu.empty()) {
+		size = qu.size();
+
+		while(size--) {
+			fr = qu.front();
+			qu.pop();
+
+			if(fr == to)
+				return cost;
+
+			if(!vis[fr + 1])
+				qu.push(fr + 1);
+			vis[fr + 1] = true;
+
+			fr = reverse(fr);
+			if(!vis[fr])
+				qu.push(fr);
+			vis[fr] = true;
+		}
+
+		++cost;
+	}
+
+	return cost;
+}
+
+int main() {
+	int t;
+	scanf("%d", &t);
+	while(t-- != 0 ) {
+		scanf("%d %d", &from, &to);
+		memset(vis, false, sizeof vis);
+		printf("%d\n", BFS());
+	}
+
+	return 0;
+}
+