【算法笔记自学】第 5 章 入门篇(3)——数学问题

5.1简单数学

#include <cstdio>
#include <algorithm>
using namespace std;
bool cmp(int a,int b){return a>b;
}
void to_array(int n,int num[]){for(int i=0;i<4;i++){num[i]=n%10;n /=10;}
}
int to_number(int num[]){int sum=0;for(int i=0;i<4;i++){sum=sum*10+num[i];}return sum;
}
int main(){int n,MIN,MAX;scanf("%d",&n);int num[5];while(1){to_array(n,num);sort(num,num+4);MIN=to_number(num);sort(num,num+4,cmp);MAX=to_number(num);n=MAX-MIN;printf("%04d-%04d=%04d\n",MAX,MIN,n);if(n==0||n==6174)break;}return 0;
}

#include <cstdio>
#include <cmath>int main() {int a, b, c;scanf("%d%d%d", &a, &b, &c);int delta = b * b - 4 * a * c;if (delta < 0) {printf("No Solution");} else if (delta == 0) {printf("%.2f", -b / (2.0 * a));} else {printf("%.2f %.2f",  (-b - sqrt((double)delta)) / (2.0 * a), (-b + sqrt((double)delta)) / (2.0 * a));}return 0;
}

5.2最大公约数与最小公倍数

#include <cstdio>
#include <cmath>
int gcd(int a,int b){if(b==0)return a;//求最大公约数的辗转相除法递归写法else return gcd(b,a%b);
}
int main() {int m,n;while(scanf("%d%d",&m,&n)!=EOF){printf("%d\n",gcd(m,n));}return 0;
}

#include <cstdio>int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}int main() {int a, b;scanf("%d%d", &a, &b);printf("%d", a / gcd(a, b) * b);return 0;
}

5.3分数的四则运算

#include <cstdio>
#include <algorithm>
using namespace std;struct Fraction {int up, down;
};int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}Fraction reduction(Fraction fraction) {if (fraction.down < 0) {fraction.up = -fraction.up;fraction.down = -fraction.down;}if (fraction.up == 0) {fraction.down = 1;} else {int d = gcd(abs(fraction.up), abs(fraction.down));fraction.up /= d;fraction.down /= d;}return fraction;
}int main() {Fraction fraction;scanf("%d%d", &fraction.up, &fraction.down);Fraction result = reduction(fraction);if (result.down == 1) {printf("%d", result.up);} else {printf("%d %d", result.up, result.down);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;struct Fraction {int up, down;
};int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}Fraction reduction(Fraction fraction) {if (fraction.down < 0) {fraction.up = -fraction.up;fraction.down = -fraction.down;}if (fraction.up == 0) {fraction.down = 1;} else {int d = gcd(abs(fraction.up), abs(fraction.down));fraction.up /= d;fraction.down /= d;}return fraction;
}Fraction add(Fraction f1, Fraction f2) {Fraction result;result.up = f1.up * f2.down + f2.up * f1.down;result.down = f1.down * f2.down;return reduction(result);
}int main() {Fraction f1, f2;scanf("%d%d%d%d", &f1.up, &f1.down, &f2.up, &f2.down);Fraction result = add(f1, f2);if (result.down == 1) {printf("%d", result.up);} else {printf("%d %d", result.up, result.down);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;struct Fraction {int up, down;
};int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}Fraction reduction(Fraction fraction) {if (fraction.down < 0) {fraction.up = -fraction.up;fraction.down = -fraction.down;}if (fraction.up == 0) {fraction.down = 1;} else {int d = gcd(abs(fraction.up), abs(fraction.down));fraction.up /= d;fraction.down /= d;}return fraction;
}Fraction sub(Fraction f1, Fraction f2) {Fraction result;result.up = f1.up * f2.down - f2.up * f1.down;result.down = f1.down * f2.down;return reduction(result);
}int main() {Fraction f1, f2;scanf("%d%d%d%d", &f1.up, &f1.down, &f2.up, &f2.down);Fraction result = sub(f1, f2);if (result.down == 1) {printf("%d", result.up);} else {printf("%d %d", result.up, result.down);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;struct Fraction {int up, down;
};int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}Fraction reduction(Fraction fraction) {if (fraction.down < 0) {fraction.up = -fraction.up;fraction.down = -fraction.down;}if (fraction.up == 0) {fraction.down = 1;} else {int d = gcd(abs(fraction.up), abs(fraction.down));fraction.up /= d;fraction.down /= d;}return fraction;
}Fraction multiply(Fraction f1, Fraction f2) {Fraction result;result.up = f1.up * f2.up;result.down = f1.down * f2.down;return reduction(result);
}int main() {Fraction f1, f2;scanf("%d%d%d%d", &f1.up, &f1.down, &f2.up, &f2.down);Fraction result = multiply(f1, f2);if (result.down == 1) {printf("%d", result.up);} else {printf("%d %d", result.up, result.down);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;struct Fraction {int up, down;
};int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}Fraction reduction(Fraction fraction) {if (fraction.down < 0) {fraction.up = -fraction.up;fraction.down = -fraction.down;}if (fraction.up == 0) {fraction.down = 1;} else {int d = gcd(abs(fraction.up), abs(fraction.down));fraction.up /= d;fraction.down /= d;}return fraction;
}Fraction div(Fraction f1, Fraction f2) {Fraction result;result.up = f1.up * f2.down;result.down = f1.down * f2.up;return reduction(result);
}int main() {Fraction f1, f2;scanf("%d%d%d%d", &f1.up, &f1.down, &f2.up, &f2.down);Fraction result = div(f1, f2);if(!f2.up){printf("undefined");}else if (result.down == 1) {printf("%d", result.up);} else {printf("%d %d", result.up, result.down);}return 0;
}

5.4素数 

#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
bool isPrime(int n){if(n<=1)return false;int sqr=(int)sqrt(1.0*n);for(int i=2;i<=sqr;i++){if(n%i==0)return false;}return true;}
int main() {int n;scanf("%d",&n);if(isPrime(n))printf("Yes");else printf("No");return 0;
}

#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
bool isPrime(int n){if(n<=1)return false;int sqr=(int)sqrt(1.0*n);for(int i=2;i<=sqr;i++){if(n%i==0)return false;}return true;}
int main() {int n;scanf("%d",&n);for(int i=1;i<n+1;i++){if(isPrime(i))printf("%d\n",i);}return 0;
}

5.5质因子分解

#include <cstdio>
int main() {int n;scanf("%d", &n);int counter = 0;while (n % 2 == 0) {counter++;n /= 2;}printf("%d", counter);return 0;
}

#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;const int MAXN = 1000 + 1;
bool isPrime[MAXN];
vector<int> primes;void getPrimes(int n) {memset(isPrime, true, sizeof(isPrime));for (int i = 2; i <= n; i++) {if (isPrime[i]) {primes.push_back(i);for (int j = i + i; j <= n; j += i) {isPrime[j] = false;}}}
}int main() {int n;scanf("%d", &n);getPrimes((int)sqrt(1.0 * n));for (int i = 0; i < primes.size() && n > 1; i++) {int counter = 0;while (n > 1 && n % primes[i] == 0) {counter++;n /= primes[i];}if (counter > 0) {printf("%d %d\n", primes[i], counter);}}if (n > 1) {printf("%d 1", n);}return 0;
}

5.6大整数运算 

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;typedef vector<int> BigInt;BigInt toBigInt(string nums) {BigInt result;for (int i = (int)nums.length() - 1; i >= 0; i--) {result.push_back(nums[i] - '0');}return result;
}int compare(BigInt a, BigInt b) {if (a.size() > b.size()) {return 1;} else if (a.size() < b.size()) {return -1;} else {for (int i = (int)a.size() - 1; i >= 0; i--) {if (a[i] > b[i]) {return 1;} else if (a[i] < b[i]) {return -1;}}return 0;}
}int main() {string nums1, nums2;cin >> nums1 >> nums2;BigInt a = toBigInt(nums1);BigInt b = toBigInt(nums2);int compareResult = compare(a, b);if (compareResult < 0) {printf("a < b");} else if (compareResult > 0) {printf("a > b");} else {printf("a = b");}
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;typedef vector<int> BigInt;BigInt toBigInt(string nums) {BigInt result;for (int i = (int)nums.length() - 1; i >= 0; i--) {result.push_back(nums[i] - '0');}return result;
}BigInt add(BigInt a, BigInt b) {BigInt c;int carry = 0;for (int i = 0; i < a.size() || i < b.size(); i++) {int aDigit = i < a.size() ? a[i] : 0;int bDigit = i < b.size() ? b[i] : 0;int sum = aDigit + bDigit + carry;c.push_back(sum % 10);carry = sum / 10;}if (carry) {c.push_back(carry);}return c;
}void print(BigInt a) {for (int i = (int)a.size() - 1; i >= 0; i--) {cout << a[i];}
}int main() {string nums1, nums2;cin >> nums1 >> nums2;BigInt a = toBigInt(nums1);BigInt b = toBigInt(nums2);print(add(a, b));return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;typedef vector<int> BigInt;BigInt toBigInt(string nums) {BigInt result;for (int i = (int)nums.length() - 1; i >= 0; i--) {result.push_back(nums[i] - '0');}return result;
}
int compare(BigInt a, BigInt b) {if (a.size() > b.size()) {return 1;} else if (a.size() < b.size()) {return -1;} else {for (int i = (int)a.size() - 1; i >= 0; i--) {if (a[i] > b[i]) {return 1;} else if (a[i] < b[i]) {return -1;}}return 0;}
}
BigInt sub(BigInt a, BigInt b) {BigInt c;for (int i = 0; i < a.size() || i < b.size(); i++) {int bDigit = i < b.size() ? b[i] : 0;if (a[i] < bDigit) {a[i + 1]--;a[i] += 10;}c.push_back(a[i] - bDigit);}while (c.size() > 1 && c.back() == 0) {c.pop_back();}return c;
}void print(BigInt a) {for (int i = (int)a.size() - 1; i >= 0; i--) {cout << a[i];}
}int main() {string nums1, nums2;cin >> nums1 >> nums2;BigInt a = toBigInt(nums1);BigInt b = toBigInt(nums2);if (compare(a, b) >= 0) {print(sub(a, b));} else {cout << "-";print(sub(b, a));}return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;typedef vector<int> BigInt;BigInt toBigInt(string nums) {BigInt result;for (int i = (int)nums.length() - 1; i >= 0; i--) {result.push_back(nums[i] - '0');}return result;
}
int compare(BigInt a, BigInt b) {if (a.size() > b.size()) {return 1;} else if (a.size() < b.size()) {return -1;} else {for (int i = (int)a.size() - 1; i >= 0; i--) {if (a[i] > b[i]) {return 1;} else if (a[i] < b[i]) {return -1;}}return 0;}
}
BigInt mul(BigInt a, int b) {BigInt c;int carry=0;;for (int i = 0; i < a.size(); i++) {int temp=a[i]*b+carry;c.push_back(temp%10);carry=temp/10;}while(carry!=0){c.push_back(carry%10);carry/=10;}while (c.size() > 1 && c.back() == 0) {c.pop_back();}return c;
}void print(BigInt a) {for (int i = (int)a.size() - 1; i >= 0; i--) {cout << a[i];}
}int main() {string nums;int b;cin >> nums >> b;BigInt a = toBigInt(nums);print(mul(a, b));return 0;return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;typedef vector<int> BigInt;BigInt toBigInt(string nums) {BigInt result;for (int i = (int)nums.length() - 1; i >= 0; i--) {result.push_back(nums[i] - '0');}return result;
}BigInt mul(BigInt a, BigInt b) {BigInt c = BigInt(a.size() + b.size() + 1, 0);for (int i = 0; i < a.size(); i++) {for (int j = 0; j < b.size(); j++) {c[i + j] += a[i] * b[j];}}for (int i = 0; i < a.size() + b.size(); i++) {if (c[i] >= 10) {c[i + 1] += c[i] / 10;c[i] = c[i] % 10;}}while (c.size() > 1 && c.back() == 0) {c.pop_back();}return c;
}void print(BigInt a) {for (int i = (int)a.size() - 1; i >= 0; i--) {cout << a[i];}
}int main() {string nums1, nums2;cin >> nums1 >> nums2;BigInt a = toBigInt(nums1);BigInt b = toBigInt(nums2);print(mul(a, b));return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;typedef vector<int> BigInt;BigInt toBigInt(string nums) {BigInt result;for (int i = (int)nums.length() - 1; i >= 0; i--) {result.push_back(nums[i] - '0');}return result;
}BigInt div(BigInt a, int b, int &r) {BigInt c;for (int i = (int)a.size() - 1; i >= 0; i--) {r = r * 10 + a[i];c.push_back(r / b);r = r % b;}reverse(c.begin(), c.end());while (c.size() > 1 && c.back() == 0) {c.pop_back();}return c;
}void print(BigInt a) {for (int i = (int)a.size() - 1; i >= 0; i--) {cout << a[i];}
}int main() {string nums;int b, r = 0;cin >> nums >> b;if (b == 0) {cout << "undefined";return 0;}BigInt a = toBigInt(nums);BigInt q = div(a, b, r);print(q);cout << " " << r;return 0;
}

5.7扩展欧几里得算法

#include <cstdio>
#include <algorithm>
using namespace std;int gcd(int a, int b) {if (b == 0) {return a;} else {return gcd(b, a % b);}
}int main() {int a, b, c;scanf("%d%d%d", &a, &b, &c);printf(c % gcd(a, b) == 0 ? "Yes" : "No");return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;int exGcd(int a, int b, int &x, int &y) {if (b == 0) {x = 1;y = 0;return a;}int d = exGcd(b, a % b, x, y);int temp = x;x = y;y = temp - a / b * y;return d;
}int main() {int a, b, x, y;scanf("%d%d", &a, &b);int d = exGcd(a, b, x, y);int step = b / d;int minX = (x % step + step) % step;printf("%d %d", minX, (d - a * minX) / b);return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;int exGcd(int a, int b, int &x, int &y) {if (b == 0) {x = 1;y = 0;return a;}int d = exGcd(b, a % b, x, y);int temp = x;x = y;y = temp - a / b * y;return d;
}int solve(int a, int b, int c) {int x, y;int d = exGcd(a, b, x, y);if (c % d) {return -1;} else {int step = abs(b / d);int minX = (c * x / d % step + step) % step;return minX;}
}int main() {int a, b, c;scanf("%d%d%d", &a, &b, &c);int minX = solve(a, b, c);if (minX == -1) {printf("No Solution");} else {printf("%d %d", minX, (c - a * minX) / b);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;int exGcd(int a, int b, int &x, int &y) {if (b == 0) {x = 1;y = 0;return a;}int d = exGcd(b, a % b, x, y);int temp = x;x = y;y = temp - a / b * y;return d;
}int solve(int a, int b, int c) {int x, y;int d = exGcd(a, b, x, y);if (c % d) {return -1;} else {int step = abs(b / d);int minX = (c * x / d % step + step) % step;return minX;}
}int main() {int a, c, m, x, y;scanf("%d%d%d", &a, &c, &m);int minX = solve(a, m, c);if (minX == -1) {printf("No Solution");} else {printf("%d", minX);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;int exGcd(int a, int b, int &x, int &y) {if (b == 0) {x = 1;y = 0;return a;}int d = exGcd(b, a % b, x, y);int temp = x;x = y;y = temp - a / b * y;return d;
}int invert(int a, int m) {int x, y;int d = exGcd(a, m, x, y);if (d != 1) {return -1;} else {return (x % m + m) % m;}
}int main() {int a, m;scanf("%d%d", &a, &m);int result = invert(a, m);if (result == -1) {printf("No Solution");} else {printf("%d", result);}return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;int exGcd(int a, int b, int &x, int &y) {if (b == 0) {x = 1;y = 0;return a;}int d = exGcd(b, a % b, x, y);int temp = x;x = y;y = temp - a / b * y;return d;
}int invert(int a, int m) {int x, y;int d = exGcd(a, m, x, y);if (d != 1) {return -1;} else {return (x % m + m) % m;}
}int main() {int n, a, m, b;scanf("%d%d%d", &n, &a, &m);int result = invert(abs(a), m);for (int i = 0; i < n; i++) {scanf("%d", &b);result = (result * b) % m;}printf("%d", result);return 0;
}

5.8组合数

#include <cstdio>
int cal(int n,int p)
{if(n<p)return 0;return n/p+cal(n/p,p);}
int main() {int n,p=2;scanf("%d", &n);printf("%d", cal(n,p));return 0;
}

#include <cstdio>typedef long long LL;LL C(LL n, LL m) {LL ans = 1;for (LL i = 1; i <= m; i++) {ans = ans * (n - m + i) / i;}return ans;
}int main() {LL n, m;scanf("%lld%lld", &n, &m);printf("%lld", C(n, m));return 0;
}

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.rhkb.cn/news/370628.html

如若内容造成侵权/违法违规/事实不符,请联系长河编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

移动端UI风格营造舒适氛围

移动端UI风格营造舒适氛围

Spring容器Bean之XML配置方式

一、首先看applicationContext.xml里的配置项bean 我们采用xml配置文件的方式对bean进行声明和管理&#xff0c;每一个bean标签都代表着需要被创建的对象并通过property标签可以为该类注入其他依赖对象&#xff0c;通过这种方式Spring容器就可以成功知道我们需要创建那些bean实…

cs224n作业3 代码及运行结果

代码里要求用pytorch1.0.0版本&#xff0c;其实不用也可以的。 【删掉run.py里的assert(torch.version “1.0.0”)即可】 代码里面也有提示让你实现什么&#xff0c;弄懂代码什么意思基本就可以了&#xff0c;看多了感觉大框架都大差不差。多看多练慢慢来&#xff0c;加油&am…

Camunda 整合Springboot 实战篇

1.导入依赖 <dependency><groupId>org.camunda.bpm.springboot</groupId><artifactId>camunda-bpm-spring-boot-starter</artifactId><version>7.18.0</version></dependency><dependency><groupId>org.camunda.b…

C语言图书馆管理系统(管理员版)

案例&#xff1a;图书馆管理系统&#xff08;管理员版&#xff09; 背景&#xff1a; 随着信息技术的发展和普及&#xff0c;传统的图书馆管理方式已经无法满足现代图书馆高效、便捷、智能化的管理需求。传统的手工登记、纸质档案管理不仅耗时耗力&#xff0c;而且容易出现错…

剖析DeFi交易产品之UniswapV3:交易路由合约

本文首发于公众号&#xff1a;Keegan小钢 SwapRouter 合约封装了面向用户的交易接口&#xff0c;但不再像 UniswapV2Router 一样根据不同交易场景拆分为了那么多函数&#xff0c;UniswapV3 的 SwapRouter 核心就只有 4 个交易函数&#xff1a; exactInputSingle&#xff1a;指…

华为机试HJ34图片整理

华为机试HJ34图片整理 题目&#xff1a; 想法&#xff1a; 将输入的字符串中每个字符都转为ASCII码&#xff0c;再通过快速排序进行排序并输出 input_str input() input_list [int(ord(l)) for l in input_str]def partition(arr, low, high):i low - 1pivot arr[high]f…

matlab 有倾斜的椭圆函数图像绘制

matlab 有倾斜的椭圆函数图像绘制 有倾斜的椭圆函数图像绘制xy交叉项引入斜线负向斜线成分正向斜线成分 x^2 y^2 xy 1 &#xff08;负向&#xff09;绘制结果 x^2 y^2 - xy 1 &#xff08;正向&#xff09;绘制结果 有倾斜的椭圆函数图像绘制 为了确定椭圆的长轴和短轴的…

【Python】MacBook M系列芯片Anaconda下载Pytorch,并开发一个简单的数字识别代码(附带踩坑记录)

文章目录 配置镜像源下载Pytorch验证使用Pytorch进行数字识别 配置镜像源 Anaconda下载完毕之后&#xff0c;有两种方式下载pytorch&#xff0c;一种是用页面可视化的方式去下载&#xff0c;另一种方式就是直接用命令行工具去下载。 但是由于默认的Anaconda走的是外网&#x…

9 redis,memcached,nginx网络组件

课程目标: 1.网络模块要处理哪些事情 2.reactor是怎么处理这些事情的 3.reactor怎么封装 4.网络模块与业务逻辑的关系 5.怎么优化reactor? io函数 函数调用 都有两个作用:io检测 是否就绪 io操作 1. int clientfd = accept(listenfd, &addr, &len); 检测 全连接队列…

技术派Spring事件监听机制及原理

Spring事件监听机制是Spring框架中的一种重要技术&#xff0c;允许组件之间进行松耦合通信。通过使用事件监听机制&#xff0c;应用程序的各个组件可以在其他组件不直接引用的情况下&#xff0c;相互发送和接受消息。 需求 在技术派中有这样一个需求&#xff0c;当发布文章或…

简单分享下python多态

目录&#xff1a; 一、多态是啥嘞&#xff08;龙生九子各有不同&#xff0c;这就是多态&#xff09; 二、基础的实例 三、多态的优势与应用场景 四、深入理解 一、多态是啥嘞&#xff08;龙生九子各有不同&#xff0c;这就是多态&#xff09; 多态&#xff08;Polymorphism&…

如何利用算法优化广告效果

效果广告以超过67%的占比&#xff0c;成为了中国互联网广告预算的大头。在BAT、字节等大的媒体平台上&#xff0c;效果广告以CPC实时竞价广告为主。在这种广告产品的投放中&#xff0c;广告主或其代理公司通过针对每个广告点击出价&#xff0c;系统自动把这些点击出价换算成eCP…

【人工智能】-- 智能机器人

个人主页&#xff1a;欢迎来到 Papicatch的博客 课设专栏 &#xff1a;学生成绩管理系统 专业知识专栏&#xff1a; 专业知识 文章目录 &#x1f349;引言 &#x1f349;机器人介绍 &#x1f348;机器人硬件 &#x1f34d;机械结构 &#x1f34d;传感器 &#x1f34d;控…

nginx配置尝试

from fastapi import FastAPI, File, UploadFile, HTTPException from fastapi.responses import JSONResponse, FileResponse, HTMLResponse import logging import os from datetime import datetime import uvicorn# 初始化日志 logging.basicConfig(filenamefile_server.lo…

学java的第3天 后端商城小程序工作

1.数据库的大坑 特殊字段名 ’我的图片表中有一个字段是描述我写成desc了&#xff0c;正好是mysql中的关键字 就不能使用了 2.后端编写 2.1可以把请求分开 在商品浏览页中 只显示商品的大致信息 当用户再点击其他按钮时在发出请求 2.2把请求合并 把数据整合到一起 利用ass…

SpringBoot环境集成 sms4j短信聚合

SpringBoot环境集成 sms4j短信聚合 官方文档 前言 在正式使用sms4j短信功能之前&#xff0c;请详细阅读本文档&#xff0c;依照本篇流程进行操作和配给&#xff0c;即可解决大部分问题&#xff0c;如对我们的文档有建议&#xff0c;请联系开发者团队&#xff0c; 我们将根据可…

电脑为什么会提示丢失msvcp140.dll?怎么修复msvcp140.dll文件会靠谱点

电脑为什么会提示丢失msvcp140.dll&#xff1f;其实只要你的msvcp140.dll文件一损坏&#xff0c;然而你的电脑程序需要运用到这个msvcp140.dll文件的时候&#xff0c;就回提示你丢失了msvcp140.dll文件&#xff01;因为没有这个文件&#xff0c;你的很多程序都用不了的。今天我…

电脑录歌用什么软件好?分享电脑录音软件:6款

短视频普遍的今天&#xff0c;越来越多的人喜欢通过电脑进行音乐创作和录制。然而&#xff0c;面对市面上琳琅满目的电脑录音软件&#xff0c;很多人可能会感到困惑&#xff1a;电脑录歌用什么软件好呢&#xff1f;本文将为大家分享六款精选的录音软件&#xff0c;帮助大家找到…

【matlab】分类回归——智能优化算法优化径向基神经网络

目录 径向基&#xff08;Radial Basis Function, RBF&#xff09;神经网络 一、基本概念 二、网络结构 三、工作原理 四、学习算法 五、优点与应用 六、与BP神经网络的比较 智能优化算法 常见的智能优化算法 灰狼优化算法&#xff08;Grey Wolf Optimizer, GWO&#…