zoukankan      html  css  js  c++  java
  • 欧拉工程第53题:Combinatoric selections

    package projecteuler51to60;
    
    
    class p53{    
        void solve1(){
            int count=0;
            int Max=1000000;
            int[][] table=new int[101][101];
            for(int row=0;row<=100;row++){
                table[row][0]=table[row][row]=1;
                for(int col=1;col<=row-1;++col){
                    table[row][col]=table[row-1][col]+table[row-1][col-1];
                    if(table[row][col]>Max || table[row][col]< 0){
                        ++count;
                    }
                }
            }
            System.out.println(count);
            
        }
        void solve0(){
         int count=0;
         int Max=1000000;
         boolean tag=true;
            for(int n=23;n<=100;n++){
                tag=true;
                for(int r=0;tag==true&& r<=n/2;r++){
                    long c=choose(n,r);
                    if(c>Max){
                        count+=n+1-2*r;
                        tag=false;
                    }
                }
            }
            System.out.println(count);
        }
        long choose(int n,int r){
            long res=1;
            for(int i=n-r+1;i<=n;i++)
                res*=i;
            for(int i=1;i<=r;i++)
                res/=i;
            return res;
        }
        
    }
    public class Problem53 {
    
    
        public static void main(String[] args){
            long begin= System.currentTimeMillis();
            new p53().solve1();//4075
            long end = System.currentTimeMillis();
            long Time = end - begin;
            System.out.println("Time:"+Time/1000+"s"+Time%1000+"ms");
        }
    
    }
  • 相关阅读:
    蛤圈不能圈一切---逐梦蛤蛤圈
    Unix培训基础
    java培训基础
    数据库基础
    Python生成requirements.txt方法
    免费高质量代理IP
    lxml库的xpath的使用
    python自带GUI库tkinter教程,全网最全最好
    selenium博客
    Linux-Centos下selenium部署
  • 原文地址:https://www.cnblogs.com/theskulls/p/4692337.html
Copyright © 2011-2022 走看看