Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #pragma GCC Optimize("Ofast")
- #include <iostream>
- #include <vector>
- #include <set>
- #include <chrono>
- #include <string>
- #include <time.h>
- #include <unordered_set>
- #include <cmath>
- #include <map>
- #include <queue>
- #include <unordered_map>
- #include <algorithm>
- #include <fstream>
- #include <sstream>
- #include <cstddef>
- #include <cstdio>
- #include <iostream>
- #include <memory>
- #include <stdexcept>
- #include <string>
- #include <array>
- using namespace std;
- #define vi vector<int>
- #define vec vector
- void solution1(istream& in, ostream& out) {
- int a, b;
- in >> a >> b;
- out << a + b * 2;
- }
- void solution2(istream& in, ostream& out) {
- int a, b;
- in >> a >> b;
- out << a * 2 + b;
- }
- int juje_solution(int a, int b, void solution(istream& in, ostream& out)) {
- stringstream in, out;
- in << a << " " << b << "\n";
- in.flush();
- solution(in, out);
- int ans;
- out.flush();
- out >> ans;
- return ans;
- }
- pair<int, int> juje_solutions(int a, int b) {
- return { juje_solution(a, b, solution1), juje_solution(a, b, solution2) };
- }
- int32_t main() {
- auto x = juje_solutions(10, 12);
- cout << x.first << " " << x.second << "\n";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement