C/C++
L1858
这个作者很懒,什么都没留下…
展开
-
LCOJ - Compare Version Numbers
Compare two version numbers version1 and version1.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and cont原创 2015-01-29 16:54:10 · 300 阅读 · 0 评论 -
LCOJ - Maximum Gap
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains less than 2 elements.Y原创 2015-01-30 22:03:39 · 416 阅读 · 0 评论 -
UVA 1594 - Ducci Sequence
// map#include using namespace std;int n;vector old,now;map,bool> m;void gen(){ for(size_t i=0;i<old.size();i++) now[i]=abs(old[i]-old[(i+1)%n]); for(size_t i=0;i<old.size();i++) old[i]原创 2015-01-31 17:10:53 · 328 阅读 · 0 评论 -
LCOJ - Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is repeating, enclose the repeating part in parentheses.For原创 2015-02-23 13:20:44 · 413 阅读 · 0 评论