codeforce round#261（Div2）

来源：互联网发布：mysql创建存储过程例子编辑：程序博客网时间：2024/06/07 16:43

459A 我记得当时没有考虑到正负，结果在比赛快要结束的时候，把题给锁住了，立马就被别人给hack了，哎，悲剧，也是活该呀。

#include<iostream>#include<cstdio>using namespace std;int main(){    int a,b,c,d;    cin>>a>>b>>c>>d;    if(a==c)    {        if(a+d-b<=1000&&a+d-b>=-1000)           cout<<a+d-b<<" "<<b<<" "<<a+d-b<<" "<<d<<endl;        else            cout<<a+b-d<<" "<<d<<" "<<a+b-d<<" "<<b<<endl;    }    else    {        if(b==d)        {            if(b+c-a<=1000&&b+c-a>=-1000)              cout<<a<<" "<<b+c-a<<" "<<c<<" "<<b+c-a<<endl;            else               cout<<a<<" "<<b+a-c<<" "<<c<<" "<<b+a-c<<endl;        }        else        {            int u=a-c;            int v=b-d;            if(u<0) u*=-1;            if(v<0) v*=-1;            if(u==v) cout<<a<<" "<<d<<" "<<c<<" "<<b<<endl;            else cout<<"-1"<<endl;        }    }    return 0;}

459B

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#define inf 1000000011#define ma 200011using namespace std;__int64 a[ma];int main(){   __int64 n;   cin>>n;   __int64 minn=inf;   __int64 maxn=-1;   for(int i=0;i<n;i++)    {        cin>>a[i];        minn=min(minn,a[i]);        maxn=max(maxn,a[i]);    }    __int64 u=0;    __int64 v=0;    for(int i=0;i<n;i++)    {        if(a[i]==minn)            u++;        if(a[i]==maxn)            v++;    }    __int64 x=maxn-minn;    if(x==0)  printf("0 %I64d\n",n*(n-1)/2);    else    {       printf("%I64d %I64d\n",x,u*v);    }    return 0;}

0 0