Codeforces Round #400 B.Sherlock and his girlfriend

题目

Sherlock has a new girlfriend (so unlike him!). Valentine’s day is coming and he wants to gift her some jewelry.

He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, … n + 1.

Watson gave Sherlock a challenge to color these jewelry pieces such that two pieces don’t have the same color if the price of one piece is a prime divisor of the price of the other piece. Also, Watson asked him to minimize the number of different colors used.

Help Sherlock complete this trivial task.

Input
The only line contains single integer n (1 ≤ n ≤ 100000) — the number of jewelry pieces.

Output
The first line of output should contain a single integer k, the minimum number of colors that can be used to color the pieces of jewelry with the given constraints.

The next line should consist of n space-separated integers (between 1 and k) that specify the color of each piece in the order of increasing price.

If there are multiple ways to color the pieces using k colors, you can output any of them.

Examples
input
3
output
2
1 1 2

input
4
output
2
2 1 1 2

代码

#include<iostream>
 #include<algorithm>
 #include<cstring>
 using namespace std;
 int main()
 {
    int n = 0;
    cin >> n;
    int a[n+1];
    memset(a,0,sizeof(a));
    for(int i = 2;i <= n+1;i++)
    {
        if(!a[i])
        for(int j = 2;i*j <= n+1;j++)
        {
            a[i*j] = 1;
        }
    }
    if(n > 2)
    {
        cout << "2" << endl;
        for(int i = 2;i <= n+1;i++)
        {
            if(!a[i])
            cout << "2";
            else
            cout << "1";
            if(i != n+1)
            cout << " ";
        }
    }
    else
    {
        cout << "1" << endl;
        for(int i = 2;i <= n+1;i++)
        {
            cout << "1";
            if(i != n+1)
            cout << " ";
        }
    }
    return 0;
 }

理解

这个题说的是,给你几个宝石,编号从2开始往后到n+1,然后,如果一块是另一块的素因数,那么涂成不同的颜色,最多两种颜色,现在给你块数,然后问最少几种颜色,怎么涂。
这实际上就是在找质数,用埃氏筛法,把质数找出来,然后跟合数涂不同色就可以了,但要注意,n是从2开始,所以要注意一下3以下的情况。

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值