摘要：
Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15013Accepted Submission(s): 6525Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16 阅读全文
摘要：
Children's DayTime Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 10Accepted Submission(s) : 5Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionToday is Children's Day. Some children ask you to output a big letter 'N'. & 阅读全文
摘要：
历届试题 错误票据 锦囊1锦囊2锦囊3问题描述某涉密单位下发了某种票据，并要在年终全部收回。每张票据有唯一的ID号。全年所有票据的ID号是连续的，但ID的开始数码是随机选定的。因为工作人员疏忽，在录入ID号的时候发生了一处错误，造成了某个ID断号，另外一个ID重号。你的任务是通过编程，找出断号的ID和重号的ID。假设断号不可能发生在最大和最小号。输入格式要求程序首先输入一个整数N(N#include #include #include int num[10000];using namespace std;int main(int argc, char *argv[]) { int n; str 阅读全文