这些算法非常简单,代码一看就懂,直接贴出来了。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define N 1009
#define inf 0x0f0f0f0f
int gcd(int a,int b){
if(b==0) return a;
else return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
int Fast(int x,int n){
int tem = x,ans = 1;
while(n){
if(n%2==1) ans*=tem;
tem *= tem;
n >>= 1;
}
return ans;
}
int f[N];
int ans;
void init(int n){
for(int i = 1;i<=n;i++)
f[i] = i;
ans = 0;
}
int find(int x){
if(f[x]==x) return x;
else return f[x] = find(f[x]);
}
void Union(int a,int b){
int f1 = find(a);
int f2 = find(b);
if(f1!=f2){
f[f1] = f2;
ans++;
}
}
int c[N][N];
void Com(){
memset(c,0,sizeof(c));
for(int i = 1;i<N;i++){
c[i][0] = c[i][i] = 1;
for(int j = 1;j<i;j++){
c[i][j] = c[i-1][j] + c[i-1][j-1];
}
}
}
void Test1(){
Com();
printf("gcd==%d\n",gcd(12,3));
printf("lcm==%d\n",lcm(4,3));
printf("fast===%d\n",Fast(2,3));
printf("Com===%d\n",c[12][3]);
}