zoukankan      html  css  js  c++  java
  • JAVA 大数开方模板

    JAVA 大数开方模板

    import java.math.BigInteger;
    import java.math.*;
    import java.math.BigInteger;
    import java.util.Scanner;
    import java.util.*; 
    public class Main
    {
        public static void bigSqrt(){
             Scanner cin=new Scanner(System.in);
              String s=cin.next();
              BigInteger remain=BigInteger.ZERO;
              BigInteger odd=BigInteger.ZERO;
              BigInteger ans=BigInteger.ZERO;
    //          remain=BigInteger.ZERO;
    //          odd=BigInteger.ZERO;
    //          ans=BigInteger.ZERO;
              int group=0,k=0;
              if(s.length()%2==1)
              {
                      group=s.charAt(0)-'0';
                      k=-1;
              }
              else
              {
                      group=(s.charAt(0)-'0')*10+s.charAt(1)-'0';
                      k=0;
              }
              for(int j=0;j<(s.length()+1)/2;j++)
              {
                      if(j!=0)
                      group=(s.charAt(j*2+k)-'0')*10+s.charAt(j*2+k+1)-'0';
                      odd=BigInteger.valueOf(20).multiply(ans).add(BigInteger.ONE);
                      remain=BigInteger.valueOf(100).multiply(remain).add(BigInteger.valueOf(group));
                      int count=0;
                      while(remain.compareTo(odd)>=0)
                      {
                             count++;
                             remain=remain.subtract(odd);
                             odd=odd.add(BigInteger.valueOf(2));
                      }
                      ans=ans.multiply(BigInteger.TEN).add(BigInteger.valueOf(count));
              }
              System.out.println(ans);
            cin.close();
            return;
        }
           public static void main(String[] args) 
           {
                   Scanner cin=new Scanner(System.in);
                   //int t=cin.nextInt();
    
                       bigSqrt();
    
                  cin.close();
          }
    }
    View Code
  • 相关阅读:
    bzoj2763: [JLOI2011]飞行路线(分层图spfa)
    8.20noip模拟题
    8.19noip模拟题
    1046: [HAOI2007]上升序列(dp)
    bzoj1079: [SCOI2008]着色方案(dp)
    逆序对
    P1966 火柴排队(逆序对)
    NOIP 2015 DAY2
    8.15学校模拟
    差分
  • 原文地址:https://www.cnblogs.com/solvit/p/9651686.html
Copyright © 2011-2022 走看看