摘要:
题目链接: "POJ 1860" Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular cu 阅读全文
摘要:
题目链接: "HDU 5183" Problem Description When given an array $(a_0,a_1,a_2,⋯a_{n−1})$ and an integer $K$, you are expected to judge whether there is a pai 阅读全文
摘要:
写程序时想要用 cin 对输入的合法性检查,于是学习了一下 cin.fail() 函数,顺便学习了类似的一些函数。 cin 对象包含了一个描述流状态的数据成员。流状态有 3 个标志位:eofbit,badbit 和 failbit。 当 cin 操作到达文件末尾时,eofbit 置 1。 当流被破坏 阅读全文
摘要:
题目链接: "POJ 2287" Description Here is a famous story in Chinese history. That was about 2300 years ago. General Tian Ji was a high official in the coun 阅读全文
摘要:
题目链接: "HDU 1205" Problem Description HOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖 阅读全文
摘要:
题目链接: "HDU 1028" Problem Description "Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. "Th 阅读全文
摘要:
题目链接: "HDU 3746" Sample Input Sample Output Author possessor WC Source "HDU 3rd “Vegetable Birds Cup” Programming Open Contest" Solution 题意 给定一个字符串,问至 阅读全文
摘要:
比赛链接: "Codeforces Round 596 (Div. 2, based on Technocup 2020 Elimination Round 2)" 官方题解: "Technocup 2020 — Elimination Round 2 + Codeforces Round 596: 阅读全文
摘要:
题目链接: "HDU 2087" Problem Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见A 阅读全文
摘要:
题目链接: "HDU 2899" Problem Description Now, here is a fuction: F(x) = 6x^7+8x^6+7x^3+5x^2 yx (0 Can you find the minimum value when x is between 0 and 1 阅读全文