summaryrefslogtreecommitdiff
path: root/I_anno/Programmazione_2/exercises
diff options
context:
space:
mode:
Diffstat (limited to 'I_anno/Programmazione_2/exercises')
-rw-r--r--I_anno/Programmazione_2/exercises/estremi-uguali.cc32
-rw-r--r--I_anno/Programmazione_2/exercises/even-length.cc27
-rw-r--r--I_anno/Programmazione_2/exercises/inizia-con.cc33
-rw-r--r--I_anno/Programmazione_2/exercises/inserimento-coda.cc119
-rw-r--r--I_anno/Programmazione_2/exercises/inserimento-pila.cc116
-rw-r--r--I_anno/Programmazione_2/exercises/minore.cc27
-rw-r--r--I_anno/Programmazione_2/exercises/prima-maiuscola.cc30
-rw-r--r--I_anno/Programmazione_2/exercises/ripetute.cc20
-rw-r--r--I_anno/Programmazione_2/exercises/sol-ripetute.cc25
9 files changed, 429 insertions, 0 deletions
diff --git a/I_anno/Programmazione_2/exercises/estremi-uguali.cc b/I_anno/Programmazione_2/exercises/estremi-uguali.cc
new file mode 100644
index 0000000..63ac019
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/estremi-uguali.cc
@@ -0,0 +1,32 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+int result(string s) {
+ if(s.at(0) == s.at(s.length()-1))
+ return 1;
+
+ return 0;
+}
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ int _;
+ string s;
+ int size{};
+ for(int i = 0; i < 3; ++i) {
+ in >> _ >> s;
+ size += result(s);
+ }
+ out << size << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/even-length.cc b/I_anno/Programmazione_2/exercises/even-length.cc
new file mode 100644
index 0000000..2d3d6a4
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/even-length.cc
@@ -0,0 +1,27 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+string result(string s) {
+ if(s.length() % 2 == 0)
+ return s;
+
+ return s.substr(0, s.length()-1);
+}
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ string s;
+ in >> s;
+ out << result(s) << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/inizia-con.cc b/I_anno/Programmazione_2/exercises/inizia-con.cc
new file mode 100644
index 0000000..97f0c39
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/inizia-con.cc
@@ -0,0 +1,33 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+string result(string s, char c) {
+ if(s.at(0) == c)
+ return s + ' ';
+
+ return "";
+}
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ int _;
+ string s;
+ char c;
+ in >> c;
+ for(int i = 0; i < 3; ++i) {
+ in >> _ >> s;
+ out << result(s, c);
+ }
+ out << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/inserimento-coda.cc b/I_anno/Programmazione_2/exercises/inserimento-coda.cc
new file mode 100644
index 0000000..6775ca2
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/inserimento-coda.cc
@@ -0,0 +1,119 @@
+#include<iostream>
+#include<fstream>
+
+using namespace std;
+
+template<class T>
+class node {
+public:
+ node(T key, node<T>* next) : _key{key}, _next{next} {}
+ node(T key) : _key{key}, _next{nullptr} {}
+ const T& key() const { return _key; }
+ T& key() { return _key; }
+ const node<T>*& next() const { return _next; }
+ node<T>*& next() { return _next; }
+private:
+ T _key;
+ node<T>* _next;
+};
+
+template<class T>
+class Coda {
+public:
+ Coda() : _head{nullptr}, _tail{nullptr} {}
+ ~Coda() {
+
+ }
+ Coda<T>* enqueue(T val) {
+ if(!_head) {
+ _head = new node<T>{val, nullptr};
+ _tail = _head;
+ } else {
+ _tail->next() = new node<T>{val, nullptr};
+ _tail = _tail->next();
+ }
+
+ return this;
+ }
+ node<T>* pop() {
+ if(!_head) return nullptr;
+ node<T>* elem = _head;
+ delete _head;
+ _head = elem->next();
+
+ return elem;
+ }
+
+ bool is_empty() { return _head == nullptr; }
+private:
+ node<T>* _head;
+ node<T>* _tail;
+};
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ string t;
+ int n;
+ in >> t;
+ switch(t.at(0)) {
+ case 'b': {
+ Coda<bool>* queue = new Coda<bool>{};
+ in >> n;
+ bool e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ queue->enqueue(e);
+ }
+ while(!queue->is_empty())
+ out << queue->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ case 'd': {
+ Coda<double>* queue = new Coda<double>{};
+ in >> n;
+ double e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ queue->enqueue(e);
+ }
+ while(!queue->is_empty())
+ out << queue->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ case 'c': {
+ Coda<char>* queue = new Coda<char>{};
+ in >> n;
+ char e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ queue->enqueue(e);
+ }
+ while(!queue->is_empty())
+ out << queue->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ case 'i': {
+ Coda<int>* queue = new Coda<int>{};
+ in >> n;
+ int e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ queue->enqueue(e);
+ }
+ while(!queue->is_empty())
+ out << queue->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ }
+ }
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/inserimento-pila.cc b/I_anno/Programmazione_2/exercises/inserimento-pila.cc
new file mode 100644
index 0000000..0dbe99b
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/inserimento-pila.cc
@@ -0,0 +1,116 @@
+#include<iostream>
+#include<fstream>
+
+using namespace std;
+
+template<class T>
+class node {
+public:
+ node(T key, node<T>* next) : _key{key}, _next{next} {}
+ node(T key) : _key{key}, _next{nullptr} {}
+ const T& key() const { return _key; }
+ T& key() { return _key; }
+ const node<T>*& next() const { return _next; }
+ node<T>*& next() { return _next; }
+private:
+ T _key;
+ node<T>* _next;
+};
+
+template<class T>
+class Pila {
+public:
+ Pila() : _head{nullptr}{}
+ ~Pila() {
+
+ }
+ Pila<T>* push(T val) {
+ if(!_head) {
+ _head = new node<T>{val, nullptr};
+ } else {
+ _head = new node<T>{val, _head};
+ }
+
+ return this;
+ }
+ node<T>* pop() {
+ if(!_head) return nullptr;
+ node<T>* elem = _head;
+ delete _head;
+ _head = elem->next();
+
+ return elem;
+ }
+
+ bool is_empty() { return _head == nullptr; }
+private:
+ node<T>* _head;
+};
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ string t;
+ int n;
+ in >> t;
+ switch(t.at(0)) {
+ case 'b': {
+ Pila<bool>* stack = new Pila<bool>{};
+ in >> n;
+ bool e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ stack->push(e);
+ }
+ while(!stack->is_empty())
+ out << stack->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ case 'd': {
+ Pila<double>* stack = new Pila<double>{};
+ in >> n;
+ double e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ stack->push(e);
+ }
+ while(!stack->is_empty())
+ out << stack->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ case 'c': {
+ Pila<char>* stack = new Pila<char>{};
+ in >> n;
+ char e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ stack->push(e);
+ }
+ while(!stack->is_empty())
+ out << stack->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ case 'i': {
+ Pila<int>* stack = new Pila<int>{};
+ in >> n;
+ int e;
+ for(int i = 0; i < n; ++i) {
+ in >> e;
+ stack->push(e);
+ }
+ while(!stack->is_empty())
+ out << stack->pop()->key() << ' ';
+ out << endl;
+ break;
+ }
+ }
+ }
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/minore.cc b/I_anno/Programmazione_2/exercises/minore.cc
new file mode 100644
index 0000000..677da76
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/minore.cc
@@ -0,0 +1,27 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ string s;
+ in >> s;
+ int minor = stoi(s);
+ for(in >> s; s != "STOP"; in >> s) {
+ int si = stoi(s);
+ if(si < minor)
+ minor = si;
+ }
+
+ out << minor << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/prima-maiuscola.cc b/I_anno/Programmazione_2/exercises/prima-maiuscola.cc
new file mode 100644
index 0000000..6273219
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/prima-maiuscola.cc
@@ -0,0 +1,30 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+string result(string s) {
+ s.at(0) = toupper(s.at(0));
+
+ return s;
+}
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ int _;
+ string s;
+ for(int i = 0; i < 3; ++i) {
+ in >> _ >> s;
+ out << result(s) << ' ';
+ }
+ out << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/ripetute.cc b/I_anno/Programmazione_2/exercises/ripetute.cc
new file mode 100644
index 0000000..23d151a
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/ripetute.cc
@@ -0,0 +1,20 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ string s;
+ in >> s;
+ out << s+s << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
diff --git a/I_anno/Programmazione_2/exercises/sol-ripetute.cc b/I_anno/Programmazione_2/exercises/sol-ripetute.cc
new file mode 100644
index 0000000..1518d76
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/sol-ripetute.cc
@@ -0,0 +1,25 @@
+#include<iostream>
+#include<string>
+#include<fstream>
+
+using namespace std;
+
+string result(string s) {
+ int half = s.length()/2;
+ return s.substr(0, half);
+}
+
+int main() {
+ ifstream in("input.txt");
+ ofstream out("output.txt");
+
+ for(int ts = 0; ts < 100; ++ts) {
+ string s;
+ in >> s;
+ out << result(s) << '\n';
+ }
+
+ in.close();
+ out.close();
+ return 0;
+}
generated by cgit v1.2.3-18-g5258 (git 2.32.0) at 2024-11-23 02:49:36 +0000