Skip to content

Instantly share code, notes, and snippets.

View Gabrielgtt's full-sized avatar

Gabriel Tavares Gabrielgtt

  • Federal University of Campina Grande
  • Campina Grande, PB, Brazil
View GitHub Profile
@Gabrielgtt
Gabrielgtt / C.cpp
Created November 20, 2017 01:01
Da lista 4
#include <bits/stdc++.h>
#define ii pair <int, int>
#define iii pair <int, ii>
#define mp make_pair
#define LOGMAXN 15
#define MAXN 20000
using namespace std;
vector <iii> edges;
vector <ii> grafo[MAXN];
#include <bits/stdc++.h>
#define MAXN 100010
#define LOGMAXN 21
#define ii pair <int, int>
using namespace std;
int parent[MAXN][LOGMAXN], pai[MAXN], nodes;
long long int custo[MAXN];
vector <ii> grafo[MAXN];
int flag[MAXN], level[MAXN];
@Gabrielgtt
Gabrielgtt / Aluno.java
Last active December 6, 2017 00:38
LAB4
/**
* Classe que representa o aluno, guardando suas suas informações básicas: nome, curso e matrícula.
*
* @author Gabriel Tavares
*/
public class Aluno {
private String matricula;
private String nome;
private String curso;
/**
* @author Gabriel Alves Tavares
*/
public class Facade {
private Sistema sistema;
/**
* Inicializa o sistema de controle principal do programa
* @param caixa valor inicial do caixa
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define ii pair <int, int>
#define f first
#define s second
#define INF 1e9
#define MOD 1000000007
#define pb push_back
#define MAXN 100010
#include <bits/stdc++.h>
#define MAXN 200000
#define debug_arr(arr, n) cerr << #arr << " = "; for (int i=0;i<n;i++) cout << arr[i] << " \n"[i == n-1]
using namespace std;
string frase, grande, pequena;
int n, m, back[MAXN];
vector < vector <int> > dp;
#include <bits/stdc++.h>
#define MAXN 2000020
#define f first
#define ll long long
#define s second
#define ii pair <ll, ll>
using namespace std;
ll pena[MAXN];
ii fle[MAXN];
#include <bits/stdc++.h>
#define MAXN 100010
#define MAXSQRT 450
using namespace std;
int n, q, arr[MAXN], buckets[MAXSQRT][MAXN], raiz;
vector <int> primos = vector <int> ({2, 3, 5, 7, 11 ,13});
int gcd(int a, int b){
return b == 0 ? a : gcd(b, a%b);
#include <bits/stdc++.h>
#define MAXN 2005000
#define ii pair <int, int>
#define ll long long
#define ff first
#define ss second
using namespace std;
int dp[MAXN];
#include <bits/stdc++.h>
#define MAXN 51010
#define MAXLOG 23
#define ll long long
#define sz(a) ((int) a.size())
using namespace std;
vector <int> grafo[MAXN];
vector <int> primos;
bool crivo[MAXN];