04 2019 档案
摘要:1007 Maximum Subsequence Sum (25 分) 1007 Maximum Subsequence Sum (25 分) 1007 Maximum Subsequence Sum (25 分) Given a sequence of K integers { N1, N
阅读全文
摘要:灯塔(LightHouse) 灯塔(LightHouse) Description As shown in the following figure, If another lighthouse is in gray area, they can beacon each other. For exa
阅读全文
摘要:This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occu
阅读全文
摘要:由于采用python3.7安装会出现各种问题,两种解决方法。 1)安装Cmake boost等(不推荐,麻烦且不容易成功)。 2)安装Anaconda,创建一个python3.6的环境。 这里使用第二种。 一、安装Anaconda 。 方法就不做过多阐述了,网上一大堆,且安装过程很快。 二、启动An
阅读全文

浙公网安备 33010602011771号