Skip to content

Instantly share code, notes, and snippets.

View leynier's full-sized avatar
👨‍💻

Leynier Gutiérrez González leynier

👨‍💻
View GitHub Profile
@yarn-rp
yarn-rp / .dart
Last active December 29, 2022 18:54
enum OtherCardType { bandec, bpa, metropolitan, unknown }
// First Group
const _cubanStart = r'^92';
const _productName = r'[0-9]{2}';
const _firstGroup = _cubanStart + _productName;
// Second Group
const _bandecSecondGroup = r'0699';
@kenriortega
kenriortega / stream.class.md
Created May 7, 2021 23:34
Node.js Basic Stream data

Clase de stream nodejs API

'use strict'

const fs = require('fs')
const zlib = require('zlib')
const http = require('http')
@sergiolucero
sergiolucero / graphqlapp.py
Created June 20, 2019 13:33
basic flask-graphql app
from flask import Flask
from flask_sqlalchemy import SQLAlchemy
import os
import graphene
from graphene_sqlalchemy import SQLAlchemyObjectType, SQLAlchemyConnectionField
from flask_graphql import GraphQLView
#################################
app = Flask(__name__)
app.debug = True
#include<bits/stdc++.h>
#define maxn 100005
using namespace std;
const long long int inf = 1LL << 60;
long long int c_decrement[maxn], c_increment[maxn], dist[maxn];
vector<pair<long long int, long long int>> decrement[maxn], increment[maxn];
void dijkstra() {
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
long long ret, fact[100005], inv[100005];
int n, m, i, j, odd, sum, kk[10];
char a[100005];
struct node {
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int mn = 0;
vector<int> list;
for (int i = 0; i < n; ++i) {
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300;
const int mod = int(1e9) + 7;
const long long inf = numeric_limits<long long>::max();
class OverflowInteger {
public:
#include <bits/stdc++.h>
using namespace std;
string word;
int nodes = 0;
map<string, int> words;
vector<bool> commas(0);
vector<int> fixed_commas;
vector<string> text;
#include <bits/stdc++.h>
using namespace std;
const int maxn = int(1e5) + 10;
const long long inf = (long long) 1e16;
int n, m, s, vis[maxn], sub[maxn];
vector<pair<int, int>> graph[maxn];
vector<int> path[maxn];
#include <bits/stdc++.h>
using namespace std;
long long n, l, h;
bool table[1000001];
vector<long long> primes;
long long logarithm(long long a, long long b) {
long long answer = 1;