ACM-UVAOJ
寻找星空的孩子
CSDN博客首页:http://blog.csdn.net/u010579068?viewmode=list
博客园地址:http://www.cnblogs.com/yuyixingkong/
展开
-
Dog Distance(UVA11796)
【分析】 先看一种简单的情况:甲和乙的路线都是一条线段。因为运动是相对的,因此也可以认为甲静止不动,乙沿着自己的直线走,因此问题转化为求点到线段的最小距离和最大距离; 有了简化版的分析,只需要模拟整个过程,设现在甲的位置在Pa,刚刚经过编号为Sa的拐点;乙的位置是Pb,刚刚经过编号为Sb的拐点,则我们只需要计算他们俩谁先到拐点,那么在这个时间点之前的问题就是我们刚刚讨论过的“简化版”。求原创 2015-04-18 16:09:11 · 1021 阅读 · 0 评论 -
Minimum Sum LCM(uva10791+和最小的LCM+推理)
L - Minimum Sum LCMTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 10791 题意:输入正整数n,找至少两个数,使得他们的LCM为n且要输出最小的和; 思路:既然LCM是n,那么一定是原创 2015-06-11 21:20:35 · 1097 阅读 · 0 评论 -
Add Again(重复元素排序)
Add AgainInput: Standard InputOutput: Standard Output Summation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intelligent techniqu原创 2015-06-09 22:00:53 · 965 阅读 · 0 评论 -
Again Prime? No Time.(uva10870+数论)
Again Prime? No time.Input: standard inputOutput: standard outputTime Limit: 1 secondThe problem statement is very easy. Given a number n you have to determine the largest power of m, not ne原创 2015-05-14 18:41:32 · 966 阅读 · 0 评论 -
Integer Game(UVA11489)3的倍数
K - Integer GameTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11489 题意:在n中取数字,使剩下的数是3的倍数,不能取则失败。思路:如果能使当前数为3的倍数,数字和必是3的倍数。原创 2015-06-10 21:06:25 · 1058 阅读 · 0 评论 -
Viva Confetti(几何+圆盘覆盖问题)
Viva ConfettiTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 2572Appoint description: System Crawler (2015-04-19)Description原创 2015-04-22 21:29:15 · 1657 阅读 · 0 评论 -
Morley’s Theorem(几何+UVA11178)
题意:Morley定理,求D、E、F的坐标思路:没什么算法,就是几何的应用。注意旋转角就好了。转载请注明出处:寻找&星空の孩子 题目链接:UVA11178 #include#include#define PI acos(-1.0)using namespace std;struct Point{ double x,y; Point(double原创 2015-04-17 23:16:55 · 802 阅读 · 0 评论 -
Power of Matrix(uva11149+矩阵快速幂)
Power of MatrixTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11149Appoint description: System Crawler (2015-03-15)Description原创 2015-03-23 11:33:01 · 698 阅读 · 0 评论 -
Contemplation! Algebra(矩阵快速幂,uva10655)
Problem EContemplation! AlgebraInput: Standard InputOutput: Standard OutputTime Limit: 1 Second Given the value of a+b and ab you will have to find the value of an+bn InputThe input file原创 2015-03-23 11:32:47 · 588 阅读 · 0 评论 -
11078 - Open Credit System
11078 - Open Credit SystemTime limit: 3.000 secondsProblem EOpen Credit SystemInput: Standard InputOutput: Standard OutputIn an open credit system, the students can choose anycou原创 2015-03-23 11:30:35 · 953 阅读 · 0 评论 -
Hashmat the brave warrior(UVa10055)简单题
Problem AHashmat the brave warriorInput: standard inputOutput: standard output Hashmat is a brave warrior who with his group of young soldiers moves from one place to another to fight agains原创 2015-03-23 11:27:31 · 658 阅读 · 0 评论 -
UVA12493 - Stars(求1-N与N互质的个数)欧拉函数
UVA12493 - Stars(求1-N与N互质的个数)欧拉函数 bnuoj26358原创 2015-08-17 12:55:16 · 2419 阅读 · 0 评论 -
Teams(uva11609+组合)
I - TeamsTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11609 题意:有n个人,选多个人参加比赛,其中一个是队长,队长不同其他选手相同也算作不同的方案,。问你一共有多少种方案。思路:自己才纸上稍微推理一下,n原创 2015-06-11 21:30:18 · 1064 阅读 · 0 评论