GitHub

HackerRank - Sherlock and GCD - Python 3.10 write up.py

## There exists no integer greater than one that divides all elements of B ## There are no elements of B which are equal to one another # With this in mind we simply find the GCD of the first two ...
GitHub

Generative Camera Dolly: Extreme Monocular Dynamic Novel View Synthesis

This repository contains the Python code published as part of our paper "Generative Camera Dolly: Extreme Monocular Dynamic Novel View Synthesis" (abbreviated GCD). We provide setup instructions, ...
note

ちょっとアルゴニズム - GCD,LCM

GCDとはGreatest Common Divisor、最大公約数です。最古のアルゴリズムということです。すごいです。 そこで、今回はLeast Common MultipleはLCM、最小公倍数の算出をしてみます。まず、GCD(最大公約数)ですが。Swiftで書きます。 実行してみます。 gcd(12,8) とすると"6"と ...