zoukankan      html  css  js  c++  java
  • Poj2656(水题)

    一、Description

    Jinjin is a junior school student. Besides the classes in school, Jinjin's mother also arranges some supplementary classes for her. However, if Jinjin studies for more than eight hours a day, she will be unhappy on that day. On any day she gets unhappy, the more time she studies, the unhappier she will be. Now we got Jinjin's class schedule for the next several days and your task is to find out whether she will be unhappy on these days; if she will be unhappy, on which day she will be the unhappiest.

    Input

    There may be several test cases. In the first line of each test case, there is an integer N (1 <= N <= 7), which represents the number of days you should analyze. Then there comes N lines, each contains two non-negative integers (each smaller than 10). The first integer represents how many hours Jinjin studies at school on the day, and the second represents how many hours she studies in the supplementary classes on the same day.

    A case with N = 0 indicates the end of the input, and this case should not be processed.

    Output

    For each test case, output a line contains a single integer. If Jinjin will always be happy, the integer should be 0; otherwise, the integer should be a positive integer K, which means that Jinjin will be the unhappiest on the K-th day. If the unhappiest day is not unique, just output the earliest one among these unhappiest days.
    二、题目分析
            水题,只是做日常工作记录。
    三、Java代码
    import java.util.Scanner;
    
    
     public class Main {
    	 
         public static void main(String[] args) {
        	 Scanner cin=new Scanner(System.in);
        	 int n;
        	 int [][] arr;
        	 while((n=cin.nextInt())!=0){
        		 int sum=0;
        		 int day=0;
        		 arr=new int [n][2];
        		 for(int i=0;i<n;i++){
        			 for(int j=0;j<2;j++){
        				arr[i][j]=cin.nextInt(); 
        			 }
        			 if((arr[i][0]+arr[i][1])>sum){
        				 sum=(arr[i][0]+arr[i][1]);
        				 day=i+1;
        			 }
        		 }
        		 if(sum > 8){
        			 System.out.println(day);
        		 }else{
        			 System.out.println(0);
        		 }
        	 }
         } 
    }

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    『轉』windows文件的占用空间与文件大小
    『轉』asterisk入门连载二
    vm系統出現This Virtual Machine Appears To Be In Use的問題
    linux 7788
    鸿蒙开发板外设控制 之 实现按键“按下事件”和“释放事件”的通用框架(V0.0.1)
    【开发板试用报告】学习GPIO编程
    前言「HarmonyOS应用开发基础篇」
    【开发板试用报告】鸿蒙OS环境搭建及代码烧录
    动态设置和访问cxgrid列的Properties
    cxgrid导出excel
  • 原文地址:https://www.cnblogs.com/AndyDai/p/4734196.html
Copyright © 2011-2022 走看看