亚洲区
夜幕下的ACM之路
通往成功的路注定是孤独的,我不会放弃!!!!
展开
-
HDU1018Big Number
这道题为亚洲区的水题,,,题目大意为求一下阶乘是几位数,在这里只需调用一个函数即可以解决问题。。。。 这里写代码片 #include < stdio.h> #include < math.h> int main() { int t,n; scanf(“%d”,&t); while(t–) { scanf(“%d”,&n);原创 2016-01-18 19:36:53 · 306 阅读 · 0 评论 -
2016年中国大学生程序设计竞赛(杭州) A ArcSoft's Office Rearrangement(贪心)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5933 ArcSoft’s Office RearrangementTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 288 Accep原创 2016-10-31 10:28:14 · 667 阅读 · 0 评论 -
2016年中国大学生程序设计竞赛(杭州) F Four Operations(暴力枚举)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5938 Four OperationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 243 Accepted Submission(原创 2016-10-31 10:35:01 · 529 阅读 · 0 评论 -
经典第十一章 例题11-2 UVA 11395 Slim Span(最小生成树)【ACM/ICPC Japan2007】
题目链接: https://odzkskevi.qnssl.com/8e16f8701018d0e3529ac3ca319e1f67 中文题意:给出一个n(n<=100)结点的图,求苗条度(最大边减最小边的值)尽量小的生成树。 【分析】首先把边按权值从小到大排序。对于一个连续的边集区间[L,R],如果这些边使得n个点全部连通,则一定存在一个苗条度不超过W[R]-W[L]的生成树(其中W[i]表原创 2016-09-28 21:13:42 · 384 阅读 · 0 评论 -
HDU 4027 Can you answer these queries?(线段树)【The 36th ACM/ICPC Asia Regional 上海站网赛】
Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 13662 Accepted Submission(s): 3137Problem Description A lot of原创 2016-08-13 12:58:09 · 296 阅读 · 0 评论 -
2016 ACM/ICPC Asia Regional Dalian Online Friends and Enemies
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=5874Friends and EnemiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 88 Accepted Subm原创 2016-09-10 20:51:12 · 427 阅读 · 0 评论 -
2016 ACM/ICPC Asia Regional Dalian Online Football Games
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=5873Football GamesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 235 Accepted Submissi原创 2016-09-10 20:47:35 · 446 阅读 · 0 评论 -
2016 ACM/ICPC Asia Regional Dalian Online Sparse Graph(BFS)
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=5876Sparse GraphTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 122 Accepted Submissi原创 2016-09-10 20:23:38 · 450 阅读 · 0 评论 -
HDU 5438 Ponds(BFS+拓扑排序)【2015亚洲区长春站网赛B】
PondsTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 3615 Accepted Submission(s): 1083Problem Description Betty owns a lot of ponds, some原创 2016-08-08 12:08:57 · 379 阅读 · 0 评论 -
HDU 4006 The kth great number(线段树【亚洲区网络赛题目】)
The kth great numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 9217 Accepted Submission(s): 3652Problem Description Xiao Ming and Xiao原创 2016-04-12 18:12:59 · 443 阅读 · 0 评论 -
FZU 1106 Sum of Factorials
John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions to the foundations of mathematics, logic, quantum physics, meteorology, scie原创 2016-03-06 21:50:36 · 574 阅读 · 0 评论 -
HDU 4730 We Love MOE Girls (2013成都网络赛,签到水题)
用C++输出固定的格式简直要被坑死的感觉。。。以后注意吧,,,用C++控制输出格式真不是一件方便的事,最好的方法便是C++与C共用。,,看我聪明吧,,,哈哈。。。 下面附上AC代码#include<iostream> #include<cstring> using namespace std;int main() { int t,j=0; cin>>t; while(t--原创 2016-02-20 22:19:25 · 339 阅读 · 0 评论 -
HDU 5477 A Sweet Journey(亚洲区水题)
Master Di plans to take his girlfriend for a travel by bike. Their journey, which can be seen as a line segment of length L, is a road of swamps and flats. In the swamp, it takes A point strengths per原创 2016-03-29 23:46:24 · 551 阅读 · 0 评论 -
HDU 4813 Hard Code(2013长春)
本题是一道水题,是亚洲区2013年长春站的一道题目,就是按照要求将字符串分割下面附上AC代码:这里写代码片#include<iostream> #include<cstring> #include<algorithm> using namespace std;int main() { int t,n,m; string a; cin>>t; while(t--)原创 2016-02-19 14:16:58 · 333 阅读 · 0 评论 -
HDU 3361 Assignments(简单的贪心)
本题虽然为一道亚洲区的题目,但为最简单的贪心题目,仅仅需要两个排序和一个判断即可解决此题目。话不多说,渣渣的AC代码如下这里写代码片#include<cstdio> #include<iostream> #include<algorithm> using namespace std;int cmp(int x, int y) { return x>y; } int a[1005],b[100原创 2016-02-19 11:36:09 · 385 阅读 · 0 评论 -
2016年中国大学生程序设计竞赛(杭州)C Car(贪心算法+分数处理)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5935CarTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 287 Accepted Submission(s): 107Problem原创 2016-10-31 10:47:16 · 725 阅读 · 0 评论