It appears that I can't see any profile picture on anyone's profile, except for my profile picture in the right side of the screen as you can see in the image below. Is it broken only for me?

Before contest

Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition)

31:17:59

Register now »

Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition)

31:17:59

Register now »

*has extra registration

Before contest

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)

31:17:59

Register now »

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)

31:17:59

Register now »

*has extra registration

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

1 | tourist | 3739 |

2 | Petr | 3400 |

3 | moejy0viiiiiv | 3282 |

4 | W4yneb0t | 3141 |

5 | mnbvmar | 3122 |

6 | matthew99 | 3100 |

7 | ainta | 3051 |

8 | rng_58 | 3030 |

9 | LHiC | 2997 |

10 | V--o_o--V | 2980 |

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

1 | Errichto | 169 |

2 | Petr | 163 |

3 | rng_58 | 160 |

4 | Zlobober | 153 |

5 | Swistakk | 149 |

5 | zscoder | 149 |

7 | Um_nik | 147 |

8 | GlebsHP | 145 |

8 | csacademy | 145 |

10 | Edvard | 141 |

I am given a undirected (multi-)graph with N vertices and M edges. I have to find a cycle of minimum cost in this graph and then print the vertices in their traversal order. Also, I can't use the same edge twice.

In the following example the numbers on the first line represent N and M. On each of the following M lines there are 3 numbers: x, y and c, meaning that there is an undirected road between x and y with cost c.

```
5 7
1 4 1
1 3 300
3 1 10
1 2 16
2 3 100
2 5 15
5 3 20
Answer:
1 3 5 2 1
```

I am trying to solve this problem in which I am given a number n, representing the number of vertexes in a undirected graph. On the next line there are n natural numbers representing the degree of the respective vertex. I am asked to find the edges, such that the graph is connected.

n<=5000 and it is forbbiden that two or more edges connect the same two vertexes.

LE: Also, there will always exist a graph with the degrees given in the tests.

Given an array (multiset) of N elements, find the maximum number of subsets such that the sum of elements in each of the subsets is different and smaller than k.

Example: N = 4 a = {1, 1, 3, 5}

Out of all the 2^4 possible subsets of array a, 11 of them (including empty subset) have distinct sums.

Restricions: 1 <= N <= 1000 1 <= a[i] <= 50000 1 <= k <= 50000 Time limit: 0.4s Memory limit 16 MB

It is tagged as Dynamic Programming problem on the site I took it but I couldn't find any recursive formula in 2 days, so I thought that you can help me.

EDIT: I finally came up with a solution, which I'd rather classify as BFS.

When i try to login on topcoder website i keep getting the following warrning

Is anyone else getting the same thing? Can anyone please help me fix this problem?

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/21/2017 13:47:01 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|