爆米

题意：给定一个日期范围，判断月和日均为素数的天数。比较水的题目，for循环中的？：判断语句、日期的打表，可以大幅精简代码。#include #include using namespace std;int day1[15] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; //闰年int day2[15] = {0,

Division Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is

How Many Fibs?Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4592    Accepted Submission(s): 1803Problem DescriptionRecall the defi

Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or print "NO". Inputeach test case contains two numbers A and B. Outputfor each case, i

这道题思路明确了还是不难的，关键是判断方法。首先正方体有三种不同的边，我们记为abc，并且记a>b>c，则长方体的六个面必定是ab、ab、ac、ac、bc、bc（按照边的长度排序），符合这种形式的就是一个正方体。根据题目叙述，重点是怎样把输入的数据转化为这种标准形式，然后进行判断。首先把每个面的两条边大小弄清楚，如ba转换为ab，即长>宽；然后对六个面进行排序，按照长从大到小排序，

这道题太欠抽了，做了N次，每次做到一半的时候就感觉思路完全不对，然后就全删了重做。最后这次，交上一次AC了。题目本身，分为定义和赋值两部分，其中赋值又分为左右两部分，左边的内层和右边需要递归求出值来，左边外层直接赋值即可。这道题就是考察STL的字符串。前两天学习了Python，今天用STL的string感觉特别蛋疼，int和string的相互转换还这么麻烦，还好UVa支持C++11，还有字

Average NumberTime Limit: 1 Sec  Memory Limit: 128 MDescriptionPlease calculate the average number of the given n numbers without doing calculations of addition, multiplication, or division,

Extraordinarily Tired StudentsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionWhen a student is too tired, he can

Dr. Tuple is working on the new data-mining application for Advanced Commercial Merchandise Inc. One of the subroutines for this application works with two arrays P and Q containing N records of dat

书上的代码交上去Runtime Error，故按照自己的思路重写了#include using namespace std;int main(){#ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);#endif int t, cnt

Problem A: Fractions Again?!Time limit: 1 secondIt is easy to see that for every fraction in the form  (k > 0), we can always find two positive integers x and y, x ≥ y, such th

ExponentiationTime Limit: 1000/500 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7275    Accepted Submission(s): 2072Problem DescriptionProblems involvi

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 t

Figure 1.DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, namely Adenine, Thymine, Guanine, and Cytosine as shown in Fi

这个题，走了不少弯路，做了之上2个小时，究其原因，化学功底不深厚啊。。。。。

题意：给定N个数，选出其中数量大于(N+1)/2的数两种方法实现，第一种方法排序，选择中间的那个数。第二种方法搜一遍。#include #include #include #include #include using namespace std;int a[1024000];int main(){ int n; while(cin >> n){

这道题有点像翻煎饼那题，方法不限，只要次数在9^6之内即可。从前到后依此选择数，最多只需要两次就可以将每个数放到正确位置。#include using namespace std;int a[10240];void change(const int l, const int r){ for(int i = l, j = l+(r+1-l)/2; j <= r; ++i,

循环遍历数组即可，注意临界条件的判断。#include using namespace std;const int maxn = 102400;int p[maxn], q[maxn];int main(){ //freopen("in.txt", "r", stdin); int T; cin >> T; for(int t = 1; t <= T; +

这题用了冒泡排序的思想，不过紫书上的描述有误，建议参考原题。#include using namespace std;deque a;vector res;bool is_order(){ for (int i = 1; i != a.size(); ++i) if (a[i] < a[i-1]) return false; return true;}int ma

比较水的一题，找到方法就好说了。#include using namespace std;char tab[128][128];int main(){ int h, w; while (cin >> h >> w){ cin.get(); for (int i = 0; i < h; ++i ) cin >> tab[i]; int cnt = 0; for

基础题，就用基本方法即可，计算约数时算到sqrt(n)即可，要注意(int)sqrt(n)和n的关系。#include #include #include using namespace std;int main(){ int T; cin >> T; while (T--){ int L, U; cin >> L >> U; int MAX = -1, num;

这道题在数据结构这一章里算是简单的，但是很容易WA和RE，可能得debug很长时间。值得注意的地方：1.纸牌被处理的次数中，每次发牌并且检查一次匹配，算处理一次，而不是四次2.查看匹配的时候，如果一次匹配成功并且删除了三张纸牌，要继续检查是否匹配，这是个循环的过程3.可以通过用set记录State判重，判断打平的情况4.纸牌收回手中时，注意纸牌摆放的顺序#include

Squares A children's board game consists of a square array of dots that contains lines connecting some of the pairs of adjacent dots. One part of the game requires that the players count

Flooded! To enable homebuyers to estimate the cost of flood insurance, a real-estate firm provides clients with the elevation of each 10-meter by 10-meter square of land in regions where homes may be

Problem DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。 Input输入第一行为一个整数N，接下来N行为整数Pi（1 Output输出为N行，每行为对应的f(Pi)。 Sa

#include #include #include #include using namespace std;long long int table[1024000];void init(void){ for(long long int i=1; i<1000005; i++) { long long int x = i; lon

DescriptionThere must be many A + B problems in our HDOJ , now a new one is coming. Give you two hexadecimal integers , your task is to calculate the sum of them,and print it in hexadecimal too.

最害怕这种下棋的题了，情况特别多，考差细节特别多，当时没做，现在翻过头来再看一下，顺便复习一下基础。这道题要注意格式，输出统计黑白棋子数的时候，数要占两位。其他都是普通的思路，顺着题目要求即可。寒假刚刚开始，是提高自我的好时间，希望自己能利用起来。#include using namespace std;char tab[10][10];const int dir[8]

这题不难，但细节比较多，排序的依据有很多，比较容易出错。考差C++和STL也比较全面，比如结构体、构造函数、map、pair、vector、sort、unique、copy等等，使用C++11的lambda配合泛型算法是一个很好的选择。#include #define EPS 1e-7using namespace std;struct MAP{ string name; dou

Morse Mismatches Samuel F. B. Morse is best known for the coding scheme that carries his name. Morse code is still used in international radio communication. The coding of text using Mor

Integer InquiryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13470    Accepted Submission(s): 3382Problem DescriptionOne of the fi

这个题，三个月前写了一次，当时写道200行的时候，就感觉恶心了，当时感觉再写100行也完不成。今天拿出这题来重写了，尽量精简代码，结果没想到90行就AC了。精简代码的好处之一便是方便调试，因为细节太多了，把很多相似的内容放在函数中就好了。看似四个棋子的走法不同，实则有一个共同点：都需要判断棋子和“将”所在的行或者列中，两个棋子之间的棋子数。对于“帅”和“车”，之间的棋子数必须为0。对于炮，

这题做了两个月，是第四章最后一个AC的题，小细节比较多，仅样例的输出就一百多行，无奈借助专业的ultracompare才完成了对比，最后找到汝佳老师的源代码改了一个小细节AC了。注意的地方有：精度的控制；人数为0时平均分的输出；增加人员的时候，同名的人如果被移除了也可以添加。#include using namespace std;const double EPS = 1e-5;c

YES! YOU CAN!Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 44  Solved: 9[Submit][Status][Web Board]DescriptionTwo polar bears Menshykov and Uslada from the St.Petersburg zoo and elephan

There is an objective test result such as ``OOXXOXXOOO". An `O' means a correct answer of a problem and an `X' means a wrong answer. The score of each problem of this test is calculated by itself an

DescriptionAlex is administrator of IP networks. His clients have a bunch of individual IP addresses and he decided to group all those IP addresses into the smallest possible IP network.Each

You are working in a team that writes Incredibly Customizable Programming Codewriter (ICPC) which is basically a text editor with bells and whistles. You are working on a module that takes a piece of

Borrowers I mean your borrowers of books - those mutilators of collections, spoilers of the symmetry of shelves, and creators of odd volumes.- (Charles Lamb, Essays of Elia (1823) `T

Problem D - Maximum ProductTime Limit: 1 secondGiven a sequence of integers S = {S1, S2, ..., Sn}, you should determine what is the value of the maximum positive product involving consecut

Problem DescriptionNow our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero firs