Biazus

HASh_NODE *makeTemp(void)
{
    static int nextTemp = 0;
    static char tempName[256];
    sprintf(tempName,"myStrangeeTemp%d", nextTemp++);
    return hashInsert(HASH_VARIABLE, tempName);
    
}

HASh_NODE *makeLabel(void)

Biazus

#include "tacalepau.h"
#include<stdlib.h>

TAC* makeBinOp(int type, TAC* code0, TAC* code1);
TAC* makeIf(TAC* code0, TAC* code1);

TAC* tacCreate(int type, HASH_NODE *res, HASH_NODE *op1, HASH_NODE *op2){
    
    TAC* newtac = 0;
    newtac = (TAC*) calloc(1,sizeof(TAC));

Biazus

#include<cstdio>
#include<iostream>

//Fácil - Let Me Count The Ways

using namespace std;
 
int main() {
		
    long ways[30001] = {0}; //se nao colocar double da valor negativo

Biazus

#include <iostream>

using namespace std;

int matrix[199][199]; //maximo eh 200
int gr[199];
int x[199];
bool isBicolorable;

void f(int n){

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;

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 <stdio.h>
#include <stdlib.h>
#include "hash.h"

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

%}

Biazus

//Big Numbers of Teams Will Solve This

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

using namespace std;
int main() {

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

// 3n+1

#include <iostream>
#include <cstdio>

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