数学 - 随笔分类 - magicat

2022 China Collegiate Programming Contest (CCPC) Weihai Site EAJGCI

摘要：2022 China Collegiate Programming Contest (CCPC) Weihai Site 目录2022 China Collegiate Programming Contest (CCPC) Weihai SiteVP概况E - Python Will be Fast 阅读全文

posted @ 2023-10-07 11:41 magicat 阅读(90) 评论(0) 推荐(1)

2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite GCHMAD

摘要：2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite 目录2022 China Collegiate Programming Contest (CCPC) Mianyang OnsiteVP 情况G - Let Them E 阅读全文

posted @ 2023-09-28 11:01 magicat 阅读(107) 评论(0) 推荐(0)

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 阅读全文

posted @ 2023-09-27 23:09 magicat 阅读(163) 评论(0) 推荐(0)

2022 International Collegiate Programming Contest, Jinan Site MKAEDGC

摘要：2022 International Collegiate Programming Contest, Jinan Site 目录2022 International Collegiate Programming Contest, Jinan SiteVP概况M - Best Carry Player 阅读全文

posted @ 2023-09-16 14:08 magicat 阅读(315) 评论(0) 推荐(0)

Educational Codeforces Round 6 A - E

摘要：# [Educational Codeforces Round 6](https://codeforces.com/contest/620) [TOC] ## [A - Professor GukiZ's Robot](https://codeforces.com/contest/620/probl 阅读全文

posted @ 2023-09-03 02:15 magicat 阅读(22) 评论(0) 推荐(0)

Educational Codeforces Round 23 A - F

摘要：# [Educational Codeforces Round 23](https://codeforces.com/contest/817) [TOC] ## [A - Treasure Hunt](https://codeforces.com/contest/817/problem/A) 往四个阅读全文

posted @ 2023-09-02 18:09 magicat 阅读(25) 评论(0) 推荐(0)

Educational Codeforces Round 15 A - E

摘要：# [Educational Codeforces Round 15](https://codeforces.com/contest/702) [TOC] ## [A - Maximum Increase](https://codeforces.com/contest/702/problem/A) 阅读全文

posted @ 2023-09-01 21:31 magicat 阅读(30) 评论(0) 推荐(0)

Educational Codeforces Round 5 A-E

摘要：# [Educational Codeforces Round 5](https://codeforces.com/contest/616) ![image](https://img2023.cnblogs.com/blog/2458891/202309/2458891-20230901195448 阅读全文

posted @ 2023-09-01 19:12 magicat 阅读(31) 评论(0) 推荐(0)

2023/8/9~2023/8/11 做题

摘要：# 2023/8/9~2023/8/11 做题 [TOC] ## [Codeforces Round 121 (Div. 1) C. Fools and Roads](https://www.luogu.com.cn/problem/CF191C) 树形dp + LCA 先预处理LCA，将边下放到点阅读全文

posted @ 2023-08-09 12:20 magicat 阅读(68) 评论(0) 推荐(0)

P4942 小凯的数字

摘要：[P4942 小凯的数字](https://www.luogu.com.cn/problem/P4942 "P4942 小凯的数字") 题目和数据范围提示有 $O(1)$作法。直接拆数字，会TLE $res \mod 9 = l(l + 1)(l + 2)...(r - 1)r \mod 9$ 找阅读全文

posted @ 2023-06-04 16:48 magicat 阅读(54) 评论(0) 推荐(1)

个人模板

摘要：Math & DP & Data structure & Graph & Geometry & Game 表演者: magicat 💕 nannan 目录 Math & DP & Data structure & Graph & Geometry & GameHead快读1快读2快读3模板1模板2 阅读全文

posted @ 2023-05-09 17:12 magicat 阅读(557) 评论(1) 推荐(1)

数论分块总结

摘要：AtCoder abc230_e E - Fraction Floor Sum AtCoder abc230_e Fraction Floor Sum 求: $$\sum_{i = 1}^N ⌊\dfrac{N}{i}⌋$$ 是一个很裸的数论分块 ll ans = 0; void solve() { 阅读全文

posted @ 2023-05-08 10:32 magicat 阅读(95) 评论(0) 推荐(0)

2023湖北省赛 VP 5题MCHJF + 1题K

摘要：2023湖北省赛榜单 M 解方程 void solve() { ll x,y; cin>>x>>y; bool ok = false; ll z = x * 1000 - y; for(ll a = 0; a <= 1000000; a++) { ll t = a * 1000 - z; if(t 阅读全文

posted @ 2023-05-07 20:28 magicat 阅读(83) 评论(0) 推荐(0)

湖南省第十八届大学生计算机程序设计竞赛（HNCPC2022）VP记录

摘要：随便记录下湖南省第十八届大学生计算机程序设计竞赛（HNCPC2022）官方题解 VP情况队友卡I占了机时导致罚时有点爆炸，也是策略的失误 6题837罚时补到GH就不补个位数题 J 判断斐波那契区间有没有一段的和等于$n$ 由于$n \leq 10^{15}$直接暴力即可 #include<b 阅读全文

posted @ 2023-04-17 11:35 magicat 阅读(1502) 评论(0) 推荐(0)

Educational Codeforces Round 2 个人总结A-E

摘要：Educational Codeforces Round 2 A. Extract Numbers 简单的模拟 bool check(string op) { if(op.size()==1&&op[0]=='0') return true; if(op.size()==0||(op[0]<'1'| 阅读全文

posted @ 2023-01-28 01:44 magicat 阅读(59) 评论(0) 推荐(0)

勾股数组表（10以内），数论概论习题3.1

摘要：直接两个for暴力穷举判断,观察数表发现和乘法表的数量差不多，再把数据范围扩大也是如此。留个坑（） // AC one more times #include <iostream> using namespace std; int main() { for(int v=1;v<=9;v++) { p 阅读全文

posted @ 2022-05-16 10:59 magicat 阅读(98) 评论(0) 推荐(0)

UVA10104

摘要：板子题当|X|+|Y|最小时，那么是ax+by=gcd(a,b) 输入格式乱搞，见谅 #include<iostream> using namespace std; typedef long long LL; LL exgcd(LL a,LL b,LL &x,LL &y) { if(b==0) { 阅读全文

posted @ 2022-04-21 22:11 magicat 阅读(36) 评论(2) 推荐(0)

a^b快速幂

摘要：两种写法，见代码： #include<iostream> using namespace std; int main() { int a, b, p; cin >> a >> b >> p; int ans = 1 % p; /* while (b) { if(b&1) ans = ans * 1l 阅读全文

posted @ 2021-08-15 21:33 magicat 阅读(42) 评论(0) 推荐(0)

两变量实现变量交换

摘要：a = a + b; b = a - b; a = a - b;//初次见到真是秀到我了，具体过程就自己推演吧阅读全文

posted @ 2021-08-02 12:20 magicat 阅读(45) 评论(0) 推荐(0)

随笔分类 - 数学