Competition starts at 21 July 20:10

May the Force be with you!

**[Ads mode on]** Nothing to do before a match? Try bombermine **[Ads mode off]**

# | User | Rating |
---|---|---|

1 | tourist | 3748 |

2 | Benq | 3540 |

3 | Petr | 3470 |

4 | Radewoosh | 3355 |

5 | ecnerwala | 3347 |

6 | maroonrk | 3345 |

7 | jiangly | 3324 |

8 | scott_wu | 3313 |

9 | ainta | 3298 |

10 | boboniu | 3289 |

# | User | Contrib. |
---|---|---|

1 | 1-gon | 200 |

2 | Errichto | 196 |

3 | rng_58 | 194 |

4 | SecondThread | 186 |

5 | awoo | 185 |

6 | Um_nik | 182 |

7 | vovuh | 179 |

8 | Ashishgup | 176 |

9 | maroonrk | 174 |

10 | -is-this-fft- | 173 |

Competition starts at 21 July 20:10

May the Force be with you!

**[Ads mode on]** Nothing to do before a match? Try bombermine **[Ads mode off]**

Let my contribution to increase.

Competition will held at 9 february 16:00 GMT (20:00 Saratov).

May the Force be with you!

It's time to restore my contrib points.

One person from Russian Code Cup finalists said that he code slow in early morning. We have a chance, don't miss it!

Competition will held at 18:00 EDT (5:00 Moscow)

May the Force be with you!

Coding begins in 12:00 PM EDT (20:00 Moscow time)

May the Force be with you!

P.S. Discuss it here and increase my contrib.

Congratulations to Petr Mitrichev impressive victory!

We need to assign some number from 0 to 6 to each of the 14 squares. Note that if you take the solution and apply some permutation of digits to the field, you obtain another correct solution. So, the solution is characterized by division of 14 squares to pairs. If we have such a partition, then it is possible to generate a 7! corresponding solutions. Count of possible partitions is 13!! = 13·11·9·7·5·3 = 135135 . It is easily to verify the correctness for each of the 100k options.

With up to rotations, count of all field configurations that have solutions is about 6000. The largest number of solutions - 22·7!.

Подколки:

1) If you do not optimize the solution in 7! time, you can get a TL. As was shown in the comments it’s enough to optimize 7 times.

2) You would think that the squares are divided into two classes - 7 squares that have double dominoes, and 7, in which it is not present. If we talk in terms of graphs there are 7 vertices with degree 2, and 7 with degree of 4. Clearly, two vertices of degree 2 can not correspond to a single digit, otherwise we get two double dominoes. With this division is sufficient to iterate over 7! possible matches vertices of the second type to vertices of the first type.

Double domino 4-4 split between the two squares. There are 6 vertices of degree 2 and 8 vertices of degree. Challenge Succeeded.

Furthermore:

Here for two double dominoes lie between squares!

And bonus, one of the most beautiful configurations with several holes:

Disconnected configuration with solutions don’t exist :(

Tutorial of Yandex.Algorithm 2011: Finals

> The IPSC 2011 contest will be held from June 5, noon CEST to June 5, 5:00 pm CEST.

I inspired by team "Never Retired" and Problem Q from practice,

Team list

Onine standings

Lets discuss it here, but not in the time of event.

Member single round match 501 will start at 3.00 PM Moscow, 12:00 AM GMT.

Discuss it here.

Discuss it here.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/28/2021 13:25:22 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|