[daily question in summer] Luogu p6850 Noi

Topic link ：P6850 NOI - Luogu | New ecology of computer science education (luogu.com.cn)

Background

Small L It's a vegetable chicken .

Nothing small L Yes NOI examination room .

Title Description

Because of the small L Don't count , Now small L Told you his score and team line for each question , Please tell him whether to join the team .

NOI The score is calculated as ：

1. The basis of written examination is 50  branch , Add 1  branch .
2. The actual score is the score of each question plus the score of the written examination .
3. If it is A class , The total score is added on this basis 5  branch .

Input format

Input 9  Number a,b,c,d,e,f,g,h,i, It respectively represents the number of questions passed in the written examination , D1T1,D1T2,D1T3,D2T1,D2T2,D2T3 score , whether A class （ yes 1, No 0）, The score line of the training team .

Output format

Output a string one line .

If you join the training team , The output AKIOI.

If not , Output AFO.

Examples #1

The sample input #1

50 50 72 56 100 40 0 1 446

Sample output #1

AFO

Examples #2

The sample input #2

50 95 100 64 100 72 30 0 446

Sample output #2

AKIOI

Tips

「 Sample explanation 」

The first example is the retired chicken L Of NOI2020 achievement .

The second one is from a certain player NOI2020 achievement .

Didn't you explain anything

「 Data scope and description 」

This question adopts the bundling test . Only through one Subtask In order to get this Subtask The scores of .

- Subtask 1(30 points)：h = 0,a = 50,i = 700;
- Subtask 2(30 points)：h = 0,a = 50;
- Subtask 3(40 points)： No special restrictions .

For all the data ,0 <= a <= 50,0 <= b,c,d,e,f,g <= 100,0 <= h <= 1,205 <= i <= 705.

No consideration is given here to section 50  The situation of the same name , It can be considered that if the same score is small L first .

There is no guarantee that the test data is true .

AC code:

#include<iostream>

using namespace std;

int main()
{
    int a1,a2,a3,a4,a5,a6,a7,a8,a9;
    cin>>a1>>a2>>a3>>a4>>a5>>a6>>a7>>a8>>a9;
    if(50+a1+a2+a3+a4+a5+a6+a7+a8*5 >= a9)
        cout<<"AKIOI";
    else
        cout<<"AFO";
    
    return 0;
}