zoukankan      html  css  js  c++  java
  • 计分员程序

       一、分析需求

                     1、记录现场比分增长

                     2、每一次比分的增长都需记录

     二、功能

                     1、记录球队总得分

                     2、记录每球得分队员                 3、存储所有数据

    PSP Personal Software Process Stages Time Senior Student Time
    Planning 计划    
    .Estimate 估计这个任务需要多少时间 8h 6.4h
    Development 开发 5.2h 6.4h
    .Analysis 需求分析  10min 10min
    .Design Spec 生成设计文档 20min 22min
    .Design Review 设计复审 8min 7min
    .Coding Standard 代码规范 12min 15min
    .Design 具体设计 40min 43min
     .Coding 具体编码 3h 3.5h
    .Code Review 代码复审 30min 39min
     .Test 测试(自我测试,修改代码,提交修改) 10min 21min
    Reporting 报告 9min 15min
    . 测试报告 3min 7min
    . 计算工作量 2min 5min
    . 并提出过程改进计划 3min 3min

     三、部分代码如下

     private void button4_Click(object sender, EventArgs e)      

       {           

                int shu = int.Parse(dianqiu.Text.Trim().ToString());         

                defen df = new defen();          

               dianqiu.Text= df.defen1(shu).ToString();         }

            private void button7_Click(object sender, EventArgs e)       

      {          

               int shu = int.Parse(faqiu.Text.Trim().ToString());          

               defen df = new defen();           

              faqiu.Text=df.defen1(shu).ToString();         }

            private void button10_Click(object sender, EventArgs e)       

      {          

              int shu = int.Parse(kouqiu.Text.Trim().ToString());           

              defen df = new defen();           

               kouqiu.Text=df.defen1(shu).ToString();     

        }

            private void button13_Click(object sender, EventArgs e)     

        {          

            int shu = int.Parse(moqiu.Text.Trim().ToString());        

              defen df = new defen();          

            moqiu.Text=  df.defen1(shu).ToString();       

      }

                    

  • 相关阅读:
    47. Permutations II
    56. Merge Intervals
    57. Insert Interval
    常见算法问题
    67. Unique Paths
    版权声明
    121. Best Time to Buy and Sell Stock
    Leetcode backtracking 合集
    转载 int和string 类型的互换
    prim算法,克鲁斯卡尔算法---最小生成树
  • 原文地址:https://www.cnblogs.com/hh1234/p/6562039.html
Copyright © 2011-2022 走看看