Search - printf.c

Search - printf.c - List

[Documents] 我们如何从VC++开始“编程” DL : 0: 不管学C还是学C++，VC和gcc都可以，甚至，什么其他C语言编译器，也可以啊，Intel的C，以前DOS下的turbo C/C++，Watcom C/C++，都可以，我首先摆句话，C和C++是语言，既然是语言，就与操作系统无关，那些printf，scanf，甚至包括什么对话框，MassageBox，消息循环，都不重要，因为这不是语言特性，初学者，暂时先不必管。
Date : 2010-07-20 Size : 51.5kb User : crayonlinew
[Documents] c语言教程(www.vcok.com版) DL : 2: 经典c程序100例==1--10 【程序1】题目：有1、2、3、4个数字，能组成多少个互不相同且无重复数字的三位数？都是多少？ 1.程序分析：可填在百位、十位、个位的数字都是1、2、3、4。组成所有的排列后再去　　　　　　掉不满足条件的排列。 2.程序源代码： main() { int i,j,k printf("\n") for(i=1 i<5 i++)　　　　／*以下为三重循环*/ 　for(j=1 j<5 j++)　　　for (k=1 k<5 k++) 　　　{ 　　　　if (i!=k&&i!=j&&j!=k) 　　　/*确保i、j、k三位互不相同*/ 　　　　printf("%d,%d,%d\n",i,j,k) 　　　}-classic procedures hundred cases == 1-- 10 procedures-- a topic : 1,2,3,4 figures, the number can be formed with each other with no repeat of the triple-digit figures? How many are? 1. Program Analysis : can fill the 100, 10, 000 the number of spaces are 1,2,3,4. With all the components removed after not satisfied with the conditions. 2. Source code : main () (int i, j, k printf ( "\ n") for (i = 1 ilt; 5 i)/* the following as the triple cycle*/for (j = 1 JLT; 5 j) for (k = 1 KLT; 5 k) (if (i! = ki! = jj! = k)/* i, j, k three disparate*/printf ( "% d,% d,% d \ n ", i, j, k
Date : 2025-12-21 Size : 297kb User : 刘宋
[Documents] 01259361tubianlideyanshi DL : 0: 图的遍历的演示（c 语言数据结构课程设计题） /*定义图*/ typedef struct{ int V[M] int R[M][M] int vexnum }Graph /*创建图*/ void creatgraph(Graph *g,int n) { int i,j,r1,r2 g->vexnum=n /*顶点用i表示*/ for(i=1 i<=n i++) { g->V[i]=i } /*初始化R*/ for(i=1 i<=n i++) for(j=1 j<=n j++) { g->R[i][j]=0 } /*输入R*/ printf("Please input R(0,0 END):\n") scanf("％d,％d",&r1,&r2) while(r1!=0&&r2!=0) { g->R[r1][r2]=1 g->R[r2][r1]=1 scanf("％d,％d",&r1,&r2) } } -graph traversal of the display (c language curriculum design data structures that)/* definition of the map*/typedef s truct V (int int [M] R [M] [M]) int vexnum Graph/* create map*/void creatgraph (Graph* g, int n) (int i, j, r1, r2 g--Graph traversal of the presentation (c language data structure, curriculum design issues) /* definition of map*/typedef struct (int V [M] int R [M] [M] int vexnum) Graph /* create the map*/void creatgraph (Graph* g, int n) (int i, j, r1, r2 g-> vexnum = n /* vertex with i said*/for (i = 1 i < = n i++) (g-> V [i] = i ) /* initialize the R*/for (i = 1 i < = n i++) for (j = 1 j < = n j++) (g-> R [i] [j] = 0) /* input R*/printf (" Please input R (0,0 END): \ n" ) scanf (" d, d" , & r1, & r2) while (r1! = 0 & & r2! = 0) (g-> R [r1] [r2] = 1 g-> R [r2] [r1] = 1 scanf (" d, d" , & r1, & r2)))-graph traversal of the display (c language curriculum design data structures that) /* definition of the map*/typedef s truct V (int int [M] R [M] [M]) int vexnum Graph /* create map*/void creatgraph (Graph* g, int n) (int i, j, r1 , r2 g-
Date : 2025-12-21 Size : 59kb User : 唐钊
[Documents] ger DL : 0: something to show about the use of printf
Date : 2025-12-21 Size : 41kb User : Darwend