2017年04月_Bob__Huang

04月 03月 01月

原创紫书第一章训练1 D -Message Decoding

Some message encoding schemes require that an encoded message be sent in two parts. The ﬁrst part, called the header, contains the characters of the message. The second part contains a pattern that rep

2017-04-25 20:04:46 609

原创紫书第一章训练1 A - Ancient Cipher

Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form to

2017-04-24 21:30:32 557

原创 HAU校赛Little Red Riding Hood

Problem A: Little Red Riding Hood Time Limit: 1 Sec Memory Limit: 1280 MB Submit: 817 Solved: 114 [Submit][Status][Web Board] Description Once upon a time, there was a little girl. Her name was

2017-04-23 18:46:23 469

原创省赛D Let's Chat

Let’s ChatTime Limit: 1 Second Memory Limit: 65536 KB ACM (ACMers’ Chatting Messenger) is a famous instant messaging software developed by Marjar Technology Company. To attract more users, Edward,

2017-04-22 21:02:29 534

原创 TOJ4701 求阴影部分面积

设正方形ABCD边长为a，分别以B和D为圆心，绘制半径为a的1/4圆，与正方形的内切圆相交与M、N、O、P点，求这些交点围成的阴影部分面积。Input输入数据有多组，每组输入一个正整数a(a<=20)，表示正方形的边长，输入以EOF结束。Output每组输出一个小数，表示阴影部分的面积，保留为2位小数Sample InputSample OutputHint 圆周率PI取acos(-1.0)

2017-04-14 20:41:16 1352

原创数论

0 or 1 Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3708 Accepted Submission(s): 1077Problem Description Solving problem is a interesti

2017-04-14 20:34:53 372

原创 HDU 2608 0 or 1

0 or 1 Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3708 Accepted Submission(s): 1077Problem Description Solving problem is a interesti

2017-04-12 16:38:46 344

原创 TOJ 4349: The Tallest in the Class

4349: The Tallest in the Class DescriptionWe want to know who is the tallest student in our class. But student’s height is used a different unit of measurement, either metres(m), decimeteres(dm), ce

2017-04-04 12:34:46 496

原创 TOJ 4493 Remove Digits 贪心

题目4493: Remove Digits DescriptionGiven an N-digit number, you should remove K digits and make the new integer as large as possible.InputThe first line has two integers N and K (1 ≤ K#include <stdio.h

2017-04-04 12:22:34 646

原创 hdu2682 TREE 素数，最小生成树

单击666传送 TreeProblem Description There are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a p

2017-04-04 12:12:43 600

双时钟脉冲电路 Multisim 12.0可以直接打开

用Multisim 12.0做的小电路仿真，使用了JK触发器和几个逻辑门

2017-12-09

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人