binary-octal-hex-transformation

同步两个目录之间的文件，根据更新时间进行差额同步。( 同步两个目录之间的文件，根据更新时间进行差额同步。 Synchronize files between the two directories, according to the update time difference synchronization.)

此源文件问本人参考Jrtplib的example1写的一个集服务器和客户端为一体的源文件，需要用到jrtplib3.7，jthreadlib1.2,调试时，请选择vc++6.0的debug multithread dll选项调试，其中testResult.txt为本人测试结果，源码中解释详尽，希望对大家有用-I asked the source of reference Jrtplib set example1 to write a server and client as one of the source files needed jrtplib3.7, jthreadlib1.2, debugging, select the vc++6.0 options debug multithread dll debugging , of which I testResult.txt for test results, source code explained in detail, in the hope that useful

说明：  给予stm32f103zet6为主控的AD7705驱动程序(Stm32f103zet6 as the main control of the AD7705 driver)

一个基于MFC操作excel表格的应用程序。根据需求生成一张刻度与数据对应的excel表(MFC-based operation excel spreadsheet application. Excel sheet with a scale corresponding to the data generated on demand)

C# 播放器源码 自己写的，实现基本功能的播放器(C# source code to write their own player, to achieve the basic functions of the player)

说明：  铁锈之心多线程铁解包打包自带额外加密，支持对官方格式二次加密！(Rust Heart Multithread Iron Unpackaged Package with Additional Encryption!)

IAP Finite State Machine driver

Use the ShellExecute API function to execute a file, launch the Find utility, and perform default actions

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

Release Notes for IDT77222/252 Windows NDIS5 ATM Device Driver, version 1.3