Recent projects

buck sort 5~4-7-26a

C · an anonymous user
22 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> #define TESTSTR " Now

buck sort 5~4-7-26a

C · an anonymous user
22 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> #define TESTSTR " Now

buck sort 5~4-7-26a

C · an anonymous user
22 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> #define TESTSTR " Now

buck sort 5~4-7-26a

C · an anonymous user
22 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> #define TESTSTR " Now

pr

MySQL · an anonymous user
22 hours ago
create database pr; use pr; CREATE TABLE pr( Id INT UNIQUE, Name varchar(50) NOT NULL, Email varchar(50) UNIQUE, Department varchar(45) NOT NULL );

M1

Octave · an anonymous user
22 hours ago
R=11; lambda=input('enter arrival rate'); mu=1/(75-R); if lambda>=mu disp('the system is unstable'); else rho=lambda/mu; Ls=lambda/(mu-lambda); Lq=lambda^2/(mu*(mu-lambda)); Wq=lambda/(mu*(mu-lambda));

buck sort 5~4-7-26a

C · an anonymous user
22 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> // //-----------------

Valid Parentesis

NodeJS · chandan1826
22 hours ago
const str = '({[]})['; const pairs = { ')' : '(', '}' : '{', ']' : '[' } function isValid(str){ const stack =[];

Pr

C · an anonymous user
22 hours ago
#include <stdio.h> int main() { printf("Hello world!\n"); return 0; }

M1

Octave · an anonymous user
22 hours ago
lambda=input('enter arrival rate'); mu=1/36; if lambda>=mu disp('the system is unstable'); else rho=lambda/mu; Ls=lambda/(mu-lambda); Lq=lambda^2/(mu*(mu-lambda)); Wq=lambda/(mu*(mu-lambda)); Ws=1/(mu-lambda);

buck sort 5~4-7-26a

C · an anonymous user
22 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> // void labelformat(in

3

Python · an anonymous user
22 hours ago
a= 16 if a<=50 : b=15 else : b= 10 print(b,"centimes l'unité")

M1

Octave · an anonymous user
22 hours ago
lambda=input('enter arrival rate'); mu=40; if lambda>=mu disp('the system is unstable'); else rho=lambda/mu; Ls=lambda/(mu-lambda); Lq=lambda^2/(mu*(mu-lambda)); Wq=lambda/(mu*(mu-lambda)); Ws=1/(mu-lambda);

Fur Hub

Lua · an anonymous user
23 hours ago
local Rayfield = loadstring(game:HttpGet('https://sirius.menu/rayfield'))() local Window = Rayfield:CreateWindow({ Name = "Furina - Hub", Icon = 0, -- Icon in Topbar. Can use Lucide Icons (string) or Roblox Image (number). 0 to use no icon (

소수 판별 알고리즘

Python · an anonymous user
23 hours ago
while True: num = int(input("정수(>=2)를 입력하세요:")) if num <= 0: print("프로그램을 종료합니다.") break if 0 < num < 2: print("잘못 입력하였습니다.") else:

buck sort 5~4-7-26a

C · an anonymous user
23 hours ago
//========================================= //buck sort 5~4-7-26a 1v tested works //========================================= //---------------------------------------- #include <stdio.h> #include <string.h> #include <ctype.h> //--------------------

second greatest element in array

C++ · anmoll
23 hours ago
#include <bits/stdc++.h> using namespace std; int main () { int arr[] = {7, 2, 8, 5, 8, 2, 1, 3, 5}; int n = 9; int greatest = -100; int secondgreatest = -100;

LCG 공식을 이용한 난수 출력기

C · Amond
23 hours ago
#include <stdio.h> #include <time.h> // 1. g_seed 변수를 전역 변수로 선언합니다. unsigned long long g_seed = 0; unsigned int myrand() { // LCG 공식: X_{n+1} = (A * X_n + C) % M g_seed = (g_seed * 6364136223846793005ULL + 1442695040888963407ULL); ret

LCG 공식을 이용한 난수 출력기

C · an anonymous user
23 hours ago
#include <stdio.h> #include <time.h> // 1. g_seed 변수를 전역 변수로 선언합니다. unsigned long long g_seed = 0; unsigned int myrand() { // LCG 공식: X_{n+1} = (A * X_n + C) % M g_seed = (g_seed * 6364136223846793005ULL + 1442695040888963407ULL); ret

Binario

Python · an anonymous user
23 hours ago
print('Hello world!') import numpy as np from scipy.io import wavfile # Configuración frecuencia_1 = 880 # Hz para el bit 1 frecuencia_0 = 440 # Hz para el bit 0 duracion_bit = 0.2 # segundos por cada bit sample_rate = 44100 # Hz