Skip to content

Instantly share code, notes, and snippets.

View Khuirul-Huda's full-sized avatar
:octocat:
Studying

Muhammad Khuirul Huda Khuirul-Huda

:octocat:
Studying
  • Semarang, Central Java, Indonesia
  • 12:18 (UTC +07:00)
  • X @khuirul_huda
View GitHub Profile
def sieve_of_eratosthenes(limit):
print("Masukkan batas bilangan yang diuji:")
if limit < 2:
return []
# Step 6: Coret angka 0 dan 1
bilangan = [True] * (limit + 1)
bilangan[0] = bilangan[1] = False
# Step 8: Mulai dari p = 2
@Khuirul-Huda
Khuirul-Huda / Selenium in google colab, crawling SPA pages using Selenium and BeautifulSoup.ipynb
Last active March 5, 2025 01:00
Selenium in google colab, crawling SPA pages using Selenium and BeautifulSoup
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
#include <iostream>
using namespace std;
int power(int number, int pow) {
if (pow == 0){
return 1;
}
return number * power(number, pow-1);
}
@Khuirul-Huda
Khuirul-Huda / pangkat.cpp
Created September 23, 2023 13:50
powered / perpangkatan
#include <iostream>
using namespace std;
int main() {
int hasil = 1;
int angka = 3;
int pangkat = 3;
for (int i = 1; i <= pangkat; i++) {
# Muhammad Khuirul Huda
umur = int(input("Masukkan Umur Anda: "))
jenisKelamin = input("Masukkan Jenis Kelamin Anda: ")
hasilTes1 = float(input("Hasil Tes 1: "))
hasilTes2 = float(input("Hasil Tes 2: "))
kolomC = 0
kolomE = 0
#include <iostream>
using namespace std;
int main()
{
int umur;
string jenisKelamin;
@Khuirul-Huda
Khuirul-Huda / isPrime.cpp
Last active October 12, 2023 07:51
isPrime.cpp V2
#include <iostream>
using namespace std;
bool isPrima(int number) {
if (number <= 1 ) {
return false;
}
for (int i = 2; i < number; i++) {
if ((number % i) == 0) {
@Khuirul-Huda
Khuirul-Huda / isPrime.cpp
Last active September 12, 2023 00:01
punya huda
#include <iostream>
using namespace std;
// fungsi untuk menentukan apakah input bilangan prima atau tidak... fungsi ini mereturn boolean benar atau salah
bool isPrima(int number) {
int prima = true;
// karena bilangan prima adalah bilangan yang habis dibagi 1 dan bilangan itu sendiri maka dibuat perulangan untuk mengecek tiap angka apakah bisa habis membagi bilangan yang diberikan
if (number <= 0 || number == 1) {
return false;
}
//don't run
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int dat[2][5] = {{1, 2, 3, 4, 5},
{7, 9, 0, 2, 4}};
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
void generateTicket() {
int i;
char random[26]="abcdefghijklmnopqrstuvwxyz";
char tiket[8];
for (i = 0; i < 8; ++i) {
tiket[i] = random[rand() % (sizeof(random) - 1)];