-->
当前位置:首页 > Luz 第2949页
Luz

Luz 管理员

暂无介绍

89860 篇文章 33 次评论

PROGRAMMING:The Scarlet Witch lifted the seal

Luz5年前 (2021-05-10)491
The Scarlet Witch has two abilities, one is chaos magic, the other is the ability to modify probability. The mixed use o…

PROGRAMMING:C programming experiment 4-4 recursive method to find the greatest common divisor

Luz5年前 (2021-05-10)524
The greatest common divisor (GCD) of two positive integers is the largest integer that can divide the two integers. Plea…

PROGRAMMING:C programming experiment 4-3 Euclidean algorithm for the greatest common divisor

Luz5年前 (2021-05-10)465
The greatest common divisor (GCD) of two positive integers is the largest integer that can divide the two integers. Plea…

PROGRAMMING:C programming experiment 4-2 finding the greatest common divisor by exhaustive method

Luz5年前 (2021-05-10)404
The greatest common divisor (GCD) of two positive integers is the largest integer that can divide the two integers. Plea…

PROGRAMMING:C programming experiment 4-5 prime search task 2

Luz5年前 (2021-05-10)411
Prime numbers are positive integers that cannot be divisible by integers other than 1 and itself. According to this defi…

PROGRAMMING:C programming experiment 4-6 prime search task 3

Luz5年前 (2021-05-10)452
Input a number n arbitrarily from the keyboard, program to calculate and output the sum of all prime numbers from 1 to n…

PROGRAMMING:C programming experiment 4-7 prime search task 4

Luz5年前 (2021-05-10)425
Input an integer m arbitrarily from the keyboard, if M is not a prime, then calculate and output all its factors (exclud…

PROGRAMMING:Calculate the score

Luz5年前 (2021-05-10)391
In some competitions, there are several judges scoring the contestants. The scoring rule is to remove the highest score…

PROGRAMMING:Non recursive statistics of the number of right child nodes in binary tree

Luz5年前 (2021-05-10)394
This problem requires the use of non recursive way to count the number of right child nodes in the binary tree.###Input…

PROGRAMMING:Huffman coding

Luz5年前 (2021-05-10)391
This problem requires the Huffman coding of characters. Pay attention to the Huffman tree established in strict accordan…