gym102222B计算几何

C
注意越界
字符串a b
a左移19位得到b
给出c 求左移前字符串
S-Z=-7 左移19位
先左移 超过‘A’ +26

string a,b,c;
int main(){
	cin>>t;
	
	rep(i,1,t){
		
		cin>>n>>m;
		cin>>a>>b;
		cin>>c;
		int cha=b[0]-a[0];
		if(cha<0)
			cha+=26;
		for(int i=0;i<m;i++){
			c[i]=c[i]-cha;
			if(c[i]<'A')
				c[i]+=26;
		}
		cout<<"Case #"<<i<<": "<<c<<endl;
	}
	return 0;
}

B 余弦定理/向量 l=角度*r;
PI的精度要对

const double PI=acos(-1.0);
int n;
struct point{
	double x,y;
}p[maxn];
double dis(double a,double b,double c,double d){//距离的平方 
	return abs(c-a)*abs(c-a)+abs(d-b)*abs(d-b);
}
int main(){
	int T,cnt=0,qx=0,qy=0;
	double ans=0;
	cin>>T;
	while(T--){
		ans=0;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>p[i].x>>p[i].y;
		}
		cin>>qx>>qy;
		for(int i=0;i<n;i++){
			double a=dis(p[(i+n-1)%n].x,p[(i+n-1)%n].y,p[i].x,p[i].y);//0前一个 n-1 
			double b=dis(p[(i+1)%n].x,p[(i+1)%n].y,p[i].x,p[i].y);	//n-1下一个 0 
			double c=dis(p[(i+n-1)%n].x,p[(i+n-1)%n].y,p[(i+1)%n].x,p[(i+1)%n].y);
			double d=(a+b-c)/(2*sqrt(a)*sqrt(b));
			double du=abs(PI-acos(d));
			double r=dis(p[i].x,p[i].y,qx,qy);//r 任意一点到q的距离的平方 
			r=sqrt(r);
		
			ans+=du*r;
		}
		cout<<"Case #"<<++cnt<<": ";
		printf("%.3lf\n",ans); 
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
 
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false)
#define fi first
#define se second
 
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=4e5+5;
const int maxm=1e6+5;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod=1e9+7;
const double PI=acos(-1.0);

ll n,m,t,minn=INF,maxx,cnt,sum,tmp,f,px,py;
double ans;
struct point{
	int x;
	int y;
}p[55];
double dis(point a,point b){	//r
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double deg(point a,point b,point c){
	double x1=a.x-b.x,y1=a.y-b.y;
	double x2=c.x-b.x,y2=c.y-b.y;
	double zi=x1*x2+y1*y2;
	double mu=sqrt(x1*x1+y1*y1)*sqrt(x2*x2+y2*y2);
	double du=acos(zi/mu);
	return PI-du;
}
int main(){
	cin>>t;
	while(t--){
		ans=0;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>p[i].x>>p[i].y;
		}
		cin>>p[n].x>>p[n].y;
		
		for(int i=0;i<n;i++){
			double d=deg(p[(i+n-1)%n],p[i],p[(i+1)%n]);
			ans=ans+dis(p[i],p[n])*(d);
		}
	//	cout<<"Case #"<<++cnt<<": "<<ans<<endl;
		printf("Case #%lld: %.3lf\n",++cnt,ans);
	}
	return 0;
}