给两条直线顶点坐标 求两条直线是否相交
- //叉积
- double mult(Point a, Point b, Point c)
- {
- return (a.x-c.x)*(b.y-c.y)-(b.x-c.x)*(a.y-c.y);
- }
- //aa, bb为一条线段两端点 cc, dd为另一条线段的两端点 相交返回true, 不相交返回false
- bool intersect(Point aa, Point bb, Point cc, Point dd)
- {
- if ( max(aa.x, bb.x)<min(cc.x, dd.x) )
- {
- return false;
- }
- if ( max(aa.y, bb.y)<min(cc.y, dd.y) )
- {
- return false;
- }
- if ( max(cc.x, dd.x)<min(aa.x, bb.x) )
- {
- return false;
- }
- if ( max(cc.y, dd.y)<min(aa.y, bb.y) )
- {
- return false;
- }
- if ( mult(cc, bb, aa)*mult(bb, dd, aa)<0 )
- {
- return false;
- }
- if ( mult(aa, dd, cc)*mult(dd, bb, cc)<0 )
- {
- return false;
- }
- return true;
- }
欧拉函数
- //直接求解欧拉函数
- int euler(int n){ //返回euler(n)
- int res=n,a=n;
- for(int i=2;i*i<=a;i++){
- if(a%i==0){
- res=res/i*(i-1);//先进行除法是为了防止中间数据的溢出
- while(a%i==0) a/=i;
- }
- }
- if(a>1) res=res/a*(a-1);
- return res;
- }
- //筛选法打欧拉函数表
- #define Max 1000001
- int euler[Max];
- void Init(){
- euler[1]=1;
- for(int i=2;i<Max;i++)
- euler[i]=i;
- for(int i=2;i<Max;i++)
- if(euler[i]==i)
- for(int j=i;j<Max;j+=i)
- euler[j]=euler[j]/i*(i-1);//先进行除法是为了防止中间数据的溢出
- }
求两条线段(直线)的交点
- double cross(double x1, double y1, double x2, double y2)
- {
- return x1 * y2- x2* y1;
- }
- void intersec(point a, point b, point c, point d, double* x, double* y)
- {
- double u = cross(d.x- a.x, d.y- a.y, b.x- a.x, b.y- a.y);
- double v = cross(c.x- a.x, c.y- a.y, b.x- a.x, b.y- a.y);
- double w = u- v;
- *x= (u*1.0* c.x- v*1.0* d.x)/ (w*1.0);
- *y= (u*1.0* c.y- v*1.0* d.y)/ (w*1.0);
- }
圆周率计算代码
- #include<stdio.h>
- int main()
- {
- int n;
- while(scanf("%d",&n)!=EOF&&n!=0)
- {
- int const N=7200;
- int const M=10000;
- int const B=10000;
- int const L=4;
- int s[M/L];
- int r1[N]= {0},r2[N]= {0},d1[N]= {0},d2;
- int r3[N]= {0},r4[N]= {0},d3[N]= {0},d4;
- int i,k,t,p=0,mp=M/L/20;
- r1[0]=1;
- r1[1]=3;
- r3[0]=4;
- printf("正在计算,请等待\n____________________\n");
- for(k=0; k<M/L; ++k)
- {
- t=r1[0]*B;
- d1[0]=t/0x5;
- r1[0]=t%0x5;
- //
- t=r3[0]*B;
- d3[0]=t/0xEF;
- r3[0]=t%0xEF;
- s[k]=d1[0]-d3[0];
- int tag=0;
- for(i=1; i<N; ++i)
- {
- t=r1[i]*B+d1[i-1];
- d1[i]=t/0x19;
- r1[i]=t%0x19;
- t=r2[i]*B+d1[i];
- d2=t/(2*i+1);
- r2[i]=t%(2*i+1);
- //
- t=r3[i]*B+d3[i-1];
- d3[i]=t/0xDF21;
- r3[i]=t%0xDF21;
- t=r4[i]*B+d3[i];
- d4=t/(2*i+1);
- r4[i]=t%(2*i+1);
- if(tag)
- {
- s[k]+=(d2-d4);
- tag=0;
- }
- else
- {
- s[k]+=(d4-d2);
- tag=1;
- }
- }
- if(p==mp)
- {
- printf(">");
- p=0;
- }
- else
- p++;
- }
- for(i=M/L-1; i>=0; i--)
- {
- while(s[i]>=B)
- {
- s[i-1]++;
- s[i]-=B;
- }
- while(s[i]<0)
- {
- s[i-1]--;
- s[i]+=B;
- }
- }
- printf("\npi=3.\n");
- for(i=0; i<M/L; ++i)
- printf("%d",s[i]);
- printf("\n");
- }
- return 0;
- }