代码搜索：预置数
找到约 10,000 项符合「预置数」的源代码
代码结果 10,000
www.eeworm.com/read/488823/6486443
cpp mergestone.cpp
#include
#include
using namespace std;
//*stone n堆石子数量的数组
//n 代表石子的堆数
int getMaxScore(int *stone, int n)
{
int **sumij;
int i, j, t;
int maxScore = 0;
sumij =
www.eeworm.com/read/484166/6591827
cpp p3-148.cpp
#include
#include
#include
//main()函数的定义
void main( void )
{
double y;
int N;
//输入一个大于等于0的数
do {
coutN;
www.eeworm.com/read/482837/6614232
cpp p3-148.cpp
#include
#include
#include
//main()函数的定义
void main( void )
{
double y;
int N;
//输入一个大于等于0的数
do {
coutN;
www.eeworm.com/read/481836/6631543
vhd seg.vhd
library IEEE;
use IEEE.STD_LOGIC_1164.ALL;
use IEEE.STD_LOGIC_ARITH.ALL;
use IEEE.STD_LOGIC_UNSIGNED.ALL;
entity seg is
Port (
seg :out std_logic_vector(7 downto 0); --输出到数
www.eeworm.com/read/481249/6646453
c 平方根.c
#define Epsilon 1.0E-6 /*控制解的精度*/
#include
#include
main()
{
float num,pre,this;
do
{
scanf("%f",&num);/*输入要求平方根的数*/
}while(num
www.eeworm.com/read/480611/6666829
cpp 5.2.cpp
/*输入三个数a，b，c，要求按从小到大的顺序输出*/
#include
int main()
{
float a,b,c,t;
scanf("%f%f%f",&a,&b,&c);
if(a>b)
{
t=a;
a=b;
b=t;
}
if(a
www.eeworm.com/read/479650/6689664
cpp p3-148.cpp
#include
#include
#include
//main()函数的定义
void main( void )
{
double y;
int N;
//输入一个大于等于0的数
do {
coutN;
www.eeworm.com/read/477561/6738710
cpp pso.cpp
//库文件
#include"stdio.h"
#include"stdlib.h"
#include"time.h"
#include"math.h"
//随机数定义
#define rdint(i)(rand()%(int)(i))
#define rdft()(float)((double)rdint(16384)/(16383.0))
#define rnd(a,b)(
www.eeworm.com/read/405283/11466981
c 平方根.c
#define Epsilon 1.0E-6 /*控制解的精度*/
#include
#include
main()
{
float num,pre,this;
do
{
scanf("%f",&num);/*输入要求平方根的数*/
}while(num
www.eeworm.com/read/403975/11493225
m gmres.m
%GMres方法
function gmres(n,A,b)
% clear
% clc
% n=1000 %方程阶数
% load('tezhengzhi.mat')
% load('xs.mat')
% B=randn(n);
% % D=diag(1:1:n);
%
% A=B*D*inv(B);
%
% % b=randn(n,1);
% % xs=