codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

776B.md (1670B)


      1 Source: https://codeforces.com/problemset/problem/776/B
      2 
      3 B. Sherlock and his girlfriend
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
     22 
     23 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.
     24 
     25 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.
     26 
     27 Help Sherlock complete this trivial task.
     28 
     29 Input
     30 
     31 The only line contains single integer *n* (1 ≤ *n* ≤ 100000) — the number of jewelry pieces.
     32 
     33 Output
     34 
     35 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.
     36 
     37 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.
     38 
     39 If there are multiple ways to color the pieces using *k* colors, you can output any of them.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3
     47 ```
     48 
     49 Output
     50 
     51 ```
     52 2  
     53 1 1 2
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 4
     60 ```
     61 
     62 Output
     63 
     64 ```
     65 2  
     66 2 1 1 2
     67 ```
     68 
     69 Note
     70 
     71 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.
     72 
     73 In this case, as 2 is a prime divisor of 4, colors of jewelry having prices 2 and 4 must be distinct.