java stl 和一些打包好的数学板子

class usemap
{
    HashSet<String> set = new HashSet<String>();
    HashMap<Integer,String> map = new HashMap<Integer,String>();
    public void us()
    {
        set.add("df");//添加
        set.add("df");
        set.add("dsfdsf");
        set.add("dffgfg");
        if(set.contains("dffgfg"))//判断是否存在
        {
            System.out.println("cunzai");
        }else
        {
            System.out.println("bucunzai");
        }
        set.remove("dffgfg");//删除

        for(String name :set)///遍历set
        {
            System.out.println(name);
        }

        set.clear();//清空
    }
    public void usmp()
    {
        //添加映射
        map.put(1, "dfsa");
        map.put(2, "dfdfff");
        map.put(3, "dfsafgggg");
        map.put(4, "gfdfg");
        map.put(5, "dfsaa");
        System.out.println(map.get(5));///访问map的key 获取他的值 =get(key)
        if(map.containsKey(6))///判断key是存在
        {
            System.out.println("存在");
        }else
        {
            System.out.println("不存在");
        }
        map.remove(6);
        //最高效遍历map的方法
        for(HashMap.Entry<Integer,String> entry:map.entrySet())
        {
            System.out.println(entry.getKey()+" "+entry.getValue());
        }
        //for(HashMap.Entry<Integer,String> entry:map.entrySet())
        map.clear();
    }
}

class Maths
{
    public int gcd(int a,int b)//求gcd  lcm = n*m/gcd(n,m);
    {
        if(b==0)
        {
            return a;
        }else
        {
            return gcd(b,a%b);
        }                   
    }

    public final int maxn = 1000 + 10;
    public int[] vis = new int[maxn];

    public void prime()
    {
        vis[0] = vis[1] = 1;
        for(int i = 2;i*i<=maxn;i++)
        {
            if(vis[i]==0)
            {
                for(int j= i*i;j<=maxn;j+=i)
                {
                    vis[j] = 1;
                }
            }
        }
        for(int i = 2;i<=maxn;i++)
        {
            if(vis[i]==0)
            {
                System.out.println(i);
            }
        }
    }
    //mod的性质，如果两个相减%运算 (a-b+mod)%mod
    public int pow_mod(int a,int b,int mod)///带mod计算a^b 时间复杂度log(n) 递归
    {
            if(b==0)
            {
                return 1%mod;
            }
           int temp = 0;
           temp = pow_mod(a,b/2,mod);
           temp = temp * temp % mod;
           if(b%2==1)
           {
               temp = a * temp;
           }
           return temp;
    }

    public int pow_mod1(int a,int b,int mod)//带mod计算a^b 时间复杂度log(n) 循环
    {
        int res = 1;
        int temp = a;
        for(;b!=0;b/=2)
        {
            if((b&1)!=0)
            {
                res  = res*temp%mod;
            }
            temp = temp * temp %mod;
        }
        return res;
    }
    //组合数c(n,m)
    public void zuheshu(int n,int m)
    {
        int[][] c = new int[maxn+10][maxn+10];
        for(int i = 0;i<=maxn;i++)
        {
            c[i][0] = 1;
            c[0][i] = 0;
        }
        for(int i = 1;i<=maxn;i++)
        {
            for(int j = 1;j<=maxn;j++)
            {
                c[i][j] = c[i-1][j] + c[i-1][j-1];
            }
        }
        System.out.println(c[n+1][m]);///计算c(n,m)输出一个c(n+1,m)的值
    }
}