2017.9.9模拟考试

T1:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define LDB double
const LDB pai = 3.141592654;
inline LDB calc(LDB x1,LDB x2,LDB y,LDB y2){
return sqrt((x1-x2)*(x1-x2)+(y-y2)*(y-y2));
}

int main(){
freopen("standing.in","r",stdin);
freopen("standing.out","w",stdout);
int T;
LDB x1,x2,y,y2,r1,r2,ans;
scanf("%d",&T);
while(T--){
cin>>x1>>y>>r1>>x2>>y2>>r2;
if(r1+r2<=calc(x1,x2,y,y2)){
ans=0;
ans=r1*r1*pai+r2*r2*pai;
printf("%.3lf\n",ans);
continue;
}
if(abs(r1-r2)>=calc(x1,x2,y,y2)){//
ans=max(r1,r2)*max(r1,r2)*pai;
printf("%.3lf\n",ans);
continue;
}
ans=r1*r1*pai+r2*r2*pai;
LDB length=calc(x1,x2,y,y2);
LDB cosA=(length*length+r1*r1-r2*r2)/(length*r1*2.0);
LDB cosB=(length*length+r2*r2-r1*r1)/(length*r2*2.0);//圆心角的余弦值
LDB A=acos(cosA),B=acos(cosB);
ans-=(A*r1*r1+B*r2*r2-r1*sin(A)*length);
printf("%.3lf\n",ans);
}
fclose(stdin);fclose(stdout);
return 0;
}

T2：

//链表暴力
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100010
int pre[MAXN],next[MAXN],n,sum,vis[MAXN],t;
int main(){
freopen("resist.in","r",stdin);
freopen("resist.out","w",stdout);
scanf("%d%d",&n,&t);
for(int i=1;i<=n;++i) pre[i]=i-1,next[i]=i+1;
pre[1]=n,next
=1;
int p,pace=1;
for(int i=1;i<n;++i){
p=pace;
for(int j=1;j<t;++j)
p=next[p];
pace=next[p],vis[p]=1;
pre[next[p]]=pre[p],next[pre[p]]=next[p];
}
for(int i=1;i<=n;++i)
if(!vis[i]){
printf("%d\n",i);
break;
}
fclose(stdin);fclose(stdout);
return 0;
}

T3：

//最大的情况很好整，最小的情况我们只要满足题目给出即可，其余的空着，注意在一个合适的位置填数字
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
#define MAXN 1010
int a[MAXN][MAXN],b[MAXN][MAXN],n,m,z[MAXN],c[MAXN];

void Get_Max(){
int sumb=0;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j){
b[i][j]=min(z[i],c[j]);
sumb+=b[i][j];
}
printf("%d\n",sumb);
}

int vz[MAXN],vc[MAXN];
void Get_Min(){
int suma=0;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(z[i]==c[j]&&!vz[i]&&
ef8c
;!vc[j]) a[i][j]=z[i],vz[i]=1,vc[j]=1;
for(int i=1;i<=n;++i)
if(!vz[i]){
for(int j=1;j<=m;++j)
if(z[i]<=c[j]&&!a[i][j]){
a[i][j]=z[i];
if(z[i]==c[j]) vc[j]=1;
break;
}
}
for(int j=1;j<=m;++j)
if(!vc[j]){
for(int i=1;i<=n;++i)
if(c[j]<=z[i]&&!a[i][j]){
a[i][j]=c[j];
break;
}
}
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
suma+=a[i][j];
printf("%d ",suma);
}

int main(){
freopen("neighbor.in","r",stdin);
freopen("neighbor.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) scanf("%d",&z[i]);
for(int i=1;i<=m;++i) scanf("%d",&c[i]);
Get_Min();
Get_Max();
fclose(stdin);fclose(stdout);
return 0;
}