Codeforces776B

Codeforces776B

题目：
B. Sherlock and his girlfriend
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
Note
In the first input, the colors for first, second and third pieces of jewelry having respective prices 2, 3 and 4 are 1, 1 and 2 respectively.

In this case, as 2 is a prime divisor of 4, colors of jewelry having prices 2 and 4 must be distinct.

B题，水体一道，题意是给你n个数，每个数i的value是i+1，为这n个数涂色，如果两个数一个是另一个的素因子则他们必须涂上不同的颜色，问最少要几种颜色以及每个i对应涂上什么颜色

只要把所有的素数都涂上一种颜色，所有非素数涂上另一种颜色即可，先预处理用素数筛法筛出所有素数

AC代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <set>
#include <queue>
#include <stack>
using namespace std;
int a[100005];
int main()
{
    memset(a,0,sizeof(a));
    for(int i=2;i<100005;i++){
        if(!a[i]){
            for(int j=i+i;j<100005;j+=i){
                a[j]++;
            }
        }
    }
    int n;
    while(scanf("%d",&n)!=EOF){
        int first=0;
        if(n>2) printf("2\n");
        else printf("1\n");
        for(int i=2;i<=n+1;i++){
            if(first++) printf(" ");
            if(a[i]) printf("2");
            else printf("1");
        }
        printf("\n");
    }
    return 0;
}