codeforces 274A. k-Multiple Free Set

最新推荐文章于 2022-05-10 12:13:04 发布

邵光亮

最新推荐文章于 2022-05-10 12:13:04 发布

阅读量241

点赞数

分类专栏： CodeForces

本文链接：https://blog.csdn.net/qq_43627087/article/details/104265892

版权

CodeForces 专栏收录该内容

253 篇文章 0 订阅

订阅专栏

Description：

A k-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by k. That is, there are no two integers $x$ and $y (x < y)$ from the set, such that $y = x \cdot k .$

You’re given a set of n distinct positive integers. Your task is to find the size of it’s largest k-multiple free subset.

Input

The first line of the input contains two integers $n$ and $k (1 ≤ n ≤ 10^5, 1 ≤ k ≤ 10^9)$ . The next line contains a list of n distinct positive integers $a_{1}, a_{2}, ..., a_{n} (1 ≤ a_{i} ≤ 10……9).$

All the numbers in the lines are separated by single spaces.

Output

On the only line of the output print the size of the largest k-multiple free subset of ${a_{1}, a_{2}, ..., a_{n}\}.$

Examples

input

6 2
2 3 6 5 4 10

output

3
Note
In the sample input one of the possible maximum 2-multiple free subsets is ${4, 5, 6\}$ .

题意：

题目就是要求从一列数中找出一个集合，让集合中的任意两个数不满足 $k$ 的倍数关系。
真是越来越菜了，这个问题都没想明白，小的肯定优先拿， $x k * x$ 相互影响， $k x$ 和 $x*k^2$ 相互影响,没 $x*k^2$ 的话 $x$ 和 $k x$ 也只能拿一个，就统一拿小的，拿 $x$ 不一定会比 $k x$ 多但一定不会少。

AC代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n, m) printf("%d %d\n", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sc(n) scanf("%c", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define ss(str) scanf("%s", str)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define mem(a, n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mod(x) ((x) % MOD)
#define gcd(a, b) __gcd(a, b)
#define lowbit(x) (x & -x)
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
    int ret = 0, sgn = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            sgn = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ret = ret * 10 + ch - '0';
        ch = getchar();
    }
    return ret * sgn;
}
inline void Out(int a) //Êä³öÍâ¹Ò
{
    if (a > 9)
        Out(a / 10);
    putchar(a % 10 + '0');
}

ll gcd(ll a, ll b)
{
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
    return a * b / gcd(a, b);
}
///快速幂m^k%mod
ll qpow(ll a, ll b, ll mod)
{
    if (a >= mod)
        a = a % mod + mod;
    ll ans = 1;
    while (b)
    {
        if (b & 1)
        {
            ans = ans * a;
            if (ans >= mod)
                ans = ans % mod + mod;
        }
        a *= a;
        if (a >= mod)
            a = a % mod + mod;
        b >>= 1;
    }
    return ans;
}

// 快速幂求逆元
int Fermat(int a, int p) //费马求a关于b的逆元
{
    return qpow(a, p - 2, p);
}

///扩展欧几里得
int exgcd(int a, int b, int &x, int &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    int g = exgcd(b, a % b, x, y);
    int t = x;
    x = y;
    y = t - a / b * y;
    return g;
}

///使用ecgcd求a的逆元x
int mod_reverse(int a, int p)
{
    int d, x, y;
    d = exgcd(a, p, x, y);
    if (d == 1)
        return (x % p + p) % p;
    else
        return -1;
}

///中国剩余定理模板0
ll china(int a[], int b[], int n) //a[]为除数，b[]为余数
{
    int M = 1, y, x = 0;
    for (int i = 0; i < n; ++i) //算出它们累乘的结果
        M *= a[i];
    for (int i = 0; i < n; ++i)
    {
        int w = M / a[i];
        int tx = 0;
        int t = exgcd(w, a[i], tx, y); //计算逆元
        x = (x + w * (b[i] / t) * x) % M;
    }
    return (x + M) % M;
}

int a[100005];
map<int, int> m;
int n, k;
int main()
{
    sdd(n, k);
    int ans = 0;
    rep(i, 1, n)
        sd(a[i]);
    sort(a + 1, a + 1 + n);
    rep(i, 1, n)
    {
        if (a[i] % k != 0 || (a[i] % k == 0 && m[a[i] / k] == 0))
        {
            m[a[i]]++;
            ans++;
        }
    }
    if (k == 1)
        ans = n;
    pd(ans);
}