masious

package q1;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.EmptyStackException;
import java.util.HashMap;
import java.util.Stack;

public class Main {

masious

package q2;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) {
		int a = 0;
		try {

masious

package q3;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.LinkedList;

public class Main {
	public static void main(String[] args) {

masious

#pragma once

template<class T>
class MyStack
{
private:
	T * array;
	int maxSize;
public:
	int front;

masious

#include<iostream>
using namespace std;

long long binaryOf(int a){
	return a?binaryOf(a/2)*10 + a%2:0;
}

int main(){
	int a;
	cin>>a;

masious

//Algorithm and implemention by Masoud Bonabi

import java.util.Stack;

public class Main {
	static Stack[] pipes;
	
	final static int N = 3;
	
	public static void solve(final int srcPipe,final int destPipe,final int solveFor){

masious

#include "Node.h"
#include<iostream>
using namespace std;

Node::Node(int elem){
	data = elem;
	isDataSet = true;
	next = nullptr;
}
Node::Node(void){

masious

public class Boss extends Employee{

	public Boss(String firstName, String lastName, int salary) {
		super(firstName,lastName);
		setSalary(salary);
	}
	
	@Override
	protected void work() {

masious

@coroutine
def receive_messages():
	try:
		while not QUIT:
			msg = (yield)
			if getattr(msg, 'sender', None) == None:
				# print("\n\n\nERROR 1\n\n")
				continue

			if getattr(msg.sender, 'type', None) == None:

masious

var Note = React.createClass({
    getInitialState: function () {
        return {
            editing: false,
            text: this.props.children
        }
    },

    edit: function () {
        this.setState({