![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
UVA
文章平均质量分 51
友谊无价
CQUPT的蒟蒻
展开
-
[UVA] 725 Division
题意分析:暴力的入门级题目,可以通过枚举除数解决。注意这里的输入输出,还有个很妙的处理0-9的不重复的方法。#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> using namespace std; char ans[11]="0123456789"; char s[11];bool com(char原创 2017-03-02 21:11:39 · 177 阅读 · 0 评论 -
[UVA] 11059 Maximum Product
题目分析:暴力,直接枚举起点和终点,乘积最大不超过10的18次方,可以用long long 存下。 题目代码:#include<iostream> #include<cstdio> #include<cstring> using namespace std ;int s[50];int main(){ //freopen("in.txt","r",stdin); //freopen原创 2017-03-02 21:35:57 · 190 阅读 · 0 评论 -
[UVA] 10976 Fractions Again?!
题目分析:暴力一下,还有判断除数是否为整数直接取余一下就好了。关键是分析出y<=k*2;题目代码:#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std ;int main(){ //freopen("in.txt","r",st原创 2017-03-03 10:48:38 · 181 阅读 · 0 评论 -
[UVA] 540 Team Queue
题目: Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time th原创 2017-03-27 15:48:02 · 369 阅读 · 0 评论 -
[HDU] 1027 Ignatius and the Princess II
题目: Now 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 first. feng5166 says, “原创 2017-03-27 15:50:42 · 475 阅读 · 0 评论 -
[UVA]10474 Where is the Marble?
题目: Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in ascending order of the nu原创 2017-03-24 09:58:10 · 362 阅读 · 0 评论 -
[UVA] 101 The Blocks Problem
题目: Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in which原创 2017-03-24 11:05:58 · 361 阅读 · 0 评论 -
[UVA] 10815 Andy's First Dictionary
题目: Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all th原创 2017-03-27 08:45:07 · 331 阅读 · 0 评论