ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) B
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.
The only line contains single integer n (1 ≤ n ≤ 100000) — the number of jewelry pieces.
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.
3
2
1 1 2
4
2
2 1 1 2
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.
题意:将数字染色,如果有一个相同的素数除数,则颜色不同,使得颜色种类最少
解法:
1 素数颜色1,其他颜色2
2 看样列怎么想也就两种(不过n<=2就是一种)
#include<bits/stdc++.h>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
map<int,int>Mp;
int main(){
int n;
cin>>n;
if(n<=){
cout<<""<<endl;
for(int i=;i<=n;i++){
cout<<"1 ";
}
return ;
}
n=n+;
for(int i=;i<=n;i++){
for(int j=i+i;j<=n;j+=i){
Mp[j]=;
}
}
cout<<""<<endl;
for(int i=;i<=n;i++){
if(Mp[i]){
cout<<Mp[i]<<" ";
}else{
cout<<"1 ";
}
}
return ;
}
最新文章
- python之路二十
- Apache+Mod_Python配置
- 英语语法 It all started the summer before second grade when our moving van pulled into her neighborhood
- vs多项目模板及add-in开发
- HDU 5433 Xiao Ming climbing dp
- JLOI 2013 卡牌游戏
- 通过jpegoptim批量压缩文件
- Qt写一个截屏工具(窗口透明)
- C#函数式编程-序列
- linux 安装sysstat使用iostat、mpstat、sar、sa
- prop()、attr()和data()
- Javascript闭包与作用域this
- 一起学爬虫——使用selenium和pyquery爬取京东商品列表
- js变速动画函数封装 回调函数及层级还有透明度
- mybatis泛型(一)
- 将Linux(ubuntu)安装到U盘上,实现即插即用
- vue和react动画区别
- [SoapUI] 在SoapUI中通过Groovy脚本执行window命令杀掉进程
- HTML5中的跨文档消息传递
- perf使用示例1