Search - v c - CodeBus

Search - v c - List

[Documents] C键盘画图 DL : 0: 用C语言实现键盘画图，"Ｖ”：画笔提起 "Ｗ”：开始画图 "Ｒ”：开始擦图 "Ｓ”：当前图形存入文件 "Ｅ”：调出已有文件 "Ｃ”：画圆-C language keyboard drawing, the "V" : brush name "W" : start drawing "R" : start rubbing map "S" : The current graphics into documents "E" : the redeployment of existing files "C" : Circle
Date : 2025-12-30 Size : 2kb User : 宋瑞轩
[Documents] mathformulae DL : 0: 第一章有关数论的算法 1.1最大公约数与最小公倍数 1.2有关素数的算法 1.3方程ax+by=c的整数解及应用 1.4 求a^b mod n 第二章高精度计算 2.1高精度加法 2.2高精度减法 2.3高精度乘法 2.4 高精度除法练习第三章排列与组合 3.1加法原理与乘法原理练习 3. 2 排列与组合的概念与计算公式练习 3.3排列与组合的产生算法练习第四章计算几何 4.1 基础知识 4.2 线段的相交判断 4.3寻找凸包算法练习第五章其它数学知识及算法 5.1 鸽巢原理 5.2 容斥原理及应用 5.3 常见递推关系及应用-The first chapter on number theory and the algorithm 1.1 common denominator least common multiple of 1.2 on the prime number algorithm 1.3 equation ax+ By = c of the integer solution and application of 1.4 for a ^ b mod n chapter 2.1 high-precision calculation of high-precision adder 2.2 Accuracy of high-precision subtraction 2.3 Multiplication 2.4 Practice Chapter III of high-precision division and combination with adder 3.1 Principle and Practice Multiplication Principle 3.2 and the combination with the concept and formula for calculating practice with the combination of 3.3 with the selection of algorithms to practice in chapter IV 4.1 based on computational geometry 4.2 knowledge of the intersection of line segments to determine the convex hull algorithm to find 4.3 Exercises Chapter V other mathematical knowledge and algorithms 5.1 pigeonhole principle 5.2 Exclusion Principle and Application of 5.3 Recursion relations and the application of common
Date : 2025-12-30 Size : 38kb User : endure
[Documents] MOP_ACA DL : 0: 针对多目标优化问题，提出一种用于求解多目标优化问题的蚁群算法。-Ai m i n g a t mu l t i — o b j e c t i v e o p t i m iz a t i o n p r o b l e m， t h i s p a p e r p r o p o s e s a n An t C o l o n y A l g o r i t h m( AC A)f o r s o l v i n g Mu l t i — o b j e c t i v e Op t i mi z a t i o n P r o b l e m( MOP ACA) ．
Date : 2025-12-30 Size : 221kb User : 薛大伟
[Documents] ATtiny2313(V)_cn DL : 0: attiny2313中文技术文档，很详细，很全面，带有所有功能的汇编和C程序代码，方便编程查阅-attiny2313 Chinese technical documentation, very detailed, very comprehensive, with all the features of the assembly and C code for easy programming access to ... ...
Date : 2025-12-30 Size : 1.67mb User : ddg
[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-30 Size : 59kb User : 唐钊
[Documents] One_Digital_Signature_Scheme_in_Semimodule_over_Se DL : 0: 一个数字签名方案假设C试图提供给B一个通过A的有效签名S伪造的消息TF，如果这种情况发证了，另一方面A可以拒绝在相同情况下认证他的签名。然后就导致了如果一个有效的签名S=(σ,sζ)和一个伪造的消息TF可以被认证。哈希值mF=H(TF)必须满足下列形式的V条件但是根据⊕OSP通过方程m1= 寻找m1是不可行的，因为⊕OSP是困难的。而且在m1中寻找mF也是困难的，因为C必须依次解决三个困难的*OSP问题。就算mF被找到了，也不可能构造一个合适的伪装TF使得，这是由于我们假设哈希函数是加密安全的。于是我们证明了伪造消息不能以一个有效的签名签署，因此签名具有不可抵赖性。 -A digital signature scheme
Date : 2025-12-30 Size : 60kb User : 王智圆
[Documents] sprb DL : 0: x c v b m k h df sa awr yu u uu u er r fdr edtg re tre tr te rt- x c v b m k h df sa awr yu u uu u er r fdr edtg re tre tr te rt
Date : 2025-12-30 Size : 77kb User : avinash
[Documents] Infrared-obstacle-avoidance.tar DL : 0: 小车避障的c51程序，v-c++编写，简单可用。-C51 car obstacle avoidance procedures, v-c++ write simple available.
Date : 2025-12-30 Size : 6kb User : 木木
[Documents] Huffman DL : 0: 根据赫夫曼编码的原理，编写一个程序建立英文字母的赫夫曼编码。下面是英文字母使用频率表（）： A 8.19 B 1.47 C 3.83 D 3.91 E 12.25 F 2.26 G 1.71 H 4.57 I 7.10 J 0.14 K 0.41 L 3.77 M 3.34 N 7.06 O 7.26 P 2.89 Q 0.09 R 6.85 S 6.36 T 9.41 U 2.58 V 1.09 W 1.59 X 0.21 Y 1.58 Z 0.08 -According to Huffman coding theory, write a program to establish the letters of Huffman coding. Here is the English alphabet using frequency table ( )
Date : 2025-12-30 Size : 2kb User : lipei
[Documents] 雷达中的微多普勒效应 DL : 0: 雷达中的微多普勒效应，作者V.C.Chen(micro doppler effect in radar by V.C.Chen)
Date : 2025-12-30 Size : 41.47mb User : 11111110