zoukankan      html  css  js  c++  java
  • CodeForces757B

    B. Bash's Big Day

    time limit per test
    2 seconds
    memory limit per test
    512 megabytes
    input
    standard input
    output
    standard output

    Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases.

    But Zulu warns him that a group of k > 1 Pokemon with strengths {s1, s2, s3, ..., sk} tend to fight among each other if gcd(s1, s2, s3, ..., sk) = 1 (see notes for gcd definition).

    Bash, being smart, does not want his Pokemon to fight among each other. However, he also wants to maximize the number of Pokemon he takes from the lab. Can you help Bash find out the maximum number of Pokemon he can take?

    Note: A Pokemon cannot fight with itself.

    Input

    The input consists of two lines.

    The first line contains an integer n (1 ≤ n ≤ 105), the number of Pokemon in the lab.

    The next line contains n space separated integers, where the i-th of them denotes si (1 ≤ si ≤ 105), the strength of the i-th Pokemon.

    Output

    Print single integer — the maximum number of Pokemons Bash can take.

    Examples

    input

    3
    2 3 4

    output

    2

    input

    5
    2 3 4 6 7

    output

    3

    Note

    gcd (greatest common divisor) of positive integers set {a1, a2, ..., an} is the maximum positive integer that divides all the integers {a1, a2, ..., an}.

    In the first sample, we can take Pokemons with strengths {2, 4} since gcd(2, 4) = 2.

    In the second sample, we can take Pokemons with strengths {2, 4, 6}, and there is no larger group with gcd ≠ 1.

    桶排数的因子

     1 //2016.01.18
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int N = 1e5+10;
    10 int book[N];
    11 
    12 int main()
    13 {
    14     int n, a;
    15     while(scanf("%d", &n) != EOF)
    16     {
    17         memset(book, 0, sizeof(book));
    18         for(int i = 0; i < n; i++)
    19         {
    20               scanf("%d", &a);
    21             for(int j = 1; j*j <= a; j++)
    22             {
    23                 if(j*j == a)
    24                       book[j]++;
    25                 else if(a%j == 0)
    26                 {
    27                     book[j]++;
    28                     book[a/j]++;
    29                 }
    30             }
    31         }
    32         int ans = 1;
    33         for(int i = 2; i < N; i++)
    34               if(book[i] > ans)
    35                   ans = book[i];
    36         printf("%d
    ", ans);
    37     }
    38 
    39     return 0;
    40 }
  • 相关阅读:
    熟悉常用的Linux操作
    Hadoop综合大作业
    理解MapReduce
    熟悉常用的Hbase操作
    第三章 熟悉常用的HDFS操作
    爬虫大作业
    数据结构化与保存
    爬取校园新闻首页的新闻
    网络爬虫基础练习
    综合练习:词频统计
  • 原文地址:https://www.cnblogs.com/Penn000/p/6298369.html
Copyright © 2011-2022 走看看