Skip to main content

AppledoreM's Blog

Category: Spanning Tree Counting

BZOJ-1002: Rotavirus [FJOI2007]

2018-06-242018-06-26 appledorem Leave a comment

Problem Description: There are many variety to the rotavirus. Some of them follow the structure in the image below(graph 1.1), where there are connections between every node on the circumference with the center and with its neighbour. Specifically, we define the N-sided virus as a virus that for every pairs of nodes on the virus […]

Read More

Counter Sama

  • 48259Total Views:
  • 33505Total Vistors:
  • 2018-06-25Counter Sama's Birthday:

Popular Posts

  • Introduction to Probability and Statistics: Chapter 2
  • Effective C++ : Chapter 4 Note
  • Codeforces Round 568 Div2 E, F, G Note
  • String Problems: KMP & Manacher Algorithms
  • Effective C++ : Chapter 5 Note
  • Codeforces Round514 Div2 D & E
  • AP European History Note
  • Effective C++:Chapter 2 Note
  • BZOJ-1002: Rotavirus [FJOI2007]
  • Introduction to Probability and Statistics: Chapter 1

Recent Posts

  • Effective C++ : Chapter 5 Note
  • Effective C++ : Chapter 4 Note
  • Effective C++:Chapter 3 Note
  • Effective C++:Chapter 2 Note
  • Effective C++:Chapter 1 Note

All Categories

AC Automaton AP European History AtCoder Bit Mask BZOJ C++ Codeforces DFS DP Effective C++ Third Edition Note Expectancy Graph Theory Greedy HDU Introduction To Probability and Statistics Introductory Combinatorics LuoGu Math Mathematics Maximum-Flow Minimum Cost Flow Miscellaneous Monotonic Queue Note OI SBT Spanning Tree Counting String Problem Suffix Arrary Tree DP

Friends

  • Menci
  • sparkling Theme by Colorlib Powered by WordPress
     

    Loading Comments...