webdav 安装软件 1sudo apt-get install davfs2 如果是使用坚果云，修改配置文件/etc/davfs2/davfs2.conf,在文件尾加上’ignore_dav_header 1’ 来源 挂载 1sudo mount -t davfs https://dav.jianguoyun.com/dav/ /mnt/webdav/ 查看 1ls /mnt/webdav 为了长期使用 2019-06-22
知识图谱若干软件的安装教程 假设我们要把软件们安装在$HOME/KG/目录下。 12mkdir ~/KGcd ~/KG 下载文件执行 123wget https://github.com/downloads/d2rq/d2rq/d2rq-0.8.1.tar.gzwget https://mirror.tuna.tsinghua.edu.cn/apache/jena/binaries/apache-jena-3.10.0.z 2019-02-22 教程
Connect-Three http://codeforces.com/contest/1087/problem/C The Squareland national forest is divided into equal 1×1 square plots aligned with north-south and east-west directions. Each plot can be uniquely describe 2018-12-24 ACM
UPCOJ-8018-hongkong 时间限制: 1 Sec 内存限制: 128 MB 题目描述123456789101112申生在内而亡，重耳在外而安。考虑k+1个数组a[i](0≤i≤k)。为了方便起见，每个数组a[i]长度为n，下标从1开始。（直观来说就是第一维下标从0开始，第二维下标从1开始。）其中a[i]时时刻刻是a[i−1](1≤i≤k)的前缀和。前缀和就是a[i][1]=a[i−1][1]且a[i][j]=a[i][j 2018-07-13 ACM
任其崩溃思想在爬虫中的应用 一个同学的项目需要一些网站的首页的截图，网站数量大概有几千个，这么多的网站当然要用爬虫去爬了 百度出来一个看起来靠谱的方法，用了selenium库，例程如下： 1234567from selenium import webdriver url = "http://baidu.com"picName = "baidu.png" brower=webdriver 2018-06-24 随笔
T-shirt 时间限制: 1 Sec 内存限制: 64 MB 题目描述JSZKC is going to spend his vacation!His vacation has N days. Each day, he can choose a T-shirt to wear. Obviously, he doesn’t want to wear a singer color T-shirt since ot 2018-06-06 ACM
Polyline-Simplification 时间限制: 5 Sec 内存限制: 128 MB 题目描述Mapping applications often represent the boundaries of countries, cities, etc. as polylines, which are connected sequences of line segments. Since fine details have to be 2018-04-25 ACM
Copy-and-Submit-II 题目链接 https://nanti.jisuanke.com/t/26220 Description:12345678910111213141516171819202122232425// Q.cpp#include <iostream>using namespace std;const long long M = 1000000007;const long long MAXL = 2018-04-22 ACM
哥德巴赫猜想 题目链接 https://nanti.jisuanke.com/t/25985 Description:Goldbach’s conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states: Every even integer g 2018-04-22 ACM
Hopscotch 时间限制: 5 Sec 内存限制: 128 MB 题目描述You’re playing hopscotch! You start at the origin and your goal is to hop to the lattice point (N, N). A hop consists of going from lattice point (x1, y1) to (x2, y2), wh 2018-04-21 ACM