hong kong programming the

[CMU 15-418] (Lecture3) Parallel Programming Abstractions

本系列文章为 CMU 15-418/15-618: Parallel Computer Architecture and Programming, Fall 2018 课程学习笔记 课程官网:CMU 15-418/15-618: Parallel Computer Architecture and ......

Introducing the QCN9074: A Revolutionary New Chip for the Internet of Things

The QCN9074 is a high-performance chip designed to meet the demanding needs of the Internet of Things (IoT) market. With its powerful processing capab ......

The Bells are Ringing UVA-12119

已知M 为T1,T2,T3 的LCM 输出满足 Ti-Tj<=25 的所有可能情况 #include<iostream> #include<cmath> #include<algorithm> #include<cstring> using namespace std; const int N= 1 ......
Ringing Bells 12119 The are

java调用GDAL,接口运行一次出现A fatal error has been detected by the Java Runtime Environment,需要手动释放指针对象(DataSource)

参考文章:https://www.jianshu.com/p/4bffe29e3a02 问题描述:通过调用GDAL写的SpringBoot接口,第一次访问成功,第二次报错,显示报错的位置为gdal库。 尝试了很多方法https://www.cnblogs.com/jokingremarks/p/15 ......

check_crystal_oscillator_size_in_the_code

如何在代码里面查看晶振的大小 概述 不同晶振的类型,大小有所不同,它们适合的使用场合也有所不同。主系统时钟一般会使用大一点的晶振,这样通过倍频之后,可以轻松得到想要的主频。RTC 时钟一般使用 32.768 K 晶振。 RTC的晶振频率为什么是32768Hz? ① RTC时间是以振荡频率来计算的。故 ......

CF1819B The Butcher

题意:有一个未知大小的矩形,每次横着或者竖着剪成两块,将其中一块放入盒子里,继续对另一块进行操作,最后把剩余的也放进盒子里,现在已知盒子内的所有矩形的长和宽,问原来可能的矩形长和宽是多少(矩形没有进行旋转) Solution 比较容易想到把所有的矩形面积和加起来就是原矩形的面积了,然后找到矩形中最大 ......
Butcher 1819B 1819 The CF

C# Mysql The given key '12599' was not present in the dictionary.

如果查询语句没有问题数据库连接字符串也没有问题,可能是Mysql.Data引用与当前安装的Mysql数据库版本不兼容的问题。 我本地安装的mysql版本是8.30,在VS里使用Nuget程序包下载的Mysql.Data引用是其他更低的版本,将程序里用的Mysql.Data也更新到8.30就好了。 版 ......
dictionary present Mysql 12599 given

java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''',b_5='17',b_6='' wher

java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right s ......

Unlock the Power of High-Performance Networking with the IPQ9554

Unlock the Power of High-Performance Networking with the IPQ9554 In today's world, reliable and high-speed internet connectivity is essential for ever ......

Ray Tracing: The Next Week

2. Motion Blur 在前面,反走样是通过像素内取多个路径实现的,此外多条路径的选择也跟后面的漫反射、模糊反射、散焦模糊等一系列随机过程有关,如果继续暴力解法,也可以实现运动模糊。 在真实的相机中,照片的形成是对一段时间内光线的记录,与快门有关,因此,为了模拟摄影,加入运动模糊。 首先运动模 ......
Tracing Next Week Ray The

Linux shell script programming All In One

Linux shell script programming All In One shell 脚本编程 ......
programming script Linux shell All

The 1st Universal Cup. Stage 12: Ōokayama

G 容斥完之后发现要求一个m次多项式的n次方,并且得到$n\times m$项。 原本很sb地直接套了个多项式LnExp上去(即使知道大概率过不了),然后狂TLE。。。 其实但凡从常数的角度分析,Exp的常数有14倍,已经比$log(m)$大了,所以不如写快速幂,然后写着就会发现卷积的长度总和其实是 ......
Universal okayama Stage The 1st

Leader of the Opinion Leaders

题目 Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. According to ......
Opinion Leaders Leader the of

The Second Run of Quicksort

代码 #include<iostream> #include<vector> #include<cstdio> using namespace std; const int maxn = 100010; vector<int> sequence; int maxL, minR, cnt, k, n, ......
Quicksort Second The Run of

D. Solve The Maze

D. Solve The Maze 大意:建墙让所有好人可以到达坐标$(n,m)$,任何一个坏人都不能到达坐标$(n,m)$ 分析: 把坏人直接关起来,在坏人的四面建墙, 统计好人的人数 从坐标$(n,m)$去遍历,整个地图,看能不能遇到所有好人 3可以通过dsu, flood-fill等去做吧 细 ......
Solve Maze The

How fast are your disks? Find out the open source way, with fio

https://arstechnica.com/gadgets/2020/02/how-fast-are-your-disks-find-out-the-open-source-way-with-fio/ Storage benchmarking—much like Wi-Fi benchmarki ......
source disks Find fast your

docker报错,ERROR: Got permission denied while trying to connect to the Docker daemon socket

使用docker,避免使用sudo命令 1.本地环境是Ubuntu18.04,docker version 19.03.12 以普通用户启动docker时,会报一下错误 Got permission denied while trying to connect to the Docker daemo ......
permission connect docker Docker denied

文章推荐---ChatGPT踩坑(too many signups from the same IP)

http://681314.com/A/S1A6pDeCNF 这个文章里关于注册写得不错,需要注意的地方有两点。 第一,最好在港澳台地区或类型的地方访问提供的网站,不然无法登录 第二,虚拟短信号码,最好选大国的,小国的我没收到 ......
ChatGPT signups 文章 many from

some information about the origin of the OPT folder

In the old days, "/opt" was used by UNIX vendors like AT&T, Sun, DEC and 3rd-party vendors to hold "Option" packages; i.e. packages that you might hav ......
information the folder origin about

【题解】[ABC248G] GCD cost on the tree

「八云紫」无数次痛苦地询问,为什么我们还活着? ……而「古明地恋」从不会回答。 恋恋闭上了觉之眼。 思路 容斥 + dp. $\gcd$ 相关,考虑 $\mu$ 反演或者 $\varphi$ 反演。 本质上都和容斥差不多,不如直接一步到位考虑容斥。 把权值拆成 $\gcd$ 和对应的方案数两部分,考 ......
题解 248G cost tree ABC

Uva--122 Trees on the level(二叉树的层次遍历)

记录 23:27 2023-4-20 https://onlinejudge.org/external/1/122.pdf reference:《算法竞赛入门经典第二版》例题6-7 二叉树的层次遍历,这里是直接复制了作者的代码。(之前在我的数据结构学习里面手写过树、二叉树、AVL树(说是手写,其实也 ......
层次 Trees level Uva 122

The Second Type of Uncertainty in Monte Carlo Tree Search

**发表时间:**2020 **文章要点:**MCTS里通常通过计算访问次数来做探索,这个被称作count-derived uncertainty。这篇文章提出了第二种uncertainty,这种uncertainty来源于子树的大小,一个直觉的想法就是,如果一个动作对应下的子树小,那就不用探索那么 ......
Uncertainty Second Search Monte Carlo

1094 The Largest Generation

A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find t ......
Generation Largest 1094 The

Find the sum of the series : 1.n + 2.(n – 1) + 3.(n – 2) + ….. + (n – 1).2 + n.1.

https://www.vedantu.com/question-answer/find-the-sum-of-the-series-1n-+-2n-1-+-3n-2-+-+-class-11-maths-cbse-5f34d4da5597f32583a5adca ......
the series Find sum of

Git提交时提示The file will have its original line endings in your working directory的解决方法

同事新建了一个仓库,git add的时候总是会提示 warning: LF will be replaced by CRLF in public/tinymce/README.md.The file will have its original line endings in your workin ......
directory original endings working 方法

Unlock the Power of High-Performance Networking with the IPQ9554

In today's world, reliable and high-speed internet connectivity is essential for everything from online gaming and streaming to remote work and learni ......

Arrange the Numbers UVA - 11481

求 1∼n 的排列 A 中,满足前 m 个数中,刚好有 K 个数使得 A[ i ]=i 的 AA 的个数。 错位排列 #include<bits/stdc++.h> using namespace std; const int mod=1e9+7; #define int long long int ......
Arrange Numbers 11481 the UVA

升级 .net 6后 The view 'Index' was not found. The following locations were searched

升级.net6之后Razor页面出现找不到view的情况,原因是.net6默认移除了一些依赖包,如下完美解决web工程添加包Microsoft.AspNetCore.Mvc.Razor.RuntimeCompilationstartup.cs里面加上Compilation引用builder.Serv ......
The following locations searched Index