代码搜索:printf

找到约 10,000 项符合「printf」的源代码

代码结果 10,000
www.eeworm.com/read/339269/6353234

cpp branch.cpp

#include #include double a[10][10]; void Guass(int n){ int i,j,k; double t; for(k=0;k
www.eeworm.com/read/187296/6354518

c varcheck.c

# include "stdio.h" void Swap(int *a,int *b) /*交换a,b*/ { *a=*a^*b; *b=*b^*a; *a=*a^*b; } void main(void) { int i=1,j=2; printf("i=%d,j=%d\n",i,j); Swap(&i,&j); printf(
www.eeworm.com/read/193359/6355412

txt 7-12.txt

/* 范例:7-12 */ #include int main() { /* 数组与指针 */ char sa[] = "this is a book"; char *ptr = "this is a book"; /* 结果输出至屏幕 */ printf("这是sa数组字符串 -->%s",sa); printf("\n这是ptr指针
www.eeworm.com/read/451253/6367681

c main.c

/* Calculate or Check MD5 Signature of File or Command Line Argument by John Walker http://www.fourmilab.ch/ This program is in the public domain. */ #define VERSION "2.2
www.eeworm.com/read/494733/6374569

txt 1.txt

【程序1】 题目:有1、2、3、4个数字,能组成多少个互不相同且无重复数字的三位数?都是多少? 1.程序分析:可填在百位、十位、个位的数字都是1、2、3、4。组成所有的排列后再去掉不满足条件的排列。 2.程序源代码: main() { int i,j,k; printf("\n"); for(i=1;i
www.eeworm.com/read/494757/6374832

cpp 杭电1003.cpp

/*算法:1.一直相加直到和出现负数,在相加期间能得到一个最大和,记录 2.重复1步骤,更新最大和,直到输入完毕 原理:如果在连续子串 中Sn0时任意的 (i>1) 的和都小于0, 所以这些元素就
www.eeworm.com/read/494777/6375011

cpp transport.cpp

#include #include #define NMAX 10 double C[NMAX][NMAX], XM[NMAX][NMAX]; double R[NMAX][NMAX]; double DAO[NMAX], RAD[NMAX]; int P[5][2*NMAX+5];
www.eeworm.com/read/494289/6381502

c williams.c

/* * Program to factor big numbers using Williams (p+1) method. * Works when for some prime divisor p of n, p+1 has only * small factors. * See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/494289/6381518

c pollard.c

/* * Program to factor big numbers using Pollards (p-1) method. * Works when for some prime divisor p of n, p-1 has itself * only small factors. * See "Speeding the Pollard and Elliptic Cu
www.eeworm.com/read/494289/6381533

c hilbert.c

/* * Solve set of linear equations involving * a Hilbert matrix * i.e. solves Hx=b, where b is the vector [1,1,1....1] * * Copyright (c) 1988-1997 Shamus Software Ltd. */ #include