paper 653f task cf
Proj CDeepFuzz Paper Reading: Testing Deep Neural Networks
## Abstract 本文:DeepCover Github: https://github.com/TrustAI/DeepCover Task: propose 4 novel test criteria to test DNNs Method: inspired by MC/DC cover ......
Proj CDeepFuzz Paper Reading: TensorFlow: a system for Large-Scale machine learning
## Abstract 本文:Tensorflow Github: https://github.com/tensorflow/tensorflow Task: Detail on Tensorflow dataflow model 特点: 1. operates at large scale an ......
Proj CDeepFuzz Paper Reading: SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks
## Abstract 本文：SparseProp Github: https://github.com/IST-DASLab/sparseprop Task: a back-propagation algo for sparse training data, a fast vectorized i ......
Proj CDeepFuzz Paper Reading: PyTorch: an imperative style, high-performance deep learning library
## Abstract 本文： PyTorch Task: detail the implementation and architecture of PyTorch Github: https://github.com/pytorch/pytorch 特点： 1. PyTorch同时关注可用性和速 ......
Proj CDeepFuzz Paper Reading: Software Testing with Large Language Model: Survey, Landscape, and Vision
## Abstract 本文: Task: Review on the use of LLMs in software testing Method: 1. analyzes 52 relevant studies ## 1. Intro  [翻译](https://www.luogu.com.cn/problem/CF1266D) 其实这题的翻译反而不如原题好理解，建议先阅读原题后重新思考做法 $$ \large{\color ......
CF 1860 C【最大上升子序列】
## [C. Game on Permutation](https://codeforces.com/contest/1860/problem/C) 这道题需要求出**先手必胜**点 通过分析可知，每个位置结尾的最大上升子序列长度为**2**的点为先手必胜点，**≥3**的点为先手必败点。即只需要求 ......
CF 1860 B
## [Fancy Coins](https://codeforces.com/contest/1860/problem/B) 这道题使用贪心。 先使用***a1***个常规硬币，补足**m%k**的金额，不够的使用花色硬币补上，并最大化***a1***硬币的价值。再计算剩余需要价值为**k**的硬 ......
CF 1860 A
## [A. Not a Substring](https://codeforces.com/contest/1860/problem/A) 这道题为简单构造题 只需要考虑给出的字符串***s***是否为“**()**”的必要组成成分 * 若是则无法生成，输出NO。 * 不然就判断给出的字符串*** ......
Proj CDeepFuzz Paper Reading: PELICAN: Exploiting Backdoors of Naturally Trained Deep Learning Models In Binary Code Analysis
## Abstract 背景： 1. 本文研究的不是被恶意植入的后门，而是products of defects in training 2. 攻击模式: injecting some small fixed input pattern(backdoor) to induce misclassifi ......
Proj CDeepFuzz Paper Reading: Decompiling x86 Deep Neural Network Executables
## Abstract 本文: BTD github: https://github.com/monkbai/DNN-decompiler/ Task: a decompiler for DNN models to output DNN specifications including: opera ......
CF893F
# CF893F 首先，我们发现，这个题只需要子树内的答案，且只需要维护最小值。 注意到对于两个点 $i,j$，若 $dep_i>dep_j$，且 $val_i\ge val_j$，则对于 $lca(i,j)$ 及其它的父亲，$i$ 都是一个无用的点。 注意到 $n\le 10^5,m\le 10^ ......
CF1054C Candies Distribution
[原题](https://codeforces.com/problemset/problem/1054/C) [翻译](https://www.luogu.com.cn/problem/CF1054C) $$ \large{\color{#ff0000}{\text{被xjk搏杀了，%%%}}} $ ......
CF1374E2 Reading Books(hard version) 题解
# CF1374E2 Reading Books(hard version) 这道题是在 [CF1374E1 Reading Books(easy version)](https://www.luogu.com.cn/problem/CF1374E1) 的基础上出的，而且仅仅增加了一个 $m$ 的限 ......
百万级数据导入(hyperf+xlswriter+task+websocket)
需要实现的功能：1、导入 excel 文件，10w 条数据或者更多2、进行入库操作可能涉及多张表需要进行多表数据校验（updateOrCreate）需要保证多张表数据一致 (transaction)3、前端实时显示入库进度 实现思路：将数据进行分块然后分配到不同进程进行数数据库导入操作，每个 tas ......
[题解] CF1328E Tree Queries
# CF1328E Tree Queries ## 题意 给定一棵以 $1$ 为根节点的有根树。 现在有 $q$ 次询问，每次询问给定 $m$ 个节点，问是否存在一条从根节点开始的链，使得每个节点到这条链的距离不超过 $1$ 。 ## 思路 我们首先可以给出一个结论：如果节点 $v$ 与一条链的距离 ......
Proj CDeepFuzz Paper Reading: Balancing Effectiveness and Flakiness of Non-Deterministic Machine Learning Tests
## Abstract 背景：In fact, some of the latest findings suggest that the existence of adversarial attacks may be an inherent weakness of deep learning mod ......
Proj CDeepFuzz Paper Reading: NeuRI: Diversifying DNN Generation via Inductive Rule Inference
## Abstract 背景：The correctness of DL systems is crucial for trust in DL applications 本文: NeuRI BaseTool: FreeFuzz Github: https://github.com/ise-uiuc/ ......
Proj CDeepFuzz Paper Reading: Natural attack for pre-trained models of code
## Abstract 背景：目前大多数的adversarial attack method on pre-trained models of code忽略了perturbations should be natural to human judges(naturalness requirement ......
Proj CDeepFuzz Paper Reading: COMET: Coverage-guided Model Generation For Deep Learning Library Testing
## Abstract 背景：已有的方法(Muffin, Lemon, Cradle) can cover at most 34.1% layer inputs, 25.9% layer parameter values, and 15.6% layer sequences. 本文：COMET Gi ......
CF1835 题解
# CF1835 题解 ### A 考虑到 $a,b,c > 3$ 的最多只有 $5$ 个，可以直接循环枚举 $A$ 。首先将 $B$ 取到最小值，然后判断 $C$ 是否达到了最小值，如果没有就将 $B$ 和 $C$ 同时补齐。此时特判如果 $C$ 大于上限（就是 $\geq 10^{c}$ ），就 ......
9.6 CF1830 题解
# 9.6 CF1830 题解 ## A. Copil Copac Draws Trees [链接](https://www.luogu.com.cn/problem/CF1830A) 真弱智题不用讲 ## B. The BOSS Can Count Pairs ### 题意 每组数据给你一个 $n ......
Proj CDeepFuzz Paper Reading: IvySyn: Automated Vulnerability Discovery in Deep Learning Frameworks
## Abstract 本文：IvySyn Task: discover memory error vulnerabilities in DL frameworks BugType: memory safety errors, fatal runtime errors Method: 1. 利用na ......
CF665F
[题目链接](https://codeforces.com/problemset/problem/665/F) ## description 给定 $n\leq 10^{11}$ 求 1 到 $n$ 中恰有 4 个因数的数的个数。 ## solution 这个数据范围容易想到筛子。 题目相当于让求 ......
CF1036F
[题目链接](https://codeforces.com/problemset/problem/1036/F) ## description $10^5$ 次询问 每次给定 $n\leq 10^{18}$, 求 2 到 $n$ 内质因子分解结果为 $p_{a_1}^{b_1}p_{a_2}^{b_ ......
CF1174E
[题目链接](https://codeforces.com/problemset/problem/1174/E) ## description 给定 $n\leq 10^6$, 求有多少个 $1$ 到 $n$ 的排列，对于一个 1 到 $n$ 的排列 $p$，$f(p)$ 表示 $p$ 的任意前缀内 ......