#include#includeusing namespace std;ifstream fin("input.txt");ofstream fout("out.txt");string chengfa(string s1,string s2);string xjiafa(string s1,string s2);string clear(string s);void main(){ int ii

服务顺序Time Limit:1000MS  Memory Limit:65536KTotal Submit:142 Accepted:27 Description 若干个顾客同时等待一项服务。顾客i需要的服务时间为ti。你的任务是安排n个顾客的服务次序使总的等待时间最小。总的等待时间是指每个顾客等待服务的时间的总和。Input 从文本文件读入数据。该文件有若干测试数据，每组测试数据有两行，其第一

3X+1 ProblemTime Limit:1000MS  Memory Limit:65536KTotal Submit:9 Accepted:5 Description Background Problems in Computer Science are often classified as belonging to a certain class of problems (e.g.,

阶乘问题Time Limit:1000MS  Memory Limit:65536KTotal Submit:16 Accepted:9 Description 从输入文件中读取一个数n，求出n！中末尾0的个数。Input 输入有若干行。每一行上有一个整数m，指明接下来的数字的个数。然后是m行，每一行包含一个确定的正整数n，1£n£1000000000。Output 对输入行中的每一个数据n，输出

颠倒原文Time Limit:1000MS  Memory Limit:65536KTotal Submit:25 Accepted:7 Description In most languages, text is written from left to right. However, there are other languages where text is read and writte

Guessing GameTime Limit:1000MS  Memory Limit:65536KTotal Submit:13 Accepted:4 Description Stan and Ollie are playing a guessing game. Stan thinks of a number between 1 and 10 and Ollie guesses what th

A+B ProblemTime Limit:1000MS Memory Limit:65536KTotal Submit:62 Accepted:12 Description Calculate the sum of the two numbers.Input Please read input data from Stand Input. Each line of input contains

Simple Base ConversionTime Limit:1000MS  Memory Limit:65536KTotal Submit:35 Accepted:10 Description In this problem you are asked to write a simple base conversion program. You will be given a hexadec

6+9=15 seems okay. But how come 4+6=2? You see, Mofiz had worked hard throughout his digital logic course, but when he was asked to implement a 32 bit adder for the laboratory exam, he did some mistak

#include#includeusing namespace std;ifstream fin("input.txt");ofstream fout("out.txt");string xjianfa(string s1,string s2);string xjiafa(string s1,string s2);string jianfa(string s1,string s2);int max

寻找凸包　　点集Q的凸包ch(Q)是一个最小的凸多边形P，它满足Q中的每个点或者在P的边界上，或者在P的内部。现对于给定的点集Q，求Q的凸包ch(Q)的顶点集合。输入：　　输入有若干组测试数据。每一组测试数据的第一行上有整数n，表示该组测试数据有n个点组成的。接下来有n行，其每一行上有二个正整数，之间用一个或几个空格隔开。当输入行上只有一个数0时，表示输入结束。输出：　　对第i组测试数据，先输出"

 在Windows操作系统上，我们最常见的浏览器有两种：文件浏览器（exploer.exe，应用于文件系统）和Internet浏览器（iexplore.exe，应用于互联网资源）。由于这两个浏览器功能强大，而且又与Windows操作系统捆绑销售，最终也就成为了浏览器的标准。但有时候，为了给浏览器加入一些新的特性，我们往往会重新设计一个自己的浏览器。新的浏览器模仿标准浏览器的大部分功能，同时加入新特