m0_48711099的博客

高斯消元、列主元，LU分解

欧拉法，预估—校正公式

雅可比迭代、高斯—赛德尔迭代、松弛迭代

数值积分

牛顿插值

拉格朗日插值

3532. 热河路#include<bits/stdc++.h>using namespace std;int main(){ int T,num0=0,a; cin>>T; long long n=1; unordered_map<long long,int>mapp; while(n<pow(10,9)){ mapp[n]=1; n+=num0+1; num0++; } while(T--){ cin>>a;

3245. 找数#include<bits/stdc++.h>using namespace std;int main(){ int T,caseNum=0; cin>>T; while(T--){ string s; cin>>s; int len=s.length(),flag=0; for(int i=0;i<len-1;++i){ while(s[i]>s[i+1]){ s[i]=s[i]-1;

1111. 数塔#include<bits/stdc++.h>using namespace std;const int MAXN=101;int a[MAXN][MAXN],dp[MAXN][MAXN];int main(){ int T; cin>>T; while(T--){ int n; cin>>n; fill(a[0], a[0] + 101 * 101, 0); fill(dp[0], dp[0] + 101 *

2857. 编辑距离#include<bits/stdc++.h>using namespace std;int main(){ int T; cin>>T; while(T--){ string s1,s2; cin>>s1>>s2; s1=' '+s1; s2=' '+s2; int n=s1.length(),m=s2.length(); int dp[n][m]={0}; for(int i=0;i<n;

3302. 打印#include<bits/stdc++.h>using namespace std;int main(){ int n,x,y; cin>>n>>x>>y; //插入或删除一个字符为x，复制当前整个文本为y vector<long>dp(n+1); dp[1]=x; for(int i=2;i<=n;++i){ if(i%2==0)dp[i]=min(dp[i/2]+y,dp[i-1]+x)

3650. 转机折扣#include<bits/stdc++.h>using namespace std;int main(){ string s,t; cin>>s>>t; if(s>t)swap(s,t); int len=s.length(); for(int i=len-1;i>=0;--i){ if(s[i]<'Z') { s[i]=s[i]+1; for(int j=i+1;j<len;j++){

2973. 卡片游戏#include<bits/stdc++.h>using namespace std;vector<int> a;int max_sum,m,n;void dfs(int index,int depth,int sum){ //index已经判断过的 if(depth==3) { max_sum=max(max_sum,sum); return; } if(sum<m&&depth<3){ for(in

70. 十六进制#include<bits/stdc++.h>using namespace std;int main() { string s; cin>>s; int start=0,cnt=0,len=s.length(); while(s.find("0x",start)!=string::npos){ //找得到0x开头的子串 int temp=s.find("0x",start)+2,res=0;

3033. 删除子串#include<bits/stdc++.h>using namespace std;int main() { int n,caseNum=0; cin>>n; while(n--){ string s,s0,repl; cin>>s>>s0; int start=0,len0=s0.length(),len=s.length();

1163. 易于执行的 DP#include<bits/stdc++.h>using namespace std;const int MAXN=100000;vector<int> weight;vector<bool>visit;int diff,n,W; //最小差值，饼干总数, 饼干总重量void dfs(int index,int wTemp){ //wTemp为此时一方的饼干重量 diff=min(diff,ab

#include <iostream>using namespace std;int main(){ int T,caseNum=0; cin>>T; while(T--){ string s1,s2,s; cin>>s1>>s2>>s; int res; int first_last=s.find(s1)+s1.length()-1;

3446. 骰子点数之和问题#include<bits/stdc++.h>using namespace std;vector<double>dp(100000);double probability(int n, int k){ //返回n个骰子同时扔后点数之和为k的概率 if(k<n) return 0; else return (double)dp[k]/pow(6,n);}int main() { int n, k; sc

3531. 定西#include<bits/stdc++.h>using namespace std;int main() { int n,k,temp; cin>>n>>k; vector<bool> stairs(k+1,true); for(int i=1;i<=k;++i){ cin>>temp; stairs[temp]=false; } vect

C: Easy Sort#include <algorithm>#include <string.h>#include <iostream>#include <vector>using namespace std;int subtract(string s1,string s2){ if(s1[0]=='-'&&s2[0]!='-') return -1; //s1比s2小 else if(s2[0]=='-'.

B: LOGO#include <cmath>#include <iostream>using namespace std;void painting(int order,int len){ if(order==0) { if(len!=0) printf("FD 1/%d\n",(int)pow(3,len)); else printf("FD 1\n"); return; } painting(or

2974. 统计单词个数#include <iostream>using namespace std;int main(){ string a[6]={"the","a","an","of","for","and"}; int n,caseNumber=0; cin>>n; getchar(); while(n--){ string s,t; int cnt=0; getline(cin,

小迷妹在哪儿选择相同迷妹的情况下，交换任意两个小迷妹的顺序可以列不等式证明性价比高的先找更优#include <algorithm>#include <iostream>#include <vector>using namespace std;struct fan{ int score; int time;};bool cmp(fan a,fan b){ //按性价比排序 return a.score*b.

湖计数#include <iostream>using namespace std;const int MAXN=100+5;int n,m,cnt=0;char s[MAXN][MAXN];void dfs(int x,int y){ s[x][y]='.'; for(int x0=-1;x0<=1;++x0){ for(int y0=-1;y0<=1;++y0){ int tx=x+x0;

无处不在的宗教#include <iostream>#include <set>#include <vector>using namespace std;int n,m,caseNumber=0;const int MAXN=50000+5;vector<int>stu(MAXN);vector<int>height(MAXN);int findFather(int x){ if(x!=stu[x]) stu[x]=fin

#include <iostream>#include <algorithm>#include <vector>#include <math.h>using namespace std;//动态规划 构建一个二维数组 dp[i][target] 表示从0到达i的时候 能否构建成和为target的真假值 void judge(int sum,vector<int>& weight,vector<int>&tar

#include <iostream>#include <vector>#include <math.h>using namespace std;int main() { int n,s,k=1; //n序列长度，s序列和限制，a首项，b乘数 long long a,b; cin>>n>>s>>a>>b; vector<long long> sequence(n);

#include <iostream>#include <algorithm>#include <math.h>using namespace std;long long gcd(long long a,long long b){ if(b==0) return a; else return gcd(b,a%b);}int main() { long long a,b; cin>>a>>b; lo

#include <iostream>using namespace std;const int MAXN=500+10;bool Matrix[MAXN][MAXN]={false};int main() { int n,r,c,k,cnt=0; //矩阵的行数、列数、矩阵1的个数、含有k个1 cin>>n>>r>>c>>k; for(int i=0;i<n;++i){ int.

#include <iostream>using namespace std;int main() { int n; cin>>n; getchar(); for(int i=0;i<n;i++){ string s,t,temp; getline(cin,s); getline(cin,t); int cnt=0; for(int j=0;j<s.leng

3124. 单词表#include <iostream>#include <set>using namespace std;int main() { int n; cin>>n; getchar(); //3后面的换行符 for(int i=0;i<n;i++){ string s,t; //t保存单词 set<string> st;