codeforces round sort with
无GPU环境中运行出错解决方法：AssertionError: Torch not compiled with CUDA enabled
在執行pytorch代碼的時候，突然看到報錯 AssertionError: Torch not compiled with CUDA enabled 這說明了 1. 你pytoch确实安装了 2. 你安装的是cpu版本 作为验证，你可以在python编辑器输入下列代码 如果要在无GPU环境中运行， ......
CodeForces 1895G Two Characters, Two Colors
洛谷传送门 CF 传送门 要求最大化收益加上支出，又因为每个字符有染红和染蓝两种选择，考虑最小割模型。可以看成是一开始先获得 \(r_i + b_i\) 的收益，然后对于每个 \(0\)，连边 \((S, i, b_i), (i, T, r_i)\)；对于每个 \(1\)，连边 \((S, i, r ......
gin-vue-admin 接口错误Error: Request failed with status code 500
本地运行以后登录出现： 控制台检查发现是请求getMenu出现500错误，并且后端出现"Error 1071 (42000): Specified key was too long; max key length is 1000 bytes"错误，那就是数据库casbin_rule的表引擎不是Inn ......
How to use SUM and DINSTINCT with GreenDao?
How to use SUM and DINSTINCT with GreenDao querybuilder? Ask Question Asked 7 years ago Modified 6 years, 7 months ago Viewed 1k times Part of Mobile ......
docker使用--gpus all报错: docker: Error response from daemon: could not select device driver "" with capabilities: [[gpu]].
报错信息： docker: Error response from daemon: could not select device driver "" with capabilities: [[gpu]]. 解决方法： 1，任意路径下创建nvidia-container-runtime-script ......
安装warp-transducer时cmake.. 出现 Building shared library with no GPU support的解决办法
warp-transducer A fast parallel implementation of RNN Transducer (Graves 2013 joint network), on both CPU and GPU. GPU implementation is now available ......
A Day with Pandas
I went to the Chengdu Panda Base and it was awesome! This place is where they take care of many pandas. I saw big pandas and baby pandas. They are so ......
Using Lua with Pktgen
Lua is a high level dynamic programming language. It is small and lightweight and can easily be embedded in applications written in other languages. I ......
2023-11-15 Using insecure protocols with repositories, without explicit opt-in, is unsupported. ==> Gradle不支持不安全的 Maven 仓库协议，也就是http，请改为https
前言：运行android项目报错： A problem occurred configuring root project 'xxx'.> Could not resolve all dependencies for configuration ':classpath'. > Using insec ......
Educational Codeforces Round 94 (Rated for Div. 2) D. Zigzags 题解
题意 给你一个数组 \(a1,a2…an\) 请计算有多少个四元组 \((i,j,k,l)\) 符合以下条件: \(1 <= i < j < k < l <= n\) \(a_i=a_k \ \&\&\ a_j=a_l\) \(4<=n<=3000,1<=a_i<=n\) \(input\) 2 5 ......
Elasticsearch 8.7.1 with Spring
Elasticsearch是一个基于Lucene的搜索引擎，提供了分布式、多租户的全文搜索引擎功能。它可以快速地存储、搜索和分析大量数据，适用于各种类型的应用程序，如日志分析、实时搜索等。 使用Docker启动Elasticsearch & Kibana 运行命令启动Elasticsearch do ......
CodeForces 1895E Infinite Card Game
洛谷传送门 CF 传送门 容易转化成经典的有向图博弈模型。每张牌建一个点，若 \(x\) 能打败 \(y\) 就连一条 \(x \to y\) 的边。入度为 \(0\) 的点为必败态，之后类似拓扑排序倒推即可。 具体就是若存在边 \(u \to v\)，若 \(u\) 为必败态则 \(v\) 为必胜 ......
CodeForces 1895F Fancy Arrays
洛谷传送门 CF 传送门 看到题目感觉很怪，没有什么很好的直接做的办法。于是考虑容斥，\(\min a_i \le x + k - 1\) 的方案数减去 \(\max a_i < x\) 的方案数即为答案。 前者的方案数是好算的。注意到只要确定了 \(\min a_i\) 和差分数组 \(a_i - ......
[938] How to operate with shapefiles using Geopandas
Geopandas is a Python library that makes working with geospatial data easier by extending the data manipulation capabilities of pandas to spatial data ......
Princeton Algorithms, Part I week2 Merge Sort
Merge sort 今天学习merge sort 这个排序算法的思想就是，不停的将数组二分，再将两个子数组不停归并。其中有一个操作叫merge如下图所示。左右两边两个部分是有序的，然后思想也很简单 有两个指针i和j，i指向lo，j指向mid+1，然后比较两个指针所指的大小，如果小就选出来排到数组中 ......
Codeforces Round 907 (Div. 2)
\(A. Sorting with Twos\) https://codeforces.com/contest/1891/submission/232689614 \(B. Deja Vu\) https://codeforces.com/contest/1891/submission/232690 ......
shell脚本之“sort“、“uniq“、“tr“、“cut“、“split“、“paste“以及“eval“命令详解
一、sort命令 1.1、作用 以行为单位对文件内容进行排序 也可以根据不同的数据类型来排序 1.2、语法格式 sort [选项] 参数 cat file | sort 选项 1.3、常用选项 -f∶ 忽略大小写，会将小写字母都转换为大写字母来进行比较； -b∶ 忽略每行前面的空格； -n∶ 按照数 ......
牛客周赛 Round 19
牛客周赛 Round 19 A. 小红的字符串大小写变换 题意： 小红拿到了一个仅由大小写字母组成的长度为n的字符串，她希望把前k个字母变成大写，后 n−k个字母变成小写，你能帮帮她吗？ 代码： #include <bits/stdc++.h> using namespace std ; const ......
Getting Started with Pktgen
This section contains instructions on how to get up and running with DPDK and the pktgen traffic generator application. 本节包含有关如何启动和运行 DPDK 和 pktgen 流量 ......
Codeforces Round 906 (Div. 2)
A. 简单题 B. 简单题 C. 比赛时没做出来,赶着回宿舍,过了几天来补发现很简单秒掉 D. Doremy's Connecting Plan 给定n个结点的图,每个点有一个权值a[i],开始时图上没有边,如果与点i相邻的点(包括点i)的权值的和记为Sum_i. 给定一个常数c,如果 Sum_i+ ......
Codeforces Round 809 (Div. 2) D1. Chopping Carrots (Easy Version) 题解
题意 Codeforces Round 809 (Div. 2) D1. Chopping Carrots (Easy Version) 给两个整数\(n, k\), 一个数组 \(a\), 要求构造一个同样长度的数组 \(p\), 使得 \(\max\limits_{1 \le i \le n}\ ......
nvidia-smi报错：NVIDIA-SMI has failed because it couldn't communicate with the NVIDIA driver更优解决方案
Ubuntu 18.04系统中，某次pip安装后发现这个问题，有人说是因为系统内核升级造成的，从解决方案来看，系统内核升级更可信。解决方案参考了https://blog.csdn.net/dou3516/article/details/130593616，但更简洁。解决方案是DKMS安装NVIDIA ......
WSL2报错：nvidia-smi Command ‘nvidia-smi‘ not found, but can be installed with:
找了很多方法在社区找了很多方法，结果在b站评论区找到了一个方法给解决了原本一开始有人说是驱动版本问题我nvcc -V是ok的，但是nvidia-smi一直报错，Command ‘nvidia-smi’ not found, but can be installed with: 解决cp /usr/l ......
[LeetCode] 2785. Sort Vowels in a String
Given a 0-indexed string s, permute s to get a new string t such that: All consonants remain in their original places. More formally, if there is an i ......
[LeetCode] 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge b ......
Cost Aggregation with Transformers for Sparse Correspondence-读书笔记
Cost Aggregation with Transformers for Sparse Correspondence:2022 背景: 该论文结合了SuperGlue和CATs，将里面所有手工制作的部分都代替了。将CATs引入该模型，用Transformer取代手工制作的成本聚合方法，用于具有自 ......
CodeForces 1452E Two Editorials
洛谷传送门 CF 传送门 考虑枚举其中一个区间取 \([i, i + K - 1]\)，考虑对于每个 \(j\) 一次性处理出，区间取 \([j - K + 1, j]\) 多产生的贡献（即以 \(j\) 为右端点）。 对于一个 \([l_k, r_k]\)，设其与 \([i, i + K - 1] ......
RuntimeError: The scheduler seems to be running under uWSGI, but threads have been disabled. You must run uWSGI with the --enable-threads option for the scheduler to work报错
解释 RuntimeError: The scheduler seems to be running under uWSGI, but threads have been disabled. You must run uWSGI with the --enable-threads option fo ......
A Learning Method for Feature Correspondence with Outliers读书笔记
A Learning Method for Feature Correspondence with Outliers 2022年 论文地址：A Learning Method for Feature Correspondence with Outliers | IEEE Conference Pub ......
[论文阅读] Latent Consistency Models@ Synthesizing High-Resolution Images with Few-Step Inference
1. Pre title: Latent Consistency Models: Synthesizing High-Resolution Images with Few-Step Inference accepted: arXiv 2023 (ICLR 2024 Submission) paper ......