随笔分类 -  Math

LC 1735. Count Ways to Make Array With Product
摘要：link class Solution { public: #define LL long long const int mod=1E9+7; int c[10015][15]; vector<int> waysToFillArray(vector<vector<int>>& queries) { 阅读全文
posted @ 2021-01-25 21:37 feibilun 阅读(86) 评论(0) 推荐(0)
LC 1569. Number of Ways to Reorder Array to Get Same BST
摘要：link class Solution { public: #define LL long long const int mod=1E9+7; vector<vector<LL>> table; int numOfWays(vector<int>& nums) { int n=nums.size() 阅读全文
posted @ 2020-08-30 17:10 feibilun 阅读(272) 评论(0) 推荐(0)
LC 1401. Circle and Rectangle Overlapping
摘要：link 解法： 找离圆心最近的矩形上的点，比较此点到圆心的距离和半径。 class Solution { public: bool checkOverlap(int radius, int x_center, int y_center, int x1, int y1, int x2, int y2 阅读全文
posted @ 2020-04-05 09:35 feibilun 阅读(278) 评论(0) 推荐(0)
P2613 【模板】有理数取余
摘要：link 题解可参考：https://www.luogu.com.cn/blog/cicos/solution-p2613# int a,b; const int mod=19260817; int x,y; int getint(){ char c=getchar(); int res=0; wh 阅读全文
posted @ 2020-03-29 17:37 feibilun 阅读(150) 评论(0) 推荐(0)
P1082 同余方程
摘要：link 题解可参考：https://www.luogu.com.cn/blog/cicos/solution-p1082# #include <bits/stdc++.h> # define LL long long using namespace std; LL a,b; LL x,y; voi 阅读全文
posted @ 2020-03-29 17:11 feibilun 阅读(114) 评论(0) 推荐(0)
P1226 【模板】快速幂||取余运算
摘要：link #include <iostream> # define LL long long using namespace std; LL b; LL p,k; int main(){ scanf("%lld%lld%lld", &b, &p, &k); LL d=p; LL ans=1; LL 阅读全文
posted @ 2020-03-14 15:14 feibilun 阅读(130) 评论(0) 推荐(0)
P6057 [加油武汉]七步洗手法
摘要：Link Solution: ans=sum of total triangles - sum of triangles with different colors Define the angle with different edge as D-angle. Consider triangles 阅读全文
posted @ 2020-02-11 12:23 feibilun 阅读(323) 评论(1) 推荐(0)