pxpc2

#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n;
	while (scanf("%d", &n) != 0)
	{
		queue<int> entrada;

pxpc2

package br.unb;

import java.util.ArrayList;
import java.util.Collections;

public class Gabs
{
    private static final int TNAIPES = 4, TTIPOS = 13;
    private static ArrayList<Carta> cartas = new ArrayList<>();

pxpc2

#include <stdio.h>
#include <string.h>
#include <algorithm>

#define MAXN 60

struct Camiseta
{
	char cor[MAXN], nome[MAXN];
	char tamanho;

pxpc2

#include <stdio.h>

int main()
{
	unsigned long long int n_estrs = 0;
	scanf("%llu", &n_estrs);

	unsigned long long int est_atacadas = 0, carnTotal = 0, carnRoubado = 0;

	unsigned long long int estrelas[n_estrs];

pxpc2

#include <stdio.h>

int main()
{
    int tempo;
    scanf("%d", &tempo);

    tempo /= 1000;

    int hours = (tempo-(tempo%60))/3600;

pxpc2

#pragma once
#include <string>

class FBullCowGame
{
public:
	void reset(); // TODO make a more rich return value
	int getMaxTries();
	int getCurrTries();
	bool isGameWon();

pxpc2

#include "FBullCowGame.h"

void FBullCowGame::reset()
{
	return;
}

int FBullCowGame::getMaxTries()
{
	return 0;

pxpc2

bool canPlayAgain()
{
	counter++;
	return counter >= max ? false : true;
}

void checkGuess(std::string answer)
{
	std::string guess = getGuess();
	std::cout << "\nYour guess was: " << guess << std::endl;

pxpc2

package obi;

import java.util.ArrayList;
import java.util.Scanner;

/**
 * @author Pedro Daia
 */
public class BatalhaNaval
{

pxpc2

    static Tree[] trees;

    public static void main(final String[] args)
    {
        final Scanner s = new Scanner(System.in);
        final int rem = s.nextInt();
        final int D = s.nextInt();
        trees = new Tree[rem];