该程序使用朴素高斯消去算法来求解线性方程组。我决定通过编写这个程序来测试我的python编程技能，因为我在数字方法（Numerical Methods）课程中学习了这个主题，这是我大三时作为计算机工程专业的学生学习的一门课程
This program uses the Naive Gaussian Elimination algorithm to solve a system of linear equations. I decided to test my python programming skill by writing this program as i learnt the topic in Numerical Methods, a course I took as a computer engineering student in junior year (2024-05-03, Python, 0KB, 下载0次)
这是来自不同在线平台的各种算法和编程问题的解决方案的集合。该存储库作为一个组合，展示了跨一系列主题（包括算法、数据结构、数学等）的问题解决技能和技术。
This is a collection of solutions to various algorithmic and programming problems sourced from different online platforms. This repository serves as a portfolio showcasing problem-solving skills and techniques across a range of topics including algorithms, data structures, mathematics, and more. (2024-03-23, Python, 0KB, 下载0次)
开发了一个Python迷你项目，实现了“猜数字”游戏。利用用户输入和输出、随机数生成和条件语句来创建交互式游戏体验。实现了错误处理和循环结构，以确保流畅的游戏。展示解决问题的技能和Python编程的熟练程度。
Developed a Python mini-project implementing a "Guess the Number" game. Utilized user input and output, random number generation, and conditional statements to create an interactive game experience. Implemented error handling and looped structure to ensure smooth gameplay. Demonstrated problem-solving skills and proficiency in Python programming. (2024-03-12, Python, 0KB, 下载0次)
Python基本计算器通过用户友好的界面执行基本的算术运算，包括加法、减法、乘法和除法。它有效地处理错误，确保平稳操作，并作为在命令行环境中学习编程和解决数学问题的可靠工具。
The Python basic calculator performs essential arithmetic operations with a user-friendly interface, including addition, subtraction, multiplication, and division. It handles errors effectively, ensuring smooth operation, and serves as a reliable tool for learning programming and solving math problems in a command-line environment. (2024-02-25, Python, 0KB, 下载0次)
证券定价公式；该存储库旨在为模型和交易算法提供代码。复制粘贴所需的安全性并与CSV链接。债券定价算法在金融界流行的三种不同的编程语言中完成相同的任务。（Python、R和C++）。
Securities pricing formulas; this repository is intended to provide code for the models and trading algos. Copy Paste your desired security and link with CSV. Bond Pricing algorithms accomplish the same task in three separate programming languages popular in Finance. (Python, R and C++). (2024-02-10, Python, 0KB, 下载0次)
算法交易是金融行业中的一个领域，涉及使用计算机程序和数学模型来执行交易策略。它需要深入了解金融市场、数据分析、统计建模和编程专业知识。
Algorithmic trading is a domain within the finance industry that involves the use of computer programs and mathematical models to execute trading strategies. It requires a deep understanding of financial markets, data analysis, statistical modeling, and programming expertise. (2024-02-04, Python, 0KB, 下载0次)
创建web抓取代码的基本参数和要求是：（以英语输入的编程问题的自然语言描述进行通信，以AI代码生成解决方案作为输出的代码进行通信，指定Python 3.11版本，使用Pycharm编译器，并安装以下Python.库。
The basic parameters and requirements for creating codes for web scraping are: (communicating in natural language description of a programming problem as input in English and code with the AI code generating solution as output, specifying the Python 3.11 version, using the Pycharm compiler, and installing the following Python libraries. (2024-01-30, Python, 0KB, 下载0次)
python编程项目涉及实现和改进代理的值迭代和Q学习算法，通过Gridworld模拟了解马尔可夫决策过程，以及增强学习算法以使用基于特征的学习来处理更大的状态空间。
A python programming project involves implementing and refining value iteration and Q-learning algorithms for agents, understanding Markov decision processes through Gridworld simulations, and enhancing learning algorithms to handle larger state spaces with feature-based learning. (2024-01-07, Python, 0KB, 下载0次)
Liniarote包是Liniarote编程语言的命令行界面，用于执行转换数学中的操作（即，在该接口中，允许除以零，并生成可预测的结果，在转换数字符号“”的帮助下显示）。
The Liniarote package is a command-line interface for the Liniarote programming language, for use in performing operations in transvalent mathematics (i.e., in which division by zero is permitted and generates predictable results, displayed with the aid of the transvalent number symbol “ ”). (2023-01-20, Python, 0KB, 下载0次)
该存储库包含算法。您可以通过在任何编程语言中添加独特的算法来对此回购做出贡献。这些天记录的原因是为了让其他人可以从中获得一些东西，也希望增强资源。目标是花100天，每天2小时，处理超过20个DSA领域的基础知识...
This repository contains algorithms. You can contribute to this repo by adding unique algorithms in any programming language. The reason for documenting these days is so that others can take something from it and also hopefully enhance the resources. The goal is to take 100 days, 2 hour a day, to tackle over 20 areas of DSA to a foundational (2022-10-02, Python, 0KB, 下载0次)
该存储库是为计算机理论主题创建的。本课题的建议是提高您的技能，以不同的方式解决0-1背包问题。使用的技术是动态编程和两种元启发式（GRASP和TABU搜索）。
This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search). (2020-07-03, Python, 0KB, 下载0次)
CodeChef是一个由来自全球各地的程序员组成的具有竞争力的编程社区。该存储库为世界提供了CodeChef解决方案。请随意使用此存储库来解决CodeChef问题，并将您的解决方案贡献给我们的存储库。
CodeChef is a competitive programming community of programmers from across the globe. This repository gave CodeChef solutions to the world. Feel free to use this repository for solving the CodeChef problems as well as Contribute your solutions to our repository. (2022-03-01, Python, 0KB, 下载0次)
This program is programmed using Python and can be used to solve linear equations with two methods: Gaussian Elimination and Improved Column Principal Gaussian Elimination. /本程序使用Python编程，可以使用两种方法（高斯消去法和改进后的列主元高斯消去法）来解决线性方程组。这两种方法的主要操作相似，区别在于改进后的方法每次在第k行消元时会将具有第k列最大元素的行与第k行交换，然后再进行消元。
This program is programmed using Python and can be used to solve linear equations with two methods: Gaussian Eliminat... (2023-04-17, Python, 4KB, 下载0次)
1、求解线性方程组的两种迭代法的求解思想：Jacobi迭代法和Gauss-Seidel迭代法。
2、迭代法收敛的条件，并会判断Jacobi迭代法和Gauss-Seidel迭代法的收敛性。
3、编程实现Jacobi迭代法和Gauss-Seidel迭代法，终止迭代的技术（预给的迭代次数）与发散性判断的方法。通过初始解X，松弛因子的选取，对计算结果的影响。
1. Two iterative methods for solving linear equations: Jacobi iterative method and Gauss Seidel iterative method.
2. The convergence condition of iterative method, and the convergence of Jacobi iterative method and Gauss Seidel iterative method will be judged.
3. The Jacobi iterative method and Gauss Seidel iterative method are realized by programming. The technique of terminating iteration (the number of iterations given in advance) and the method of judging divergence are also realized. Through the selection of the initial solution X and the relaxation factor, the influence on the calculation results is discussed. (2020-03-05, Python, 2KB, 下载0次)
给定大素数P，如果求其原根？给出算法描述。并编程实现具体功能。
利用随机数生成大素数q，P是形如2*q+1的大素数，P也为素数，若P不为素数，则重新生成大素数q，重复上述步骤。生成随机数g，1<g<p-1，要满足：g^2 mod p!=1, g^q mod p!=1, 则g为P的本原根。
Given a large prime number P, if you find its original roots? Algorithm description is given. And specific programming functions.
Use of random number generation of large prime numbers q, P is of the form 2* q 1 large prime number, P is a prime number, if P is not prime, then regenerate the
NCKU prime q, repeat the above steps. Generate random numbers g, 1 <g <p-1, to meet: g ^ 2 mod p! = 1, g ^ q mod p! = 1, then
P g is the primitive root. (2011-12-24, Python, 1KB, 下载40次)