sofhiasouza

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

int main()
{
	int n, k, vet[10010], dif[10010];
	
	cin >> n >> k;
	

sofhiasouza

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

int main()
{
	int n, vet[MAXN], k;
	
	cin >> n;
	for(int i = 0 ; i < n ; i++)

sofhiasouza

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

int n, m, pontos[MAXN], comp[MAXN];

inline int find(int x)
{
	if(comp[x] == x) return x;
	return comp[x] = find(comp[x]);

sofhiasouza

#include <set> //biblioteca do set

using namespace std;

int main(){
    set<int> t; 

    t.insert(5); //Adiciona o elemento 5 no set
    t.insert(12); //Adiciona o elemento 12 no set
}

sofhiasouza

#include <set> //biblioteca do set

using namespace std;

int main(){
    set<int> t; //cria um set que armazena valores inteiros
}

sofhiasouza

#include <set> //biblioteca do set

using namespace std;

int main(){
    set<int> t; 

    t.insert(5); 
    t.insert(12); 

sofhiasouza

#include <iostream>
#include <set> //biblioteca do set

using namespace std;

int main(){
    set<int> t; 

    t.insert(5); 
    t.insert(12); 

sofhiasouza

#include <iostream>
#include <set> //biblioteca do set

using namespace std;

int main(){
    set< int > t; 

    for(int i = 10 ; i >= 1 ; i--) 
    	t.insert(i);

sofhiasouza

#include <bits/stdc++.h>
#define MAXN 100010
#define inf 1000000
using namespace std;

int n, bit[MAXN];

struct cmpt
{
	int a, b, c;

sofhiasouza

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

typedef long long int ll;

int n, k, p[K], soma;

inline void f(int i, ll mult, int qnt) 			//indice atual, valor atual, quantidade de fatores na multiplicacao
{