zoukankan      html  css  js  c++  java
  • 4.18作业 青歌赛

     //青歌赛
                //int[] a = new int[20];
                //for (int i = 1; i <= 20;i ++ )
                //{
                //    Console.WriteLine("请给这位选手打分:");
                //   a [i-1 ] = Convert .ToInt32 ( Console.ReadLine());

                //}
                //int max = 0;int min = 1000;
                //for (int i = 1; i <= 20; i ++ )
                //{
                //    if (a[i - 1] > max)
                //    {
                //        max = a[i - 1];

                //    }
                //    if (a [i -1]<min )
                //    {
                //        min = a[i - 1];

                //    }

                //}
                //Console.WriteLine("去掉一个最高分{0},去掉一个最低分{1}", max, min);

                //double  sum = 0;
                //for (int i = 0; i < 20; i++)
                //{
                //    sum = sum + a[i];
                //}
                //Console.WriteLine("这位选手的最终成绩是"+(sum-min -max )/18 );
                //青歌赛

  • 相关阅读:
    无限维
    黎曼流形
    why we need virtual key word
    TOJ 4119 Split Equally
    TOJ 4003 Next Permutation
    TOJ 4002 Palindrome Generator
    TOJ 2749 Absent Substrings
    TOJ 2641 Gene
    TOJ 2861 Octal Fractions
    TOJ 4394 Rebuild Road
  • 原文地址:https://www.cnblogs.com/qz1234/p/5409951.html
Copyright © 2011-2022 走看看