Lucas Amparo Barbosa lucasamparo
This file contains hidden or 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
| import requests as rq | |
| import bibtexparser as parser | |
| import argparse | |
| import progressbar | |
| def readFile(path): | |
| doi_list = [] | |
| f = open(path, "r") | |
| for doi in f: |
This file contains hidden or 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
| cmake_minimum_required(VERSION 2.6 FATAL_ERROR) | |
| project(keypoints) | |
| set(CMAKE_CXX_STANDARD 11) | |
| find_package(PCL 1.3 REQUIRED) | |
| find_package(OpenCV REQUIRED) | |
| include_directories( |
lucasamparo
/ Set of Divisors
Last active
February 26, 2019 13:48
A code snippet to pick the set of divisor from a number, with or without limit the largest possible value. Enjoy, if useful.
This file contains hidden or 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
| import numpy as np | |
| def pick_divisors(value, max_divisor=None): | |
| divisors = [] | |
| calc_value = np.int0(np.sqrt(value)) | |
| limit = calc_value if max_divisor is None else min(max_divisor, calc_value) | |
| for i in range(1, limit): | |
| if value % i == 0: | |
| divisors.append(i) | |