nyoj分类-数学

来源：互联网发布：用excel数据分析方法编辑：程序博客网时间：2024/05/21 16:23

#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>using namespace std;struct point{int x,y;}p[22];int cmp1(point a,point b){return a.x<b.x;}int cmp2(point a,point b){return a.y<b.y;}int main(){//freopen("d:\\test.txt","r",stdin);int n,i,m,x,y;scanf("%d",&m);while(m--){scanf("%d",&n);for(i=0;i<n;++i)scanf("%d%d",&p[i].x,&p[i].y);sort(p,p+n,cmp1);x=p[n/2].x;sort(p,p+n,cmp2);y=p[n/2].y;int sum=0;//为初始化为0..蛋疼。for(i=0;i<n;++i)sum+=fabs(x-p[i].x)+fabs(y-p[i].y);printf("%d\n",sum);}return 0;}

#include<iostream>#include<cstdio>using namespace std;int a[10086];void isprime(){int i,j;a[0]=1;a[1]=1;for(i=2;i<10086;++i)if(!a[i])for(j=i+i;j<10086;j+=i)a[j]=1;}int main(){isprime();int t;//freopen("d:\\test.txt","r",stdin);scanf("%d",&t);while(t--){int x,n,sum=0;scanf("%d",&n);while(n--){cin>>x;if(!a[x])sum+=x;}printf("%d\n",sum);}return 0;}

　　520

#include<iostream>#include<cstdio>using namespace std;int a[1000001];void isprime(){int i,j,t=1;a[1]=0;for(i=2;i<1000001;++i)if(!a[i]){a[i]=t;for(j=i+i;j<1000001;j+=i)a[j]=t;t++;}}int main(){isprime();int n,i;while(scanf("%d",&n)!=EOF)cout<<a[n]<<endl;return 0;}