zoukankan      html  css  js  c++  java
  • HDOJ 2131 Probability

    Problem Description
    Mickey is interested in probability recently. One day , he played a game which is about probability with mini.First mickey gives a letter and a word to mini.Then mini calculate the probability that the letter appears in the word.For example,give you the letter “a” and the word “apple”. the probability of this case is 0.20000.

    Input
    The input contains several test cases. Each test case consists of a letter and a word.The length of the word is no longer than 200.

    Output
    For each test case, print the probability rounded to five digits after the decimal point.

    Sample Input
    a apple
    c Candy
    a banana

    Sample Output
    0.20000
    0.20000
    0.50000

    题意:
    先输入一个字符,再输入一个字符串,然后输出该字符在字符串中占多少比例;保留5位小数。
    属于简单题。

    import java.util.Scanner;
    
    public class Main {
        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            while(sc.hasNext()){
                String a = sc.next();
                String strs = sc.next();
                int anum = 0;
                String strss = "";
                for(int i=0;i<strs.length();i++){
                    strss = strs.charAt(i)+"";
                    if(a.equalsIgnoreCase(strss)){
                        anum++;
                    }
                }
                double num = (double)((double)anum/(double)strs.length());
                System.out.printf("%.5f	
    ",num);
            }
        }
    }
    
  • 相关阅读:
    [转]Splay算法
    [转]模拟退火算法
    [转]九种背包问题
    [转]C++实现平衡二叉树
    关于set
    __builtin_popcount
    为什么调用线程的join方法,等待的是执行join方法的线程
    volatile and 指令重排序 (单例模式用volatile来声明单例对象)
    线程池
    sts 转用 IDEA随记
  • 原文地址:https://www.cnblogs.com/webmen/p/5739357.html
Copyright © 2011-2022 走看看