hdu 5655 CA Loves Stick

Hdu 5655CA Loves Stick

　　先对四条边排序,若最小的边为0,则输出No(一开始把No和Yes写成了NO和YES,wa了n次)

　　　　再判断a[2]+a[1]+a[0]>a[3];满足则能构成四边形,注意此处会爆long long,可以采用减来判断,

　　　　a[3]-a[2]-a[1]<a[0];

　　　　或者用unsigned long long ,则可改判断条件为a[3]-a[2]<a[1]+a[2];

　　　　long long范围:  -2^63-1到2^63-1

　　　　unsigned long long: 0到2^64-1

　　　　

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define in(n) scanf("%d",&(n))
#define in2(x1,x2) scanf("%d%d",&(x1),&(x2))
#define inll(n) scanf("%I64d",&(n))
#define inll2(x1,x2) scanf("%I64d%I64d",&(x1),&(x2))
#define inlld(n) scanf("%lld",&(n))
#define inlld2(x1,x2) scanf("%lld%lld",&(x1),&(x2))
#define inf(n) scanf("%f",&(n))
#define inf2(x1,x2) scanf("%f%f",&(x1),&(x2))
#define inlf(n) scanf("%lf",&(n))
#define inlf2(x1,x2) scanf("%lf%lf",&(x1),&(x2))
#define inc(str) scanf("%c",&(str))
#define ins(str) scanf("%s",(str))
#define out(x) printf("%d
",(x))
#define out2(x1,x2) printf("%d %d
",(x1),(x2))
#define outf(x) printf("%f
",(x))
#define outlf(x) printf("%lf
",(x))
#define outlf2(x1,x2) printf("%lf %lf
",(x1),(x2));
#define outll(x) printf("%I64d
",(x))
#define outlld(x) printf("%lld
",(x))
#define outc(str) printf("%c
",(str))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(X,Y) memset(X,Y,sizeof(X));
typedef vector<int> vec;
typedef long long ll;
typedef pair<int,int> P;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const int INF=0x3f3f3f3f;
const ll mod=1e9+7;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
const bool AC=true;
long long int a[4];
int main(){
    int t;
    in(t);
    while(t--) {
        rep(i,0,4)
        cin>>a[i];
        sort(a,a+4);
        if(a[0]==0) printf("No
");
        else{
        if(a[3]-a[2]-a[1]<a[0])
        printf("Yes
");
        else
         printf("No
");
    }
    }
    return 0;
}

或者

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define in(n) scanf("%d",&(n))
#define in2(x1,x2) scanf("%d%d",&(x1),&(x2))
#define inll(n) scanf("%I64d",&(n))
#define inll2(x1,x2) scanf("%I64d%I64d",&(x1),&(x2))
#define inlld(n) scanf("%lld",&(n))
#define inlld2(x1,x2) scanf("%lld%lld",&(x1),&(x2))
#define inf(n) scanf("%f",&(n))
#define inf2(x1,x2) scanf("%f%f",&(x1),&(x2))
#define inlf(n) scanf("%lf",&(n))
#define inlf2(x1,x2) scanf("%lf%lf",&(x1),&(x2))
#define inc(str) scanf("%c",&(str))
#define ins(str) scanf("%s",(str))
#define out(x) printf("%d
",(x))
#define out2(x1,x2) printf("%d %d
",(x1),(x2))
#define outf(x) printf("%f
",(x))
#define outlf(x) printf("%lf
",(x))
#define outlf2(x1,x2) printf("%lf %lf
",(x1),(x2));
#define outll(x) printf("%I64d
",(x))
#define outlld(x) printf("%lld
",(x))
#define outc(str) printf("%c
",(str))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(X,Y) memset(X,Y,sizeof(X));
typedef vector<int> vec;
typedef long long ll;
typedef pair<int,int> P;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const int INF=0x3f3f3f3f;
const ll mod=1e9+7;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
const bool AC=true;
unsigned long long  a[4];
int main(){
    int t;
    in(t);
    while(t--) {
        rep(i,0,4)
        cin>>a[i];
        sort(a,a+4);
        if(a[0]==0) printf("No
");
        else{
        if(a[3]-a[2]<a[1]+a[0])
        printf("Yes
");
        else
         printf("No
");
    }
    }
    return 0;
}