zoukankan      html  css  js  c++  java
  • CodeForces346 C. Number Transformation II

    C. Number Transformation II
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given a sequence of positive integers x1, x2, ..., xn and two non-negative integers a and b. Your task is to transform a into b. To do that, you can perform the following moves:

    • subtract 1 from the current a;
    • subtract a mod xi (1 ≤ i ≤ n) from the current a.

    Operation a mod xi means taking the remainder after division of number a by number xi.

    Now you want to know the minimum number of moves needed to transform a into b.

    Input

    The first line contains a single integer n (1 ≤  n ≤ 105). The second line contains n space-separated integers x1, x2, ..., xn(2 ≤  xi ≤ 109). The third line contains two integers a and b (0  ≤ b ≤  a ≤ 109a - b ≤ 106).

    Output

    Print a single integer — the required minimum number of moves needed to transform number a into number b.

     
    Examples
    input
    3
    3 4 5
    30 17
    
    output
    6
    
    input
    3
    5 6 7
    1000 200
    
    output
    206
  • 相关阅读:
    Dockerfile深度剖析
    centos 7安装jdk8
    Centos 7 修改YUM镜像源地址为阿里云镜像地址
    Fabric智能合约(余额转移样本)
    Fabric智能合约(base)
    Fabric背书策略文件编写说明
    多catch块折叠
    Frp内网穿透服务部署
    Linux常用命令合集(初级)--Centos版
    English trip EM3-LP-5A Shopping Teacher: GABRIELE
  • 原文地址:https://www.cnblogs.com/Przz/p/5409557.html
Copyright © 2011-2022 走看看