ME4546的专栏

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1717<br />#include<iostream> #include<cstring> #include<cstdio> #include<cmath> using namespace std; int a,b; int gcd(int x,int y) { while(x%y) { int r=x%y; x=y; y=r; } return y; } v

http://poj.org/problem?id=2773#include using namespace std; #define N 1001 bool h[N*N],flag[N*N]; int prime[N],cnt; void init(){ memset(h,f

#include using namespace std; #define N 1000001 struct node{ double x,y; }p[N]; int n; void cal_c(){ node u,v; double area=0,tx

相关题目： http://acm.hdu.edu.cn/showproblem.php?pid=2824 pku 2478(与前n个数互质的个数的求和) http://acm.hdu.edu.cn/showproblem.php?pid=3508 素因子的积 http://

#include#include#includeusing namespace std;#define MAX(x,y) (x>y?x:y)#define N 200010int num[N],n;int m;int st[20][N];int tlog2[N];void ST(){ for(int i=1;i<=n;i++) st[0][i]=num[i];

http://acm.hdu.edu.cn/showproblem.php?pid=3231#includeusing namespace std;#define N 2001#define M 500000struct node{ int v,next; node(){}; node(int a,int b){ next=a;v=b; }}E[M];

<br />#include<iostream> using namespace std; #define MAX 100 #define BASE 10000 void multiply(int a[],int Max,int b) { int i,array=0; for (i=Max-1; i>=0; i--) { array+=b*a[i]; a[i] = array%BASE; array /=

<br />#include <iostream> using namespace std; int a[1001][100]={0}; int main(void) { a[1][99]=0;a[2][99]=a[3][99]=1; int i,j; for(i=4;i<=1000;i++) { j=99; while(j>=0) { a[i][j]+=(a[i-2][j]*2+a[i-1][j]); a[i][j-1]+=a[i][j]/1000

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1568<br />题目大意：求第N项斐波那契数列值的前四位，N很大<br />#include<iostream> #include<cmath> using namespace std; #define N 21 int f[N]={0,1}; void init() { for(int i=2;i<N;i++) f[i]=f[i-1]+f[i-2]; } void solve(in

http://acm.hdu.edu.cn/showproblem.php?pid=3902 额外加上每两个点的中点,把N个点扩展成2*N个，然后枚举1到n点，于其对面的点相连，当作对称轴，然后看这条线段两边成对的点的连线，是否于对称轴平分且垂直，不要忘了还要平分这个条件 #