zjbh89757的专栏

1013. Battle Over Cities (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIt is vitally important to have all the

1003. Emergency (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAs an emergency rescue team leader of a city, yo

1003. Emergency (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAs an emergency rescue team leader of a city, yo

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number.Now for any pair of positive

题目说明：有公共自行车网，从原点0出发到目标点sp，要把所有点的自行车数都置为half-full，找到最优路径，优先级依次为：路径长度最短，send最少，back最少。思路：最短路加dfs求最优解我先附上过了的代码，这是我在错误的思路上做了好久没全对最后妥协查了题解的代码#includeusing namespace std;const int M = 501;const int

点击打开题目链接这道题我认为很考验耐性，不审题想满分很难说，直接讲坑点。1、0 是 0.000*10^0，0.000也是02、00123.456这种有前导零的。3、整数4、k可以是负数附上烂代码#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#includ...