mcvarer

mcvarer

import subprocess

def get_gpu_memory_map():
    """Get the current gpu usage.

    Returns
    -------
    usage: dict
        Keys are device ids as integers.
        Values are memory usage as integers in MB.

mcvarer

#!/bin/bash
## This gist contains instructions about cuda v11.2 and cudnn 8.1 installation in Ubuntu 18.04 for PyTorch

#############################################################################################
##### forked by : https://gist.github.com/Mahedi-61/2a2f1579d4271717d421065168ce6a73 ########
#############################################################################################


### steps ####
# verify the system has a cuda-capable gpu

mcvarer

import re
alfabe = ['a', 'b', 'c', 'ç', 'd', 'e', 'f', 'g', 'ğ', 'h', 'ı', 'i', 'j', 'k',
          'l', 'm', 'n', 'o', 'ö', 'p', 'r', 's', 'ş', 't', 'u', 'ü', 'v', 'y', 'z']


def pangram(sentence):
    # sentence = sentence.replace(" ", "").lower()
    sentence = re.sub("\W", '', sentence).lower()

    used = []

mcvarer

import os
import cv2
from PIL import Image
import io

with open(os.path.join(os.getcwd(),"mcv.jpeg"), "rb") as f:
    image_bytes = f.read()
    img_cv2 = cv2.imread(f.name)
    print(type(img_cv2))
    

mcvarer

"""
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

What is the 10 001st prime number?
"""

import sympy.ntheory as nt


def primeNumber10001():

mcvarer

"""
The sum of the squares of the first ten natural numbers is,
        1^2 + 2^2 + ... + 10^2 = 385
The square of the sum of the first ten natural numbers is,
        (1 + 2 + ... + 10)^2 = 55^2 = 3025
Hence the difference between the sum of the squares of the first ten natural numbers and
the square of the sum is .
        3025 - 385 = 2640
Find the difference between the sum of the squares of the first one hundred natural numbers and
the square of the sum.

mcvarer

"""
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
"""

check_list = [11, 13, 14, 16, 17, 18, 19, 20]


def find_solution(step):

mcvarer

"""                                                                                                        
A palindromic number reads the same both ways.                                                             
The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.                     
Find the largest palindrome made from the product of two 3-digit numbers.                                  
"""                                                                                                        
import numpy as np                                                                                         
                                                                                                           
                                                                                                           
def rev(num):                                                                                              
    return int(num != 0) and ((num % 10) * (10 ** in

mcvarer

"""
The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?
"""


def largestPrimeFactor(flt: int, n: int) -> int:
    while flt ^ 2 < n:
        while n % flt == 0: