CygneNoir

Apache HTTP Server mod_rewrite 输出不当逃逸漏洞 CVE-2024-38475

# ShokaX Can # 开始 ShokaX 即食罐头，使用 pnpm 加热即可食用，执行下列命令： git clone https://github.com/theme-shoka-x/shokax-can --depth=1cd shokax-canpnpm installhexo s # 如果报错更换为 pnpm dlx hexo s当前内容物版本：ShokaX v0.4.11 不含 lightning-minify # 创建链接 mklink /J .\themes\shokax .\node_modules\hexo-t

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub. # Image Bed # Quick Start # Create a new post h$ hexo new "My New Post"More info: Writing # Ru

（须知此排序为使用了模拟堆，为了使最后一个非叶子节点的编号为 n/2，数组编号从 1 开始) void down(int u) { int t = u; if (u<<1 <= n && h[u<<1] < h[t]) t = u<<1; if ((u<<1|1) <= n && h[u<<1|1] < h[t]) t = u<<1|1; if (u !=

int maxbit() { int maxv = a[0]; for (int i = 1; i < n; i ++ ) if (maxv < a[i]) maxv = a[i]; int cnt = 1; while (maxv >= 10) maxv /= 10, cnt ++ ; return cnt; } void radixsort() { int t = maxbi

void counting_sort() { int sorted[N]; int maxv = a[0]; for (int i = 1; i < n; i ++ ) if (maxv < a[i]) maxv = a[i]; int count[maxv+1]; for (int i = 0; i < n; i ++ ) count[a[i]] ++ ; for (int i = 1; i <= maxv; i

void bubble_sort() { for (int i = n-1; i >= 1; i -- ) { bool flag = true; for (int j = 1; j <= i; j ++ ) if (a[j-1] > a[j]) { swap(a[j-1], a[j]); flag = false;

void insert_sort() { for (int i = 1; i < n; i ++ ) { int x = a[i]; int j = i-1; while (j >= 0 && x < a[j]) { a[j+1] = a[j]; j -- ; } a[j+1] = x;

# （基数排序是桶排序的特例，优势是可以处理浮点数和负数，劣势是还要配合别的排序函数） vector<int> bucketSort(vector<int>& nums) { int n = nums.size(); int maxv = *max_element(nums.begin(), nums.end()); int minv = *min_element(nums.begin(), nums.end()); int bs = 1000; int m =