提瓦特第一深情
提瓦特第一深情
全部文章
分类
板子(1)
题解(1)
归档
标签
去牛客网
登录
/
注册
提瓦特第一深情的博客
寻找远方的自己,追寻圈外的生命
全部文章
(共29篇)
Puzzle: Square Jam(递归)
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N =1e6+5; ll cnt=0; struct node { ll x,y,z; }; node s[N]; ll ...
C++
2023-08-14
0
113
快速幂
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll ksm(ll a,ll b) { ll ans=1; while(b) { if(b%2==1)//!b&...
C++
2023-08-07
0
28
组合数(%mod)
详见:https://oi-wiki.org/math/number-theory/linear-equation/ ll f[N],g[N],pw2[N]; ll q_pow(ll x,ll y)//快速幂 { ll ans=1; while(y) { i...
C++
2023-08-03
0
28
数据爬取,输出,绘制图标
用到的软件:Pycharm,Qtdesigner,SQLiteStudio draw.py(绘制图表): import sqlite3 import matplotlib.pyplot as plt import numpy as np class draw(): def __init__...
Python3
2023-08-02
0
43
01和完全背包问题
//01背包: 1.二维: #include<bits/stdc++.h> using namespace std; const int MAXN = 1005; int v[MAXN]; // 体积 int w[MAXN]; // 价值 int f[MAXN][MA...
C++
2023-08-02
0
28
欧拉筛
const ll N = 4e7; ll a[N]; ll b[N]; ll cnt=0; int ols(ll n) //欧拉筛 { a[0]=1; a[1]=1; ll sum=0; ll i,j; for(i=2;i<=n;i++) { if(a[...
C++
2023-07-30
0
18
排列序列
c++: #include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll n,k,a[10]; cin>>n>>k; for(ll i=1;i<=...
C++
Python3
2023-07-29
1
37
Election of the King
#include <bits/stdc++.h> using namespace std; const int N=1e6+5; int a[N],s[N]; int check(int m,int l,int r) { if(m-l<=r-m) return 1; ...
C++
2023-07-29
0
32
we are the lights
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N=1e6+5; struct node{ ll x,y,z; };// x记录行/列, y记录第几行/第几列, z记录开灯/关灯 ...
C++
2023-07-28
0
30
首页
上一页
1
2
3
下一页
末页