(CVPR2024 Highlight) Novel Class Discovery for Ultra-Fine-Grained Visual Categorization (UFG-NCD)

Compute the least common multiple (lcm).

This repository aims to streamline your programming tasks with a variety of utility functions. Currently featuring encoding and decoding utilities, bit operations, finding modular inverse, and input sanitization.

Basic crypto algorithms

Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.

misc scripts

Решено 36 алгоритмических задач различной сложности на языке Python. Оформлен файл Readme.md с описанием каждой задачи и ссылками на исходный код с решениями.

A simple Docker environment for the Grand Comic Database (GCD) with some Python scripts for interacting with the database

Greatest Common Divisor

Погружение в Python. Простые типы данных

Computer Algebra problem-solving function using SymPy . Projects for the course "Computer Algebra I" https://www.e-ce.uth.gr/studies/undergraduate/courses/ece413/?lang=en

To calculate the GCD Number using loop and with Euclidean method

The training project "Brain Games" on Hexlet.io

The training project "Brain Games" on the Python Development course on Hexlet.io

This is a very simple python script that helped me find the Greatest Common Divisor of two numbers using the Euclidean Algorithm (with steps!)

Computing the greatest common divisor (GCD) of two numbers

Proste programy napisane w 🐍PYTHONIE🐍

Proyecto corto realizado para la clase de Matemática Discrete, contiene funciones para obtener el mcd de 2 números dados con el algoritmo de eculides, determinar si un número es primo o compuesto y determinar los factores de un número

Code from Introduction to Computer Security course from PPGCC at UFPA with Roberto Samarone

University project: glow curve analysis software for exponential heating