uva
Melicent1
这个作者很懒,什么都没留下…
展开
-
1uva10392(数论)
题意:将大数进行因式分解(分解质因数)注意题目的数据范围 The numbers will fit in gcc'slong longint datatype. You may assume that there will be at most onefactor more than 1000000.参考网上的。。处理的确实妙极了。。http://blog.csdn.net/shankel原创 2013-05-30 10:58:33 · 531 阅读 · 0 评论 -
uva10025(数学)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=12&problem=966&mosmsg=Submission+received+with+ID+1053746610025 - The ? 1 ? 2 ? ... ? n = k problemTim原创 2013-05-30 10:58:00 · 864 阅读 · 0 评论 -
uva573(数学)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=7&problem=514&mosmsg=Submission+received+with+ID+10536992573 - The SnailTime limit: 3.000 secondsT原创 2013-05-30 10:57:58 · 544 阅读 · 0 评论 -
(要经常看)uva216
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=152216 - Getting in LineTime limit: 3.000 seconds Getting in LineComputer networking requires that t原创 2013-05-30 10:53:48 · 782 阅读 · 0 评论 -
uva146
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=82146 - ID CodesTime limit: 3.000 secondsIDCodesIt is 2084 and the year of Big Brother has fin原创 2013-05-30 10:53:40 · 443 阅读 · 0 评论 -
uva784
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=725784 - Maze ExplorationTime limit: 3.000 secondsMazeExplorationA maze of rectangular rooms i原创 2013-05-30 10:53:33 · 524 阅读 · 0 评论 -
1uva591(数学)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=532591 - Box of BricksTime limit: 3.000 secondsBoxof BricksLittle Bob likes playing with his b原创 2013-05-30 10:53:26 · 489 阅读 · 0 评论 -
uva156
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=49113 - Power of CryptographyTime limit: 3.000 secondsPower of CryptographyBackgroundCurrent原创 2013-05-30 10:53:22 · 506 阅读 · 0 评论 -
uva10420
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=136110420 - List of ConquestsTime limit: 3.000 secondsProblem BList of ConquestsInput:standard input原创 2013-05-30 10:53:11 · 529 阅读 · 0 评论 -
uva10106(大数)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=104710106 - ProductTime limit: 3.000 secondsProductTheProblemThe problem is to multiply two i原创 2013-05-30 10:53:09 · 414 阅读 · 0 评论 -
uva465
函数名: atof 功 能: 把字符串转换成浮点数http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=406465 - OverflowTime limit: 3.000 secondsOverflowWrite a progra原创 2013-05-30 10:53:07 · 435 阅读 · 0 评论 -
uva424(大数)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=365424 - Integer InquiryTime limit: 3.000 secondsInteger InquiryOne of the first users of BIT'原创 2013-05-30 10:53:05 · 475 阅读 · 0 评论 -
uva10014(数学)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=12&problem=955&mosmsg=Submission+received+with+ID+1053802810014 - Simple calculationsTime limit: 3.000原创 2013-05-30 10:58:02 · 534 阅读 · 0 评论 -
uva10970(数学)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=21&problem=1911&mosmsg=Submission+received+with+ID+1053811610970 - Big ChocolateTime limit: 3.000 seco原创 2013-05-30 10:58:04 · 565 阅读 · 0 评论 -
uva575(数论)
就是按照给的公式做就行了。。 #include#include#include#includeusing namespace std;char s[1010];int main(){ while(scanf("%s",s)!=EOF) { if(s[0]=='0') break; int len=strlen(s); int i,j; unsigned原创 2013-05-30 10:58:27 · 520 阅读 · 0 评论 -
uva10719(数学)
题意:已知:方程对于任意正整数k,则存在这个关系式:其中,q(x)称为p(x)的商,r是余数。给出p(x)的各项系数及k,求q(x)的各项系数,及r。刚开始实在不会倒是头脑里面有个思路就是按照解方程的步骤求解。比如:题目中的p(x) = x3 - 7x2+ 15x - 8 and k= 3 then q(x) = x2 - 4x + 3 and r =1.我们手动模拟可以发现要得原创 2013-05-30 10:58:15 · 607 阅读 · 0 评论 -
uva10790(数学)
题意:就是上面给出N个点,下面给出M个点,上面的每一个点跟下面的给一个点都有连线,求连线的交点数的最大值。公式不是自己想出来的。摘自别人的bolg因为一个交叉点的存在依赖于两条直线,四个顶点,因此用顶端中a个数字选出2个顶点共有a*(a-1)/2,同理于b。。详细推理过程:http://hi.baidu.com/knowledgetime/blog/item/53fe431ddbe091f原创 2013-05-30 10:58:11 · 497 阅读 · 0 评论 -
uva10167
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=110810167 - Birthday CakeTime limit: 3.000 secondsProblem G. Birthday CakeBackgroundLucy and L原创 2013-05-30 10:53:37 · 472 阅读 · 0 评论 -
uva10050
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=99110050 - HartalsTime limit: 3.000 secondsProblem D:HartalsA social research organization has原创 2013-05-30 10:53:28 · 454 阅读 · 0 评论 -
(还有一个点)uva156
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=92156 - AnanagramsTime limit: 3.000 secondsAnanagramsMost crossword puzzle fans are used to anagrams-原创 2013-05-30 10:53:20 · 477 阅读 · 0 评论 -
uva10474
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=141510474 - Where is the Marble?Time limit: 3.000 secondsWhere is theMarble?Raju and Meena lov原创 2013-05-30 10:53:16 · 480 阅读 · 0 评论 -
uva10098解题报告
10098 - GeneratingFastTime limit: 3.000 secondsProblem C Generating Fast, SortedPermutationInput: StandardInputOutput: StandardOutput Generating permutation has alwaysbeen an important p原创 2013-05-30 10:49:35 · 520 阅读 · 0 评论 -
uva11044(数学)
题意:在一个n*m的矩形中最少放置多少个声纳可以覆盖整个矩形,注意矩形的边界可以不要覆盖(因为水怪个头太大the bordercells do not need to be controlled, because Nessy cannot hide there(she is too big).)这题自己想的太高兴了1Y呵呵。。就是自己手动模拟发现要使放置的声纳个数最小的话就是先考虑一行的结原创 2013-05-30 10:58:13 · 642 阅读 · 0 评论 -
uva10499
题意:把一个球体切成n块后(按照表面积计算)可以额外获得的利益是百分之多少。。球的表面积 :4*π*r*r, 分别后多出的面积 :n*π*r*r,利润 :25*n % 。按表面积分计算利润初始球的表面积4*pi*r*rn=2;切一刀多了2个半圆面2*pi*r*r profit 50%n=3;多三个半圆面 profit 75%n=4;profit 100%所以分成n份多n个半圆面。#原创 2013-05-30 10:58:09 · 573 阅读 · 0 评论 -
uva864(数学)
题意:给你一个个阶梯,要求起步和停止的步长为一,每次只能在上次的基础上增加一,减少一或者不变。求最少的步长。直接模拟就好,分别从头尾开始增加步长。#include#includeusing namespace std;int main(){ int t; scanf("%d",&t); while(t--) { int start,end; scanf("%d%d原创 2013-05-30 10:58:06 · 550 阅读 · 0 评论 -
uva10878(字符串)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=181910878 - Decode the tapeTime limit: 3.000 secondsProblem ADecode the tapeTime Limit: 1 second原创 2013-05-30 10:52:59 · 448 阅读 · 0 评论 -
uva10010
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=95110010 - Where's Waldorf?Time limit: 3.000 secondsWhere'sWaldorf? Given a m by n grid ofletters, (原创 2013-05-30 10:52:50 · 531 阅读 · 0 评论 -
uva167(与八皇后相关)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=103167 - The Sultan's SuccessorsTime limit: 3.000 secondsTheSultan's SuccessorsThe Sultan of原创 2013-05-30 10:53:46 · 1458 阅读 · 0 评论 -
uva10098
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=103910098 - Generating FastTime limit: 3.000 secondsProblem C Generating Fast,Sorted PermutationInp原创 2013-05-30 10:53:42 · 540 阅读 · 0 评论 -
uva10004(bfs||dfs)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=94510004 - BicoloringTime limit: 3.000 secondsBicoloringIn 1976 the ``Four Color Map Theorem"原创 2013-05-30 10:53:35 · 424 阅读 · 0 评论 -
uva152
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=88152 - Tree's a CrowdTime limit: 3.000 secondsTree's a CrowdDr William Larch, noted plant psyc原创 2013-05-30 10:53:18 · 470 阅读 · 0 评论 -
uva340
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=276340 - Master-Mind HintsTime limit: 3.000 secondsMaster-Mind HintsMasterMind is a game for tw原创 2013-05-30 10:53:14 · 544 阅读 · 0 评论 -
uva10815
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1756 10815 - Andy's First DictionaryTime limit: 3.000 secondsProblemB: Andy's First Dictionary原创 2013-05-30 10:53:03 · 430 阅读 · 0 评论 -
uva10361(字符串)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=15&problem=1302&mosmsg=Submission+received+with+ID+1037941510361 - Automatic PoetryTime limit: 3.000 s原创 2013-05-30 10:52:57 · 393 阅读 · 0 评论 -
uva409(字符串)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=350409 - Excuses, Excuses!Time limit: 3.000 secondsExcuses, Excuses!Judge Ito is having a probl原创 2013-05-30 10:52:52 · 452 阅读 · 0 评论 -
uva401(回文串)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=342401 - PalindromesTime limit: 3.000 seconds PalindromesA regular palindrome is a string of numbers原创 2013-05-30 10:52:48 · 454 阅读 · 0 评论 -
(未)uva208 - Firetruck
208 - FiretruckTime limit: 3.000 secondsFiretruckThe Center City fire department collaborates with thetransportation department to maintain maps of the city whichreflects the current status of th原创 2013-05-30 10:49:58 · 524 阅读 · 0 评论 -
uva 10344解题报告
Input: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBYour task is to write a program that can decide whether you canfind an arithmetic expression consisting of five原创 2013-05-30 10:49:54 · 482 阅读 · 0 评论 -
uva10110(数论)
1.Which is less then or equals 2^32-1。。。n不能定义为int。。。2.in i'th walk he toggles only the switches whose serial isdivisable by i.第i次走的时候改变开关是那些只能被i整除的数。。。这样如果要最后一个开关是开的这能是完全平方数。因为一开始开关都是关的,要让他开只能改变奇数次原创 2013-05-30 10:58:24 · 636 阅读 · 0 评论 -
uva568(数论)
题意:求n!从有数起输出第一个不为0的数子。。思路:就是求n!在处理一步就是结果了。。n!求法白书p72...#include #include#include#includeusing namespace std;const int maxn=10010;int f[maxn];int main(){ int i,j,n; while(scanf("%d",&n)!=E原创 2013-05-30 10:58:29 · 461 阅读 · 0 评论