Red Huang

Red Huang

uva 10468

沒有 CODING 技巧,純粹手算就對了

用了一張計算紙

//====================================================================||  
// Name        : Rigid Circle Packing.cpp                                              ||  
// Date : 2013/7/22 下午3:39:30                                               ||  
// Author : GCA                                                       ||  
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||  
//====================================================================||  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
using namespace std;  
#ifdef ONLINE\_JUDGE  
#define ll "%lld"  
#else  
#define ll "%I64d"  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 10011  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define Is\_debug true  
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
  
double pi=acos(-1);  
inline double dsin(double x){  
    return sin(x\*pi/180);  
}  
inline double dcos(double x){  
    return cos(x\*pi/180);  
}  
inline double sqr(double x){  
    return x\*x;  
}  
double ans9,ans10;  
void pre(){  
    double dt=sqrt(4-sqr((2\*sqrt(2)-2)/2))+2\*sqrt(2);  
    double dt2=sqrt(3)+2+sqrt(2);  
    dt+=dt2;  
    dt/=sqrt(2);  
    ans9=dt;  
    dt=sqrt(4+8-8\*sqrt(2)\*dcos(60));  
    double ang=asin(2\*dsin(60)/dt);  
    ang=ang\*180/pi;  
    double ang2=acos((sqr(dt)+4-4)/(4\*dt));  
    ang2=ang2\*180/pi;  
    ang=180-ang-ang2-45;  
    ans10=2\*dcos(ang)+6;  
//    printf("%lf",ans10);  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    pre();  
    double a;  
    while(~scanf("%lf",&a)){  
        printf("%.5f %.5f\\n",ans9\*a,ans10\*a);  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

載入中......
此文章數據所有權由區塊鏈加密技術和智能合約保障僅歸創作者所有。