Skip to content

Instantly share code, notes, and snippets.

700000
1000000
11000000
11400000
11400001
11450001
12350001
12350003
12410003
12410503
#include <cstdio>
int main(){
printf("hello world\n");
return 0;
}
#include <cstdio>
int main(){
int n;
while(true){ // varias entradas
scanf("%d", &n); // leia o valor de n
#include <cstdio>
int main(){
int n;
while(true){ // varias entradas
scanf("%d", &n); // leia o valor de n
import java.io.*;
public class solucao{
public static void main(String[] args)throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
int i,qtd,n,c,x;
String[] aux;
while(true){
n = Integer.parseInt(in.readLine());
if(n == 0)break;
#include <cstdio> // printf, scanf
int secao[100100], A, soma, n; // declare o vetor secao e as variáveis A, soma e n
int main(){
scanf("%d", &n);
for(int i=1; i<=n; i++){ // leia a entrada
import java.io.*;
public class solucao{
public static void main(String[] args)throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
int[] vet = new int[110000];
int i,n,sm1,sm2;
String[] aux;
n = Integer.parseInt(in.readLine());
aux = in.readLine().split(" ");
//
// reduzindo_detalhes_em_um_mapa.cpp
// programas2
//
// Created by Lucca Siaudzionis on 24/02/13.
// Copyright (c) 2013 Luccasiau. All rights reserved.
//
#include <cstdio>
#include <algorithm>
#include <cstdio>
#define MAXN 1010
#define INF 999999999
#define min(A,B) ((A)<(B))?(A):(B)
//Globais-------------
int n,m;
int marcado[MAXN];
#include <cstdio>
#define MAXN 1010
#define INF 999999999
#define min(A,B) ((A)<(B))?(A):(B)
//Globais-------------
int n,m;
int marcado[MAXN];