Tourist level has still the same color as LGM in the chart:

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

1 | tourist | 4009 |

2 | jiangly | 3831 |

3 | Radewoosh | 3646 |

4 | jqdai0815 | 3620 |

4 | Benq | 3620 |

6 | orzdevinwang | 3529 |

7 | ecnerwala | 3446 |

8 | Um_nik | 3396 |

9 | gamegame | 3386 |

10 | ksun48 | 3373 |

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

1 | cry | 164 |

1 | maomao90 | 164 |

3 | Um_nik | 163 |

4 | atcoder_official | 160 |

5 | -is-this-fft- | 158 |

6 | awoo | 157 |

7 | adamant | 156 |

8 | TheScrasse | 154 |

8 | nor | 154 |

10 | Dominater069 | 153 |

Tourist level has still the same color as LGM in the chart:

1. If there exist a pair of adjacent vertices like $$$(u,v)$$$ such that $$$deg(u)\geq3$$$ and $$$deg(v)\geq3$$$, then remove the edge between $$$u$$$ and $$$v$$$.

2. Then, if there exist a pair of adjacent vertices like $$$(u,v)$$$ such that $$$deg(u)\geq3$$$ and $$$deg(v)\geq2$$$, then remove the edge between $$$u$$$ and $$$v$$$.

3. Then, if there exist a pair of adjacent vertices like $$$(u,v)$$$ such that $$$deg(u)\geq3$$$ and $$$deg(v)\geq1$$$, then remove the edge between $$$u$$$ and $$$v$$$.

At last, I add edges between the leaves of different components .

Why isn't it correct??

submission

1)Find the maximum number of edges. 2)Find the maximum number of cycles.

Can someone compare atcoder contests and problem levels with codeforces contest and problem levels?

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/06/2024 20:18:04 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|