Biazus

#include <iostream>
#include <queue>

using namespace std;

int main() {
    queue<int> fila;
    int n, aux, i;
    //int executed = 0;
    while (cin >> n) {

Biazus

//http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=22&page=show_problem&problem=2003
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <string.h>
#include <sstream>
#include <map>
 
using namespace std;

Biazus

#include <iostream> 
#include <stack> 
 #include <queue> 
using namespace std; 

int main() { 
int n, s, q, TC; 
 	cin >> TC;
 
 	for (; TC > 0; TC--) {

Biazus

#include <iostream> 
#include <stack> 
#include <queue> 
using namespace std; 
 
int main() { 
    int SET = 0;
    cin >> SET;
    
    while(SET){

Biazus

// 3n+1

#include <iostream>
#include <cstdio>

using namespace std;
 
int main() { 
	int i, j, k, l, n, partial=0, maximum=0, resto, troca=1;
	

Biazus

//Division of NLogonia
#include <iostream>
using namespace std;
int main() {
	int n, px, py, x, y;
	cin >> n;
	while (1) {
		cin >> px >> py;
		while (1) {
			cin >> x >> y;

Biazus

//Big Numbers of Teams Will Solve This

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
int main() {

Biazus

%{
#include <stdio.h>
#include <stdlib.h>
#include "hash.h"

extern int getLineNumber(void);
extern int isRunning(void);

%}

Biazus

#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
 
map<string, int> Map;
string Name[105];
vector<int> toNxt[105];
int beConnected[105];

Biazus

#include <iostream>
#include <cstring>
#include <vector>

using namespace std;

struct pos{
  int d;  //0:North, 1:East, 2:South, 3:West
  int z;  //0:green, 1:white, 2:blue, 3:red, 4:black
  int i;