![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
VIP
fuel030
详细代码关注置顶文章github自取
展开
-
方格分割(刷题赛)
#include <iostream>#include <cstring>#include <algorithm>using namespace std;int vis[10][10];int ans = 0;int dir[4][2]={ {0,1},{0,-1},{1,0},{-1,0}};void dfs(int x,int y){ if(x==0||y==0||x==6||y==6){ ans++;转载 2022-01-17 10:36:04 · 205 阅读 · 0 评论 -
拦截导弹,贪心+二分的nlogn做法
#include <iostream>#include <cstring>#include <algorithm>#include <functional>using namespace std;int n = 1, a[100005], nup[10005], up[10005], len = 1, cnt = 1;int main(){ while((scanf("%d",&a[n])!=EOF))n++; nup[原创 2022-01-15 12:38:24 · 208 阅读 · 0 评论 -
蓝桥杯算法训练VIP-瓷砖铺放 (C++代码)
#include <iostream>#include <cstring>#include <algorithm>using namespace std;int res(int num){ if(num == 1){ return 1; } if(num == 2){ return 2; } return res(num-1)+res(num-2);}int main(){ in原创 2022-01-14 19:18:25 · 466 阅读 · 0 评论 -
算法训练 集合运算
#include <iostream>#include <cstring>#include <algorithm>using namespace std;int lena,lenb,a[1050],b[1050];void union_set(int a[],int b[],int lena,int lenb){ int tmp[2050],cnt=0; for (int i = 0; i < lena; i ++ ){原创 2022-01-14 14:16:27 · 132 阅读 · 0 评论 -
基础练习 Huffuman树
#include <iostream>#include <cstring>#include <algorithm>using namespace std;int huffmanTree(int a[],int n){ int sum = 0; //printf("n=%d\n",n); for (int i = 0; i < n - 1; i ++ ){//每次取最小两位相加,减小数组长度 sort(a+i,a+n);原创 2022-01-12 16:47:22 · 64 阅读 · 0 评论 -
基础练习 高精度加法
#include <iostream>#include <cstring>#include <algorithm>using namespace std;string BigNumAdd(string,int ,string,int);int main(){ string a,b; //scanf("%s%s", &a, &b); cin>>a>>b; if(a.size() < b原创 2022-01-12 11:03:49 · 57 阅读 · 0 评论 -
基础练习 阶乘计算
#include<stdio.h>int A[10010];int main(){ int n,count=1,f,temp; A[0]=1; scanf("%d",&n); for(int i=1;i<=n;i++) { f=0; //记录进位数 for(int j=0;j<count;j++) //每一位数乘i { te原创 2022-01-11 22:25:21 · 104 阅读 · 0 评论 -
基础练习 Sine之舞
#include <iostream>#include <cstring>#include <algorithm>using namespace std;void An(int n){ for (int i = 0; i < n; i ++ ){ printf("sin(%d",i+1); if(i%2 == 0 && i!= n-1){ printf("-");原创 2022-01-11 13:54:28 · 56 阅读 · 0 评论 -
基础练习 分解质因数
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <complex>using namespace std;int fun(int n){ int m ; m = (int)sqrt(n); int i; for(i = 2; i <= m; i++){ if(n %转载 2022-01-09 11:22:36 · 55 阅读 · 0 评论