和風いろはちゃんイージー / Iroha and Haiku (ABC Edition) （水水）

题目链接：http://abc042.contest.atcoder.jp/tasks/abc042_a

Time limit : 2sec / Memory limit : 256MB

Score : 100 points

Problem Statement

Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.

To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.

Constraints

• 1≦A,B,C≦10

---

Input

The input is given from Standard Input in the following format:

A B C

Output

If it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.

---

Sample Input 1

Copy

5 5 7

Sample Output 1

Copy

YES

Using three phrases of length 5, 5 and 7, it is possible to construct a Haiku.

---

Sample Input 2

Copy

7 7 5

Sample Output 2

Copy

NO

 题解：看三个数的和是否能整除（5+5+7==14）

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
bool cmp(int x,int y)
{
    return x>y;
}
const int N=10005;
const int mod=1e9+7;
int main()
{
    std::ios::sync_with_stdio(false);
    int a,b,c;
    cin>>a>>b>>c;
    if((a+b+c)%17==0) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}