m0_48909881的博客

#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++;

#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[

#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

#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 ++ ){

#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);

#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

#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

#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("-");

#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 %