You are given a biconnected graph. The task is to find minimum number of edges that you need to delete that makes the graph has at least one articulation point.

(I'm sorry if this was asked before, and if it is, please post link to that topic)

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

1 | tourist | 3686 |

2 | LHiC | 3336 |

3 | wxhtxdy | 3329 |

4 | Benq | 3311 |

5 | Um_nik | 3301 |

6 | V--o_o--V | 3275 |

7 | Radewoosh | 3268 |

8 | yutaka1999 | 3190 |

9 | ainta | 3180 |

10 | Petr | 3115 |

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

1 | Errichto | 193 |

2 | Radewoosh | 184 |

3 | rng_58 | 164 |

3 | PikMike | 164 |

5 | Vovuh | 159 |

6 | majk | 154 |

7 | 300iq | 153 |

8 | Um_nik | 148 |

9 | Petr | 147 |

10 | neal | 144 |

You are given a biconnected graph. The task is to find minimum number of edges that you need to delete that makes the graph has at least one articulation point.

(I'm sorry if this was asked before, and if it is, please post link to that topic)

I don't know if this was already asked before.(I'm sorry if this was already asked)

You are given positive integers a,b,c,d where a,b,c,d <= 10^9

Find the minimum sum of non-negative integers x,y,z that satisfy(if possible)

ax+by+cz = d

I tried using Diophantine's Equation but I still can't find way out @_@

Is there a way to prove/disprove that you can always make a binary string length 2^k+k-1 that contain all permutations of binary string length k as substring?

Originally, i just want to get the shortest strings that contains all permutations of binary strings length k.

For example:

For k=2, you can get 00110 (contains 00,01,10,11 as substrings)

For k=3, you can get 0111010001 (contains 000,001,010,011,100,101,110,111 as substrings)

For k=4, you can get 0000100110101111000

(Im sorry if my english is bad T^T)

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/23/2019 15:46:57 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|