• ZOJ 3927 Programming Ability Test


    Programming Ability Test (PAT) aims to evaluate objectively, through unified examinations with automatic online judging system, the abilities of testees in programming and algorithm design, hence to evaluate scientifically the programming talents, and to provide the enterprises a reference standard for personnel selection.

    The alliance enterprises may have their specific green channel preferential conditions listed at the PAT registration website. Some enterprises also provide “Letter of Introduction” for the testees to download and submit to the human resource department together with the PAT certificate when seeking employments.

    Recently, Edward Co.,LTD joins PAT Alliance and sets their green channel preferential conditions to 80 points of PAT Advanced Level. That means you can enter the green channel if you get 80 points or above on PAT Advanced Level. Now Edward Co.,LTD gets the result of all examinees, please tell them whether the examinee can get the chance of entering green channel.

    Input

    There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

    The only line contains four integers ScoreAScoreBScoreC, and ScoreD - the four problems' score of the examinee.(0 <= ScoreA <= 20, 0 <= ScoreBScoreC <= 25, 0 <= ScoreD <= 30)

    Output

    For each test case, if the examinee gets 80 points or above in total, output "Yes", else output "No".

    Sample Input

    4
    0 0 5 30
    20 25 20 0
    20 25 20 15
    20 25 25 30
    

    Sample Output

    No
    No
    Yes
    Yes
    
    
    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <stdio.h>
    #include <algorithm>
    #include <math.h>
    #include <queue>
    
    using namespace std;
    int t;
    int a,b,c,d;
    int main()
    {
    	int t;
    	while(scanf("%d",&t)!=EOF)
    	{
    	while(t--)
    	{
    		scanf("%d%d%d%d",&a,&b,&c,&d);
              if(a+b+c+d>=80)
    			  printf("Yes
    ");
    		  else	
    			  printf("No
    ");
    	}
    	}
    	return 0;
    }

    
       
    
    
  • 相关阅读:
    22.112.leetcode_path_sum
    21.leetcode111_minimum_depth_of_binary_tree
    20.leetcode110_balanced_binary_tree
    19.leetcode108_convert_sorted_array_to_binary_search_tree
    论文阅读 | RoBERTa: A Robustly Optimized BERT Pretraining Approach
    CheckList:ACL 2020 Best Paper
    激活函数综述
    盘点深度学习中的损失函数
    逻辑回归
    机器学习之参数估计
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228730.html
Copyright © 2020-2023  润新知