Skip to content

Instantly share code, notes, and snippets.

View paolojoaquinp's full-sized avatar

Paolo Joaquin Pinto paolojoaquinp

View GitHub Profile
@paolojoaquinp
paolojoaquinp / gist:6b189ee5b6f66b7db51ab3ba0ef125ea
Last active September 22, 2023 15:51
data contratos resueltos.
export const initialData = [
{
'nit-ci' : 4315360,
'empresa_persona': 'Jeanethe Concepcion Corbalan Ayarza',
'entidad_contratante': 'Vicepresidencia Del Estado Plurinacional',
'objeto_contratacion': 'consultor individual de linea : secretaria/o administrativa/o (CUCE:15-0006-00-771976-0-E)',
'monto_contrato':32930,
'fecha_sucripcion':'4-1-16',
'fecha_resolucion':new Date(2016,3,11),
'causante_entidad':'Por acuerdo de partes',
@paolojoaquinp
paolojoaquinp / tablet.css
Created October 19, 2021 02:54
lego-superheroes/styles/tablet.css
* {
margin: 0;
padding:0;
}
body {
width: 100%;
height: 100vh;
}
.page {
overflow-y: auto;
@paolojoaquinp
paolojoaquinp / phone.css
Created October 19, 2021 02:27
lego-superheroes/styles/phone.css
.navbar__content {
width: 100%;
display: flex;
justify-content: space-between;
padding: 10px 30px;
}
.navbar__menu ul {
margin: 30px 0 0 0;
opacity: 0;
position: absolute;
@paolojoaquinp
paolojoaquinp / main.css
Created October 19, 2021 02:23
lego-superheroes/styles/main.css
:root {
--primary-yellow: #ffd602;
--primary-red: #d5040a;
--primary-blue: #035cb6;
}
body {
font-family: 'Lato', sans-serif;
font-weight: 300;
height: 100vh;
margin: 0;
A. BOB Y LOS PARENTESIS --------------------------------------------------------------------
import java.util.Scanner;
import java.util.Stack;
public class Bob_y_los_parentesis {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
for (int i = 0; i < n; i++) {
String[] vec = sc.nextLine().split("");
@paolojoaquinp
paolojoaquinp / problemas-resueltos-inf143-inv-2021.txt
Last active July 14, 2021 17:45
PROBLEMAS RESUELTOS Concurso 2 MLS INF143-INV 2021
# EJERCICIO NÚMERO 1: ORDENANDO NUMEROS --------------------------------------------------------------------------
#include <iostream>
using namespace std;
void ordenarVector(int n, int arr[]) {
for (int i = 1; i < n; i++) {
for (int j = 0; j < (n-1); j++) {
if(arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];