![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
UVA
文章平均质量分 88
risker_2013
这个作者很懒,什么都没留下…
展开
-
UVA 10763 Foreign Exchange
#include #include #include#include using namespace std;int Map[1005][1005];int main(){ int n,a,b; int i,j,k,Max; while(~scanf("%d",&n)&&n) { memset(Map,0,sizeo原创 2013-08-10 17:40:28 · 529 阅读 · 0 评论 -
uva 10487 Closest Sums
Closest SumsInput: standard inputOutput: standard outputTime Limit: 3 seconds Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of原创 2013-08-11 18:57:56 · 570 阅读 · 0 评论 -
uva 10340 All in All
All in AllInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MBYou have devised a new encryption technique which encodes a message by inserting between its cha原创 2013-08-12 11:56:57 · 598 阅读 · 0 评论 -
uva 10706 Number Sequence
Number SequenceInput: standard inputOutput: standard outputTime Limit: 1 secondA single positive integer i is given. Write a program to find the digit located in the position i in the sequ原创 2013-08-12 12:06:02 · 661 阅读 · 0 评论 -
uva 10700 Camel trading
学习STL有一段时间啦,一直没有做题,今天这题也可以用贪心做,但我借鉴了前辈的思路,用栈做的,虽然调了一个多小时才调正确了,但还是蛮有成就感的~ Camel tradingTime Limit: 1 secondBackgroundAroud 800 A.D., El Mamum, Calif of Baghdad was presented the formu原创 2013-08-12 14:18:03 · 702 阅读 · 0 评论 -
uva 10026 Shoemaker's Problem
大致题意是:有一个鞋匠,共有n个任务,第i个任务开始之前每天需要罚款s[i],求最小的罚款数。解题思路:简单的贪心问题,即时间越早,而罚款数越大则越先修。按照fine/day排序即可。可以用冒泡法,但不能用选择法排序,若用快排,需要另加一个数标记位置。 Shoemaker's Problem Shoemaker has N原创 2013-08-12 15:21:06 · 626 阅读 · 0 评论 -
uva 993 Product of digits
Product of digits For a given non-negative integer number N , find the minimal natural Q such that the product of all digits of Q is equal N .InputThe first line of input原创 2013-08-16 20:03:34 · 637 阅读 · 0 评论 -
UVA 10673 Play with Floor and Ceil
TheoremFor any two integers x and k there exists two more integers p and q such that:It’s a fairly easy task to prove this theorem, so we’d not ask you to do that. We’d ask for something even ea原创 2013-10-27 11:58:38 · 825 阅读 · 0 评论 -
Codeforces Round #139 (Div. 2) B. Well-known Numbers
B. Well-known Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNumbers k-bonacci (k is integer, k原创 2014-03-27 18:16:43 · 589 阅读 · 0 评论