vbchartprice

一个利用bcb的dll写的vc翻译软件 翻译引擎本身简单， 技巧在于利用vc调用bc(Bcb of a use vc dll written translation software translation engine itself is simple trick is to use vc calling bc)

基于VB的选择家用电脑程序（笔记本或者台式机），语言注释为法语。(Un pogramme pour choisir un ordinateur chez vous.)

VB源码:ASCII码转换器源代码，任意字符的ASCII码转换工具，基于VB6的源代码，可以把任意字符（数字、字母、汉字）转化成ascii码，也可以把ascii码还原成最初的字符。(VB source code: ASCII code converter source code of any character ASCII code conversion tools, based on VB6 source code, you can put any characters (numbers, letters, Chinese characters) into ascii code ascii code can also restore the original character .)

MyICQ是一套公开源代码的即时通讯软件，包括服务器端和客户端，可以用于互联网或局域网中。可以运行在Windows或Linux(KDE/Qt)操作系统上，这是Windows版。目前客户端程序的界面完全模仿腾讯的QQ(如果Tencent告我的话，我会马上改的:-)。 总之，如果你崇尚自由，对QQ的越来越多的广告骚扰感到深恶痛绝的话，MyICQ绝对是你很好的选择。(MyICQ is an open source instant messaging software, including server and client, can be used for Internet or LAN. Can run on Windows or Linux (KDE/Qt) operating system, which is Windows. Current client interface is a mimic of Tencent QQ (Tencent sue me if, I will immediately reform :-). In short, if you advocate freedom, QQ, more and more ads are hated, then harassment, MyICQ is definitely a good choice.)

说明：  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.)

设p是素数，a是p的本原根，即a1,a2,a3,…,ap-1在mod p下产生1到p-1的所有值，所以对任何b属于{1,…,p-1},有唯一的i属于{1,…,p-1}使得ai mod p 等于p。称i为模p下以a为底b的离散对数。(P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so for any b belongs to (1, ..., p-1), there are only i belong to (1, ..., p-1) makes ai mod p equivalent to p. Said i was under the modulus p to a for b at the end of the discrete logarithm.)

一些可能用的到的图标资源(some might use the resources of the icon)

说明：  Sample Code for encryption and decription

说明：  音频设备控制之扬声器单个应用程序音量控制，包括音量的获取与设置(Audio Device Controlled Speaker Single Application Volume Control, Including Volume Acquisition and Setting)

Artificial Intelligence For Game Developers