ACM - 随笔分类 - hfcnal

第六届福建省大学生程序设计竞赛不完全题解

摘要：昨天自己队做了一下第六届福建省赛，感觉有些蒙，赛后补了几道题，能力有限，一共只出A了7道题 A题 Super Mobile Charger 题目链接 http://acm.fzu.edu.cn/problem.php?pid=2212 水题 #include<iostream> #include<c 阅读全文

posted @ 2016-08-10 19:59 hfcnal 阅读(515) 评论(0) 推荐(0)

UVa 11137 - Ingenuous Cubrency

摘要：题目：统计一个数字可以有多少种立方和的表示方式。分析：dp，完全背包。又见整数拆分。 #include <bits/stdc++.h> using namespace std; int cube[25]; long long F[10001]; int main() { for (int i = 阅读全文

posted @ 2016-07-16 16:08 hfcnal 阅读(424) 评论(0) 推荐(0)

codeforces 359 C - Robbers' watch

摘要：Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description Robbers, who attacked the Gerda's cab, are very successful in coveri 阅读全文

posted @ 2016-07-15 19:49 hfcnal 阅读(556) 评论(1) 推荐(0)

codeforces 360 C - NP-Hard Problem

摘要：转载自：http://www.cnblogs.com/shawn-ji/p/5668293.html#3470095 原题： Description Recently, Pari and Arya did some research about NP-Hard problems and they f 阅读全文

posted @ 2016-07-14 15:50 hfcnal 阅读(328) 评论(0) 推荐(0)

codeforces 361 D - Friends and Subsequences

摘要：Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Description Mike and !Mike are old childhood rivals, they are opposite in everyt 阅读全文

posted @ 2016-07-12 21:03 hfcnal 阅读(263) 评论(0) 推荐(0)

codeforces 361 C - Mike and Chocolate Thieves

摘要：Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description Bad news came to Mike's village, some thieves stole a bunch of choco 阅读全文

posted @ 2016-07-12 20:55 hfcnal 阅读(362) 评论(0) 推荐(0)

codeforces 361 B - Mike and Shortcuts

摘要：Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Time Limit 阅读全文

posted @ 2016-07-12 20:35 hfcnal 阅读(305) 评论(0) 推荐(0)

codeforces 361 A - Mike and Cellphone

摘要：题目链接：http://codeforces.com/contest/689/problem/A 题目链接：http://codeforces.com/contest/689/problem/A 题目链接：http://codeforces.com/contest/689/problem/A 题目链阅读全文

posted @ 2016-07-12 20:30 hfcnal 阅读(351) 评论(0) 推荐(0)

Find your present (2) （位异或）

摘要：Problem Description In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents no 阅读全文

posted @ 2016-03-02 20:49 hfcnal 阅读(484) 评论(0) 推荐(0)

UVA 10763 Foreign Exchange

摘要：Time Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluDescriptionYour non-profit organization (iCORE-internationalConfederation ofRevolverEnthus... 阅读全文

posted @ 2015-10-25 20:16 hfcnal 阅读(325) 评论(0) 推荐(0)

十月例题F题 - City Game

摘要：F -City GameTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluBob is a strategy game programming specialist. In his new city building game t... 阅读全文

posted @ 2015-10-16 19:55 hfcnal 阅读(178) 评论(0) 推荐(0)

hdu 2078

摘要：复习时间Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription为了能过个好年，xhd开始复习了，于是每天晚上背着书往教室跑。xhd复习有个习惯，在复习完一门课后，他总是挑一门更... 阅读全文

posted @ 2015-08-26 20:39 hfcnal 阅读(206) 评论(0) 推荐(0)

hdu 1229 超级大水题

摘要：Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription读入两个小于10000的正整数A和B，计算A+B。需要注意的是：如果A和B的末尾K（不超过8）位数字相同，请直接输出-1。... 阅读全文

posted @ 2015-08-25 21:51 hfcnal 阅读(141) 评论(0) 推荐(0)

CodeForces 569A 第六周比赛C踢

摘要：C -CTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 569ADescriptionLittle Lesha loves listening to m... 阅读全文

posted @ 2015-08-21 20:35 hfcnal 阅读(191) 评论(0) 推荐(0)

CodeForces 478B 第六周比赛B题

摘要：B -BTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uDescriptionnparticipants of the competition were split intomteams in some manne... 阅读全文

posted @ 2015-08-21 20:29 hfcnal 阅读(188) 评论(0) 推荐(0)

LightOJ 1317 第六周比赛A题

摘要：A -ATime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionYou probably have played the game "Throwing Balls into the Basket". It ... 阅读全文

posted @ 2015-08-21 20:21 hfcnal 阅读(285) 评论(0) 推荐(0)

uva 580 危险的组合(排列组合)

摘要：Time Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %lluSubmitStatusDescriptionDuring the early stages of the Manhattan Project, the dangers o... 阅读全文

posted @ 2015-08-20 19:12 hfcnal 阅读(431) 评论(0) 推荐(0)

uva 10820 （筛法构造欧拉函数）

摘要：sendatable When participating in programming contests, you sometimes face the following problem: You knowhow to calcutale the output for the given in... 阅读全文

posted @ 2015-08-20 15:11 hfcnal 阅读(186) 评论(0) 推荐(0)

欧几里德算法gcd及其拓展终极解释

摘要：这个困扰了自己好久，终于找到了解释，还有自己改动了一点点，耐心看完一定能加深理解扩展欧几里德算法－求解不定方程，线性同余方程。设过s步后两青蛙相遇，则必满足以下等式： (x+m*s)-(y+n*s)=k*l(k=0,1,2....) 稍微变一下形得： (n-m)*s+k*l=x-y... 阅读全文

posted @ 2015-08-20 10:53 hfcnal 阅读(599) 评论(0) 推荐(0)

第六周O题（等边三角形个数）

摘要：O -计数Time Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uDescriptionGerald got a very curious hexagon for his birthday. The boy found o... 阅读全文

posted @ 2015-08-19 22:16 hfcnal 阅读(800) 评论(0) 推荐(0)

hfcnal

Hello World

随笔分类 - ACM

公告