zoukankan      html  css  js  c++  java
  • hdu 2117:Just a Numble(水题,模拟除法运算)

    Just a Numble

    Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 2107    Accepted Submission(s): 987


    Problem Description
    Now give you two integers n m, you just tell me the m-th number after radix point in 1/n,for example n=4,the first numble after point is 2,the second is 5,and all 0 followed
     
    Input
    Each line of input will contain a pair of integers for n and m(1<=n<=10^7,1<=m<=10^5)
     
    Output
    For each line of input, your program should print a numble on a line,according to the above rules
     
    Sample Input
    4 2
    5 7
    123 123
     
    Sample Output
    5
    0
    8
     
    Author
    YBB
     
    Source
     
    Recommend
    威士忌   |   We have carefully selected several similar problems for you:  2114 2115 2116 2113 2119 
     

     
      水题,但也要动动脑子。
      模拟除法的运算。输入两个数n和m,求出1/n的小数点后的第m位数。
      代码:
     1 #include <iostream>
     2 
     3 using namespace std;
     4 int main()
     5 {
     6     int n,m;
     7     while(cin>>n>>m){
     8         if(n==1){
     9             cout<<0<<endl;
    10             continue;
    11         }
    12         int num = 10;
    13         int d = 0;
    14         int dn = 0;
    15         while(d!=m){
    16             dn = num/n;
    17             num = num%n;
    18             num*=10;
    19             ++d;
    20         }
    21         cout<<dn<<endl;
    22     }
    23     return 0;
    24 }

    Freecode : www.cnblogs.com/yym2013

  • 相关阅读:
    hdu5412CRB and Queries
    LCA rmq st model
    HDU 5348 MZL's endless loop
    2015多校联合训练赛 Training Contest 4 1008
    Bestcoder Tom and matrix
    TOJ 4105
    Codeforces D. Iahub and Xors
    Set 技巧之一
    1036: [ZJOI2008]树的统计Count
    一点点VIM
  • 原文地址:https://www.cnblogs.com/yym2013/p/3591627.html
Copyright © 2011-2022 走看看