Live2d Test Env
2017年9月27日
ZOJ 3211dream city dp（效率优化）
摘要： JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There aren trees in the yard. Let's call them tree 1, tree 2 ...and treen. At th 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(129) 评论(0) 推荐(0)
zoj3953 Intervals 最大不重叠区间加强版 zoj排名第一~
摘要： Chiaki has n intervals and thei-th of them is [li,ri]. She wants to delete some intervals so that there does not exist three intervalsa,b andc such th 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(381) 评论(0) 推荐(0)
zoj 1874 水题，输出格式大坑
摘要： Primary ArithmeticTime Limit: 2 Seconds Memory Limit:65536 KB Children are taught to add multi-digit numbers from right-to-left one digit at a ti... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(262) 评论(0) 推荐(0)
zoj3204 connect them 最小生成树 暴力
摘要： Connect themTime Limit: 1 Second Memory Limit:32768 KBYou have n computers numbered from 1 ton and you want to connect them to make a small local... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(141) 评论(0) 推荐(0)
zoj 1526 Big Number 数学
摘要： Big NumberTime Limit: 10 Seconds Memory Limit:32768 KB In many applications very large integers numbers are required. Some of these applications ... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(172) 评论(0) 推荐(0)
zoj1797 Least Common Multiple 最小公倍数
摘要： Least Common MultipleTime Limit: 2 Seconds Memory Limit:65536 KB The least common multiple (LCM) of a set of positive integers is the smallest po... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(186) 评论(0) 推荐(0)
zoj1109 水题（大神绕道） Language of FatMouse
摘要： Language of FatMouseTime Limit: 10 Seconds Memory Limit:32768 KBWe all know that FatMouse doesn't speak English. But now he has to be prepared si... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(176) 评论(0) 推荐(0)
IBM Minus One 简单字符处理
摘要： IBM Minus OneTime Limit: 2 Seconds Memory Limit:65536 KB You may have heard of the book '2001 - A Space Odyssey' by Arthur C. Clarke, or the film... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(297) 评论(0) 推荐(0)
HDU 1219 AC Me
摘要： strlen能不用就不用#include#include#include#include#include#include#include#includeusing namespace std;char s[100010];int a[30];int main(){ int i,L; while(ge... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(159) 评论(0) 推荐(0)
Hdu 2083 简易版之最短距离
摘要： 反证法证明得到 中点 满足题意#include#include#include#include#include#includeusing namespace std;int a[600];int ans;int main(){ int T,n,i,j; cin>>T; while(T--){ an... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(144) 评论(0) 推荐(0)