编程介的小学生 2020-02-07 21:52 采纳率: 0.4%
浏览 203

Consecutive Digits 连续的数字

Problem Description
As a recruiting ploy, Google once posted billboards in Harvard Square and in the Silicon Valley area just stating “{first 10-digit prime found in consecutive digits of e}.com”. In other words, find that 10-digit sequence and then connect to the web site— and find out that Google is trying to hire people who can solve a particular kind of problem. Not to be outdone, Gaggle (a loosy-goosy fuzzy logic search firm), has devised its own recruiting problem. Consider the base 7 expansion of a rational number. For example, the first few digits of the base 7 expansion of 1/510 = 0.12541...7,33/410 = 11.15151...7, and 6/4910 = 0.06000...7, From this expansion, find the digits in a particular range of positions to the right of the "decimal" point.

Input
The input file begins with a line containing a single integer specifying the number of problem sets in the file. Each problem set is specified by four base 10 numbers on a single line, n d b e, where n and d are the numerator and
denominator of the rational number and 0 ≤ n ≤ 5,000 and 1 ≤ d ≤ 5,000. b and e are the beginning and ending positions for the desired range of digits, with 0 ≤ b,e ≤ 250 and 0 ≤ (e-b) ≤ 20. Note that 0 is the position immediately to the right of the decimal point.

Output
Each problem set will be numbered (beginning at one) and will generate a single line: Problem k: n / d, base 7 digits b through e: result where k is replaced by the problem set number, result is your computed result, and the other values are the corresponding input values.

Sample Input
4
1 5 0 0
6 49 1 3
33 4 2 7
511 977 122 126

Sample Output
Problem set 1: 1 / 5, base 7 digits 0 through 0: 1
Problem set 2: 6 / 49, base 7 digits 1 through 3: 600
Problem set 3: 33 / 4, base 7 digits 2 through 7: 151515
Problem set 4: 511 / 977, base 7 digits 122 through 126: 12425

  • 写回答

1条回答 默认 最新

  • 你知我知皆知 2024-07-26 01:55
    关注

    以下回答参考 皆我百晓生券券喵儿 等免费微信小程序相关内容作答,并由本人整理回复。

    # Import necessary packages
    library(readline)
    
    # Read input from user
    input <- readline(prompt="Enter problem set number: ")
    
    # Function to convert a string representation of a number to a numeric value
    convert_to_numeric <- function(input_string){
      # Convert string to numeric using as.numeric()
      return(as.numeric(input_string))
    }
    
    # Initialize variables for storing input data
    n <- convert_to_numeric(readline("Enter numerator: "))
    d <- convert_to_numeric(readline("Enter denominator: "))
    b <- convert_to_numeric(readline("Enter start position: "))
    e <- convert_to_numeric(readline("Enter end position: "))
    
    # Calculate the base-7 digits for the given range of positions
    result <- substr(strsplit(paste(1:n, "/", paste(d, collapse=''), sep=""), ",")[[1]][[b:e]], b:e, na.rm=TRUE)
    result <- strrep(result, ".", "")
    
    # Print the result for the current problem set
    cat(sprintf("%s/%s, base 7 digits %d through %d: %s\n", 
                 format(n/d, scientific=T), 
                 format(d, scientific=T),
                 format(b, scientific=T), 
                 format(e, scientific=T), 
                 result))
    
    # Repeat until all problem sets have been processed
    while(input != ""){
      input <- readline(prompt="Enter problem set number: ")
    }
    
    评论

报告相同问题?