zoukankan      html  css  js  c++  java
  • 教练打分

    //教练打分             //            int[] a = new int[10];             //            for (int i = 1; i <= 10;i ++ )             //            {             //                Console.Write("请给第{0}个球员打分", i);             //                a[i - 1] = Convert.ToInt32(Console.ReadLine());             //            }             //            for (int i = 0; i <10; i ++ )             //            {             //                Console.WriteLine("第{0}个球员的得分为{1}",i +1,a[i ]);             //            }             //            int max = 0; int min = 1000;             //            int max_no = 0; int min_no = 0;             //            for (int i = 0; i < 10;i ++ )             //            {             //                if (a[i]>max )             //               {             //                   max = a[i];             //                   max_no = i+1;             //               }             //                if (a[i]<min )             //                {             //                    min = a [i];             //                    min_no = i + 1;             //                }

                //            }             //            Console.Write("最高分为第{0}个球员的{1}分,最低分为第{2}个球员的{3}分", max_no, max, min_no, min);             //double  sum = 0;             //            for (int i =0;i <10;i ++)             //{             //                sum =sum +a [i ];             //}             //            Console.WriteLine("平均得分为"+sum /10);             //教练打分

  • 相关阅读:
    linux下解除端口占用
    设计模式(二)观察者模式
    设计模式(一) 策略模式
    loj #6235. 区间素数个数
    loj #2013. 「SCOI2016」幸运数字
    loj #6014. 「网络流 24 题」最长 k 可重区间集
    loj #6013. 「网络流 24 题」负载平衡
    loj #2255. 「SNOI2017」炸弹
    loj #2051. 「HNOI2016」序列
    loj #6122. 「网络流 24 题」航空路线问题
  • 原文地址:https://www.cnblogs.com/naqiang/p/5490961.html
Copyright © 2011-2022 走看看