zoukankan      html  css  js  c++  java
  • 函数的基本使用

    比赛打分      

      static void Main(string[] args)
            {
                int[] a = new int[6];
                int max = 0, min = 1000, sum = 0;
                //输入
                a = shuru(a);
                //比较
                max = Max(a);
                min = Min(a);
                sum = Sum(a);
                //输出
                shuchu(a, max, min, sum);
            }
            static void shuchu(int[] a, int max, int min, int sum)//输出函数式
            {
                double avg = 1.0 * (sum - max - min) / (a.Length - 2);
                Console.WriteLine("去掉一个最高分:{0}分;去掉一个最低分:{1}分;最终得分:{2}分。", max, min, avg);
            }
            static int[] shuru(int[] a)//输入函数式
            {
                for (int i = 0; i < 6; i++)
                {
                    Console.Write("请{0}号裁判输入选手得分:", i + 1);
                    a[i] = Convert.ToInt32(Console.ReadLine());
                }
                return a;
            }
            static int Max(int[] a)//比较函数式最大
            {
                int zd = 0;
                foreach (int b in a)
                {
                    if (b > zd)
                    {
                        zd = b;
                    }
                }
                return zd;
            }
            static int Min(int[] a) //比较函数式最小
            {
                int zx = 1000;
                foreach (int b in a)
                {
                    if (b < zx)
                    {
                        zx = b;
                    }
                }
                return zx;
            }
            static int Sum(int[] a)//比较函数式总和
            {
                int zf = 0;
                foreach (int b in a)
                {
                    zf = zf + b;
                }
                return zf;
            }

  • 相关阅读:
    NOJ 1116 哈罗哈的大披萨 【淡蓝】 [状压dp+各种优化]
    Codeforces Round #278 (Div. 2) B. Candy Boxes [brute force+constructive algorithms]
    noj 2069 赵信的往事 [yy题 无限gcd]
    noj 2068 爱魔法的露露 [线性扫一遍]
    Codeforces Round #275 (Div. 2) B. Friends and Presents 二分+数学
    Word2007文档中怎么输入上标下标
    Linux下查找命令
    矩阵求逆
    LRC算法在人脸识别中应用
    java从txt文档读写数据
  • 原文地址:https://www.cnblogs.com/UC0079/p/5491763.html
Copyright © 2011-2022 走看看