This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"basics": { | |
"name": "John Doe", | |
"label": "Programmer", | |
"image": "", | |
"email": "john@gmail.com", | |
"phone": "(912) 555-4321", | |
"url": "https://johndoe.com", | |
"summary": "A summary of John Doe…", | |
"location": { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* @author Ícaro Lima <icaro.lima@ccc.ufcg.edu.br> | |
*/ | |
let quero = [ | |
{ cod:1411290, turma:1 }, | |
{ cod:1109053, turma:3 }, | |
{ cod:1411316, turma:1 }, | |
{ cod:1114222, turma:1 }, | |
{ cod:1411192, turma:1 }, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
struct Vector { | |
int x, y; | |
Vector() : x(0), y(0) { } | |
Vector(int x, int y) : x(x), y(y) { } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "Node.h" | |
Node::Node(int v) { | |
value = v; | |
next = nullptr; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@Test | |
public void testTDG() { | |
// Configurar aqui! | |
final int TESTS_COUNT = 10000; | |
final int OPERATIONS_COUNT = 1000; | |
final int MAX_SIZE_INCLUSIVE = 31; | |
final int MAX_ELEMENT_VALUE = 27; // [0, X). | |
Random rand = new Random(); | |
for (int t = 0; t < TESTS_COUNT; t++) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@Test | |
public void testTDG() throws StackOverflowException, StackUnderflowException { | |
Random rand = new Random(); | |
final boolean DEBUG = false; | |
final int COUNT_TESTS = 1000; | |
final int MAX_OPERATIONS = 1000; | |
final int MAX_INTEGER = 20; | |
for (int t = 0; t < COUNT_TESTS; t++) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@Override | |
@Test | |
public void testTDG() { | |
Random rand = new Random(); | |
final boolean DEBUG = false; | |
final int COUNT_TESTS = 1000; | |
final int MAX_OPERATIONS = 1000; | |
final int MAX_INTEGER = 20; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@Test | |
public void testTDG() { | |
Random rand = new Random(); | |
final int COUNT_TESTS = 1000; | |
final int MAX_OPERATIONS = 1000; | |
for (int t = 0; t < COUNT_TESTS; t++) { | |
int operations = rand.nextInt(MAX_OPERATIONS); | |
ArrayList<Integer> arrayList = new ArrayList<>(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
#define MAX_JUMP 15 | |
struct Node { | |
int level; | |
vector< pair<int, int> > neigh; | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
int main() { | |
int states_count; | |
printf("Me diga o número de estados: "); | |
scanf("%d", &states_count); | |
int initial_state; |