diego9627

#include<iostream>
using namespace std;
int main(){
    cout << "Hola Mundo!";
}

diego9627

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

int mapa[1002][1002];

struct dato{
    int x;
    int y;
    int m;

diego9627

BusquedaBinaria(int ini,int fin){
    int m=(ini+fin)/2;
    if(ini==fin) return ini;
    if(EsGrande(m)){
        return BusquedaBinaria(m+1,fin);
    }
    else{
        return BusquedaBinaria(m,ini);
    }
}

diego9627

#include<iostream>
using namespace std;
int Q[3001][3001],I[3001][3001],R,C,N,H,W,T;

void BI1(int k,int i){
    I[i][0]=(Q[i][0]>k)? 0:1;
    for(int j=1;j<C;j++){
	    I[i][j]=((Q[i][j]>k)? 0:1)+I[i][j-1];
	}
}

diego9627

#include<iostream>
#include<cstdlib>
using namespace std;
#define MAX 1000000
#define max(a,b) (a>b)? a:b
#define min(a,b) (a<b)? a:b

typedef struct list_node {
    int node;
    int ari;

diego9627

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

list<int> aristas[5001];

struct dat{
    int ver;
    int mov;

diego9627

#include<iostream>
using namespace std;
long long int N,M,marbles[300001];
 
bool sepuede(long long int m){
    long long int i,s=0;
    for(i=0;i<M;i++){
        s+=((marbles[i]-1)/m) +1;
    }
    return (s<=N);

diego9627

#include<cstdio>
#include<iostream>
#include<queue>
#define MAX 2147483647
using namespace std;
int minimo[1001][1001];
struct coord{
    int x;
    int y;
};

diego9627

#include<cstdio>
int colores[1000000];
bool iguales[1000000];

long long mcd(long long N,long long M){
    if(N==0) return M;
    else return mcd(M%N,N);
}

int main(){

diego9627

#include<iostream>
#include<cstdio>
#include<map>
using namespace std;
int amistades[1000][1000];
int main(){
    int N,j,i,P;
    string nombre,nombre2;
    map<string,int> enumeracion;
    map<string,int>::iterator it;