RogerBenet

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
 
using namespace std;
 
int n;
int mat[110][110];

RogerBenet

#include <bits/stdc++.h>
using namespace std;

#define MAXN 100100
typedef long long ll;

int vet[MAXN],n,k;
ll res,sm,qtd;

int main(){

RogerBenet

#include<bits/stdc++.h>
using namespace std;
 
pair < int, int > lista[100100];
map < string, int > mapa;
int pai[100100],peso[100100];
char a[20],b[20];
 
int find(int a){
    if(pai[a] == a)return a;

RogerBenet

#include <bits/stdc++.h>
using namespace std;

priority_queue <int, vector <int>, greater<int> > pq;
int qtd_caixa,num_caixa,num_cliente;

int main(){

    scanf("%d %d", &num_caixa, &num_cliente);
    

RogerBenet

#include <bits/stdc++.h>
using namespace std;

typedef pair < int, string > is;
int n,c,soma[1010];
char w[20];
string txt[1010];
vector < is > vet;

int main(){

RogerBenet

#include <iostream>
#include <string>
#define MAX 20
 
using namespace std;
 
string w1,w2;
int t,c;
bool S,R;
 

RogerBenet

#include <cstdio>

int mdc(int x, int y){
    if( y == 0)
        return x;
    else mdc( y, x % y );
}

bool pitagoras(int x, int y, int z){
    return( x*x == y*y+z*z || y*y == x*x+z*z || z*z == x*x+y*y );

RogerBenet

#include <cstdio>
#include <algorithm>

using namespace std;

struct k
{
    int ini,fim;
};

RogerBenet

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAX 110

using namespace std;

int dp[MAX][55], qtd[MAX], peso[MAX], n, t;
bool used[MAX][55], res[MAX];

RogerBenet

// Autor : Roger Benet >> "roger_poker99"
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>

typedef long long int lli;
using namespace std;

#define MAXL 25