Search - INT 1 - CodeBus

Search - INT 1 - List

[File Format] INT_13_EXT DL : 0: 这文档,是祥细说明了Int 13调用的技术文件.-This document is a note wound calling Int 13 technical papers.
Date : 2026-01-06 Size : 29kb User : 李三零
[File Format] PV DL : 0: 读者写者问题，共享原则如下：1、读/写互斥访问；2、写/写互斥访问；3、允许多个读者同时对文件进行访问。-semaphore rmutex=1,rwmutex=1 int count=0 Cobegin reader: writer:
Date : 2026-01-06 Size : 1kb User : baoyu
[File Format] 2 DL : 0: 1.请编写一个函数void fun(char *tt,int pp[]),统计在tt字符中"a"到"z"26各字母各自出现的次数，并依次放在pp所指的数组中。 2.下列程序定义了n×n的二维数组，并在主函数中赋值。请编写函数fun,函数的功能使求出数组周边元素的平均值并作为函数值返回给主函数中的s。-1. Please write a function void fun (char* tt, int pp []), statistics tt characters " a" to " z" 26 their number of occurrences of each letter, and then click on the pp referred to in the array. 2. The following program defines the two-dimensional array of n × n, and in the main function assignment. Please write the function fun, function, features an array of peripheral elements to calculate the average value as the function to return to the main function of s.
Date : 2026-01-06 Size : 1kb User : 荆玲玲
[File Format] A_barycenter_based_fast_thinning_algorithm DL : 0: 分析快速细化算法和 OPTA 细化算法不足产生的内在原因 ,提出一种新的基于重心的快速细化算法.该算法根据被细化图像的特点 ,用密度重心快速将纹线细化到 3 个像素宽度内 ,计算 4 邻域拓扑实现彻底细化.仿真结果表明 ,在细化效率方面 ,该算法一次遍历删除超过一半的大量冗余像素 ,是快速细化算法的 3～7 倍在细化要求方面 ,该算法可达到绝对单像素、光滑无毛刺 ,并能保持端点不被吞噬 ,能够很好地满足图像细化的要求. -The int rinsic origin of deficiencies in both t he fast t hinning algorit hm ( F TA) and one2pass t hinning algorithm (OPTA) was analyzed , and a barycenter based fast t hinning algorit hm was presented. According to t he image’ s feat ure to be fined , the veins of t he image were fined to be of t hree pixel in widt h by using density barycenter and t hen t he 42neighborhood topology was comp uted to make complete t hinning. Simulation result showed t hat , in connection wit h t he t hinning efficiency , t he proposed algo2 rit hm exhibited so perfect ly that a great amount (more t han a half ) of redundant pixel s was eliminated af2 ter single overall checking , being 3 to 7 times faster t han t hat wit h fast t hinning algorit hm. As to t he re2 quirement of t hinning , this algorithm could implement absolute single2pixel t hinning wit hout blurred edges and keep the ends un2swallowed , so that t he requirement of image t hinning was well met .
Date : 2026-01-06 Size : 531kb User : xiaofang
[File Format] pop3 DL : 0: 收邮件的协议有两种，一种是POP3，另外一种较为高级的协议是IMAP4，有的邮箱使用的是POP3协议，比如网易163免费邮箱、新浪免费邮箱、搜狐免费邮箱，有的邮箱使用的是IMAP4协议，比如Gmail免费邮箱，有的两种都可以，比如QQ邮箱。这些免费邮箱都需要做一些设置（例如选择开启 POP3）才能开启从客户端（比如自己做的接收邮件的程序）接收邮件的功能-private Pop3ConnectionState Connect(string host, int port, SslHandShake sslHandShake, bool ssl) { OnConnecting() this._host = host this._port = port this._ssl = ssl this._tcpClient = this.GetTcpClient(host, port) if (this._tcpClient == null) { return Pop3ConnectionState.DISCONNECTED } this._stream = _tcpClient.GetStream() if (ssl) { //do ssl handshake if (sslHandShake == null) sslHandShake = new SslHandShake(host) DoSslHandShake(sslHandShake) if (_sslStream == null || _sslStream.IsAuthenticated == false) { this._connectionState = Pop3ConnectionState.DISCONNECTED this._tcpClient = null return this._connectionState } this._st
Date : 2026-01-06 Size : 532kb User : jianfeng
[File Format] list.c DL : 0: C++ #include <fstream>y using std::ifstream int main() { char line[81] char fname[81] cout << "Enter file name: " cin >> fname -c plus
Date : 2026-01-06 Size : 2kb User : yuanyi
[File Format] c-sj-qw DL : 0: 拓展部分的代码 #include "graphics.h" int main() { int gdriver, gmode gdriver=VGA -To expand part of the code# include " graphics.h int main () {int gdriver gmode gdriver = VGA
Date : 2026-01-06 Size : 349kb User : miao
[File Format] bar DL : 0: 函数名: bar 功能: 画一个二维条形图用法: void far bar(int left, int top, int right, int bottom) -Function name: bar function: draw a two-dimensional bar usage: void far bar (int left, int top, int right, int bottom)
Date : 2026-01-06 Size : 3kb User : 耿玲
[File Format] bar3d DL : 0: 函数名: bar3d 功能: 画一个三维条形图用法: void far bar3d(int left, int top, int right, int bottom, int depth, int topflag)-Function name: bar3d function: draw a three-dimensional bar graph usage: void far bar3d (int left, int top, int right, int bottom, int depth, int topflag)
Date : 2026-01-06 Size : 3kb User : 耿玲
[File Format] bdos DL : 0: 函数名: bdosptr 功能: DOS系统调用用法: int bdosptr(int dosfun, void *argument, unsigned dosal) -Function name: bdosptr Function: DOS system call usage: int bdosptr (int dosfun, void* argument, unsigned dosal)
Date : 2026-01-06 Size : 3kb User : 耿玲
[File Format] AD7880 DL : 0: 基于stm32f103的ad7880采集程序-#include"sys.h" #define CS_AD1 PDout(15) #define CONVST_AD1 PDout(14) #define RD_AD1 PDout(13) #define BUSY_AD1 PDin(12) #define CS_AD2 PGout(15) #define CONVST_AD2 PGout(14) #define RD_AD2 PGout(13) #define BUSY_AD2 PGin(12) void IO_init_AD(void) int Read_dat_AD1(void) int Convert_AD1(void) int Read_dat_AD2(void) int Convert_AD2(void)
Date : 2026-01-06 Size : 1kb User : zyang
[File Format] Bai-Tap-Chuyen-Tin DL : 0: Bai 2.18cin>>n int scs=SoChuSo(n) for(int i=n-9*scs i<=n i++) { if(KiemTra(i)) { cout<<i return 0 } } cout<<0
Date : 2026-01-06 Size : 4kb User : Le Dai
[File Format] A-simple-procedure DL : 0: #include<stdio.h> int main() { printf(“this is a c program.\n”) return 0 }-A simple procedure
Date : 2026-01-06 Size : 2kb User : lunhua
[File Format] CCC DL : 0: 题目：#if #ifdef和#ifndef的综合应用。 1. 程序分析： 2.程序源代码：复制代码代码如下: #include stdio.h #include conio.h #define MAX #define MAXIMUM(x,y) (x>y)?x:y #define MINIMUM(x,y) (x>y)?y:x void main() { int a=10,b=20 #ifdef MAX printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #else printf( \40: The lower one is d\n ,MINIMUM(a,b)) #endif #ifndef MIN printf( \40: The lower one is d\n ,MINIMUM(a,b)) #else printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #endif #undef MAX #ifdef MAX printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #else printf( \40: The lower one is d\n ,MINIMUM(a,b)) #endif #define MIN #ifndef MIN printf( \40: The lower one is d\n ,MINIMUM(a,b)) #else printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #endif getch() }-Title: Integrated application#if#ifdef and#ifndef of. 1. Program analysis: 2. Source Code: Copy the code code is as follows: #include stdio.h #include conio.h #define MAX ?#define MAXIMUM (x, y) (x> y) x: y ?#define MINIMUM (x, y) (x> y) y: x void main () { int a = 10, b = 20 #ifdef MAX printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #else printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #endif #ifndef MIN printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #else printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #endif #undef MAX #ifdef MAX printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #else printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #endif #define MIN #ifndef MIN printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #else printf ( \ 40: The larger one is d \ n
Date : 2026-01-06 Size : 3kb User : 张欣欣
[File Format] HUDDSNUN DL : 0: 题目：#if #ifdef和#ifndef的综合应用。程序源代码： #include stdio.h #include conio.h #define MAX #define MAXIMUM(x,y) (x>y)?x:y #define MINIMUM(x,y) (x>y)?y:x void main() { int a=10,b=20 #ifdef MAX printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #else printf( \40: The lower one is d\n ,MINIMUM(a,b)) #endif #ifndef MIN printf( \40: The lower one is d\n ,MINIMUM(a,b)) #else printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #endif #undef MAX #ifdef MAX printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #else printf( \40: The lower one is d\n ,MINIMUM(a,b)) #endif #define MIN #ifndef MIN printf( \40: The lower one is d\n ,MINIMUM(a,b)) #else printf( \40: The larger one is d\n ,MAXIMUM(a,b)) #endif getch() }-Title: Integrated application#if#ifdef and#ifndef of. Source Code: #include stdio.h #include conio.h #define MAX ?#define MAXIMUM (x, y) (x> y) x: y ?#define MINIMUM (x, y) (x> y) y: x void main () { int a = 10, b = 20 #ifdef MAX printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #else printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #endif #ifndef MIN printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #else printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #endif #undef MAX #ifdef MAX printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #else printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #endif #define MIN #ifndef MIN printf ( \ 40: The lower one is d \ n , MINIMUM (a, b)) #else printf ( \ 40: The larger one is d \ n , MAXIMUM (a, b)) #endif getch () }
Date : 2026-01-06 Size : 3kb User : 张欣欣