lectricas

package main.com.company.solver

import kotlin.test.assertFalse
import kotlin.test.assertTrue


class PropositionSolver {
    private var openBranches = 0

    fun solve(test: Prop): Boolean {

lectricas

#include <cstdio>
#include <cctype>
#include <string>
#include <iostream>
#include <vector>
#include <assert.h>
#include <algorithm>
#include <unordered_map>
#include <map>

lectricas

#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <sstream>

using namespace std;

string insert(string &input, unordered_map<int, string> &sorted) {
    for (int i = 0; i < input.size(); i++) {

lectricas

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int vertex_count;
    cin >> vertex_count;
    vector<vector<char>> matrix(vertex_count, vector<char>(vertex_count));
    for (int i = 0; i < vertex_count; i++) {

lectricas

//
// Created by apolyusov on 19.04.2021.
//

#include "solution.h"

Node *my_method(Node *root) {
    if (root->right == nullptr) {
        return root;
    }

lectricas

void print_range(Node *root, int L, int R) {
    if (root == nullptr) {
        return;
    }

    print_range(root->left, L, R);
    if (root->value <= R && root->value >= L) {
        cout << root->value << "\n";
    }
    print_range(root->right, L, R);

lectricas

#include <string>
#include <iostream>
#include <sstream>
#include <cmath>
#include <vector>

using namespace std;

#define p 10
#define s 2654435769

lectricas

	#include <string>
#include <array>
#include <iostream>
#include <unordered_map>
#include <cassert>
#include <sstream>


using namespace std;

lectricas

#include <iostream>

//
// Created by lectr on 24.03.2021.
//
#include <unordered_map>
#include <string>

int main() {
    int n;

lectricas

int main() {
    std::string st1, st2;
    getline(std::cin, st1);
    getline(std::cin, st2);

    std::unordered_map<char, char> map;

    if (st1.length() != st2.length()) {
        std::cout << "NO";
        return 0;