shadow the dog and

[Linux] Compile and Build h5py with MPI

How to Install H5PY-MPI 0. Preparation linux system gcc anaconda/miniconda 1. Install open-mpi Go to "https://www.open-mpi.org/software/". Download th ......
Compile Linux Build h5py with

结对项目——实现一个自动生成小学四则运算题目的命令行程序—陈泽瀚and林桂旭

软工作业3:结对项目:实现一个自动生成小学四则运算题目的命令行程序 作业属于课程 课程首页 - 计科21级1班 - 广东工业大学 - 班级博客 - 博客园 作业要求 个人项目-作业2- 计科21级1班 - 广东工业大学 - 班级博客 - 博客园 这个作业的目标 实现一个自动生成小学四则运算题目的命令 ......
四则 自动生成 题目 命令 小学

pip安装包报错:PS C:\Users\Administrator\Desktop> pip install request ERROR: Could not find a version that satisfies the requirement request (from versions: none)

PS C:\Users\Administrator\Desktop> pip install requestERROR: Could not find a version that satisfies the requirement request (from versions: none)ERRO ......

The Out-of-Memory Syndrome, or: Why Do I Still Need a Pagefile?

The Out-of-Memory Syndrome, or: Why Do I Still Need a Pagefile? July 19, 2016 aziusMemory Management 13 Comments Windows’ memory management—specifical ......
Out-of-Memory Syndrome Pagefile Memory Still

lvalue and rvalue

lvalue and rvalue 好用的工具 写在前面 如何记住 排 列 组 合 ? 那如何区分这些东西呢? const int& int& const int const & const …… What is a lvalue and what is an rvalue? Awsome vide ......
lvalue rvalue and

qoj6735. Tree (The 1st Universal Cup. Stage 22: Shaanxi)

https://qoj.ac/contest/1287/problem/6735 考虑定一个根,然后把每个点的点权附属在父边权上,让每条边的边权变成一个 pair。 这样,一个符合条件的路径需要满足的条件是:路径内所有边的边权 pair 相同,以及 路径根节点(lca)的颜色符合。 对于当前树上每个 ......
Universal Shaanxi Stage 6735 Tree

Snapshot appears to have been created more than one day into the future!

Snapshot appears to have been created more than one day into the future! Raspberry PI 4b上安装freebsd13.2 aarch系统后,使用ssh链接,输入portsnap fetch extract命令,提示: ......
Snapshot appears created future have

The 2021 China Collegiate Programming Contest (Harbin) JBEIDG

The 2021 China Collegiate Programming Contest (Harbin) 目录The 2021 China Collegiate Programming Contest (Harbin)VP概况J - Local MinimumB - Magical Subseq ......
Programming Collegiate Contest Harbin JBEIDG

[AGC012E] Camel and Oases

Camel and Oases 不难发现对于某个 V,一个点扩展出去的一段区间内所有点的区间相同。 故对于 v,\(\lfloor \frac{v}{2}\rfloor\),\(\lfloor\frac{\lfloor \frac{v}{2}\rfloor}{2}\rfloor\)...1,预处理 ......
Camel Oases 012E AGC 012

Gym 104172 The 2023 ICPC Asia Hong Kong Regional Programming Contest (The 1st Universal Cup, Stage 2Hong Kong)

A. TreeScript 令 \(f_u\) 表示 \(u\) 及 \(u\) 子树中的节点都创建的最小数量。 如果 \(u\) 只有一个儿子,那么可以将子树最后一个节点存储在当前的 \(u\) 中,答案就是 \(f_v\)。 若 \(u\) 有多个儿子: 令 \(t=\max\limits_{v ......
Hong Kong Programming The Universal

连接正负极Connection of positive and negative poles

不要把物理公式看作数学公式,请也尊重自然的经验法则。 Don't see the physical formulas as mathematical formulas, please also respect the experience rules of nature. 连接正负极 Connect ......
正负 Connection negative positive poles

CS61A: Structure and Interpretation of Computer Programs 笔记

Functions Environment Diagrams:左侧为 Frames,右侧为 Objects。 Name 类似变量名,它们存储在 Frame 中,指向各种各样的 Objects,比如值或函数。一个 Name 同时只能指向一个 Object,但可以改变自身指向,不受“类型”影响(Name ......

Docker|--E: gnupg, gnupg2 and gnupg1 do not seem to be installed, but one of them is required for this operation

错误 apt-key adv --keyserver keyserver.ubuntu.com --recv-keys 871920D1991BC93C E: gnupg, gnupg2 and gnupg1 do not seem to be installed, but one of them ......
gnupg installed operation required Docker

SQL注入 --【过滤or(包含information、orderby这种也寄了)和and的类型】

来自: [SWPU2019]Web1 详见博客: https://blog.csdn.net/plant1234/article/details/124205120 payload如下: 查看行数 1'/**/group/**/by/**/1,'1 ...... 直到 1'/**/group/**/ ......
information orderby 类型 SQL and

Wi-Fi Basic PHY and MAC

总体架构 Architecture Wi-Fi 网络的网络拓扑 首先我们从下面这张图来了解一下 Wi-Fi 网络的网络拓扑 BSS Basic Service Set 基本服务集是 802.11 网络的基本组件 building block。每个 BSS 基本服务集都一个唯一的标识,称为 BSSID ......
Wi-Fi Basic PHY MAC and

[892] Change the background color of a table in a Word document

ref: python-docx Changing Table Cell Background Color. To change the background color of a table in a Word document using Python, you can use the pyth ......
background document Change color table

How to get the original size of an image using JavaScript All In One

How to get the original size of an image using JavaScript All In One 如何使用 JavaScript 获取一个图片像的原始大小 naturalWidth & naturalHeight aspect ratio / 纵横比 ......
JavaScript original image using size

Codeforces Round 738 (Div. 2) A. Mocha and Math

给一个数组 \(a_1, a_2, \cdots, a_n\) 。可以执行以下操作任意次: 选择 \(l, r (1 \leq l < r \leq n)\) ,对于任意 \(l \leq i \leq r\) ,同时执行所有 \(a_{l + i} = a_{l + i} \& a_{r - i} ......
Codeforces Round Mocha Math 738

Anton and School - 2题解

2023-09-26 题目 难度&重要性(1~10): 题目来源 luogu 题目算法 组合数学 解题思路 前置知识 范德蒙德卷积公式:\(\sum\limits_{i=0}^kC_{n}^{i}\times C_{m}^{k-i}=C_{n+m}^k\)。 至于证明请看此篇文章。 Sol 我们这道 ......
题解 School Anton and

Codeforces Round 738 (Div. 2) B. Mocha and Red and Blue

给一个字符串,包含字符 \(B\) , \(R\) ,\(?\) 。其中 \(?\) 可能为 \(B\) 或 \(R\) 。 规定不完美数为字符串中相同字符连续出现的次数,询问一个字符串的最少可能不完美数。 观察到 \(BR\) 或 \(RB\) 需要尽可能多,于是考虑尽可能让相邻字符不同。 容易证 ......
Codeforces and Round Mocha Blue

Codeforces Round 750 (Div. 2) B. Luntik and Subsequences

给一个数组 \(a_1, a_2, \cdots, a_n\) ,定义 \(s = \sum_{i = 1}^{n} a_i\) 。 询问有多少个 \(a\) 的子序列满足 \(\sum a_{i_k} = s - 1\) 。 显然要选出一个 \(1\) 不加入子序列,任意一个 \(0\) 可以加入 ......
Subsequences Codeforces Luntik Round 750

Knights of the Round Table

prologue 相信很多人都感觉这个题不就是求一下这个二分图的最大独立集嘛,有什么难的,(劈里啪啦、库里跨啦、叮里哐啷)好,不对,好好好,题解! analysis 这个题目实际上并不是一个完整的最大独立集问题,因为在这个题里面,是可以有相互仇恨的骑士的,只要不让他们二人坐成同桌就行。 那么我们就不 ......
Knights Round Table the of

ERROR: Could not find a version that satisfies the requirement selunium (from versions: none)

错误信息 ERROR: Could not find a version that satisfies the requirement selenium (from versions: none) ERROR: No matching distribution found for selenium ......

[LeetCode] 2582. Pass the Pillow

There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holdin ......
LeetCode Pillow 2582 Pass the

「解题报告」The 1st Universal Cup. Stage 3: Poland

大概按难度排序。签到题没写。 QOJ M. Minor Evil 有 \(n\) 个球与 \(k\) 个操作,初始所有球都是白色的。第 \(i\) 个操作为如果 \(a_i\) 是白色的,那么就将 \(b_i\) 染成黑色,否则什么都不做。你可以选择每个操作执行或不执行,但是不能改变操作之间的相对顺 ......
Universal 报告 Poland Stage The

[888] How to get the directory of the current Python file

To get the directory of the current Python file, you can use the os.path module in combination with the __file__ attribute. Here's how you can do it: ......
directory the current Python file

VSCode 安装插件 Unity 后,一直弹 The .NET Core SDK cannot be located

如题。 明明已经安装了.Net 7.0。并且添加到了 PATH 中。 (也就是在 终端/CMD 可以通过 dotnet 命令访问到。) 但 Vscode 还是一直弹 The .NET Core SDK cannot be located。 然后开始下载 .Net7.0。 解决方案 写在了 .NET ......
插件 located VSCode cannot Unity

CF1106D Lunar New Year and a Wander 题解

CF1106D 题解 暑期学校军训第一天模拟赛的题,相对而言比较简单 题意: 题意其实很简单,就是有一个无向图,需要你从\(1\)号节点出发,然后一次遍历所有的点,输出其中字典序最小的遍历 思路 说说思路吧,这题既然要遍历图上所有点,那首先就会想到 \(\texttt{BFS}\) 或 \(\tex ......
题解 Wander 1106D Lunar 1106

The 2023 ICPC Asia Regionals Online Contest (2) MDIELK

The 2023 ICPC Asia Regionals Online Contest (2) MDIELK M Dirty Work 题意:总共有\(n\)个问题,对于第\(i\)个问题需要\(a_i\)分钟。你可以随便选择一个没过的题去写,写完以后马上交,你有\(p_i\)的概率会错,错了不能跳 ......
Regionals Contest Online MDIELK 2023

The 2nd Universal Cup. Stage 2- SPb

A. Mixed Messages dp[i][j]表示前i位,选择\(j\)个移动到一起的最小花费。 #include<bits/stdc++.h> using namespace std; #define int long long constexpr int inf = 1E9; int32_ ......
Universal Stage The 2nd Cup