zoukankan      html  css  js  c++  java
  • c# 穷举

    //穷举
     int m=0;
                    for (int i = 1; i <=200/15; i++)
                    {
                        for (int j = 1; j <=200/3 ; j++)
                        {
                            for (int k = 1; k < 200/2; k++)
                            {
                                if (15*i+3*j+2*k==200)
                                {
                                    Console.WriteLine(i+"副拍子," + j + "个球,"+k+"瓶水;");
                                    m++;
                                }
                            }
                        }
                    }
                    Console.WriteLine("总共有"+m+"种可能");

                    Console.ReadKey();

  • 相关阅读:
    return, break, continue
    equals 与 ==
    过滤器
    通过域名区分虚拟主机
    通过端口区分不同虚拟机
    Nginx实现反向代理
    Nginx安装
    poj2387 Til the Cows Come Home(Dijkstra)
    hdoj2544 最短路(Dijkstra || Floyd || SPFA)
    最小生成树
  • 原文地址:https://www.cnblogs.com/lovesy2413/p/4310590.html
Copyright © 2011-2022 走看看