Programmer Think

Title portal Main idea of the title: Given an undirected graph G without self ring and mu lt iple edges, as well as the starting point and end point S and T, the edge weight is 1, find the path length from S to T < = the number of shortest path length + 1. Problem solving ideas Since the edge weight length is constant as 1, the shortest ...

Foreword: making A, B, D and C has been timeout, and I didn't think of how to optimize it. Rating: 1153 + 146 -- > 1299 (green) Don't talk about the problem, just talk about the solution and code. A. Red and Blue Beans   topic type: greed    analysis: if r is less than B, try to replace 1 with more, so calculate the differenc ...

summary In fact, there is nothing to summarize about this game. I didn't play this game on my birthday that day. I found time to participate in the virtual game the next day. The problem is not difficult. It is a thinking problem with a small amount of code. I still encountered a lot of stuck problems when doing it. After that, I found that ma ...

B - Escape   Problem solution  discuss  View submissions from others  My submission Title No.: NC14548 Time limit: 1 second for C / C + + and 2 seconds for other languages Space limitation: C/C++ 32768K, other languages 65536K 64bit IO Format: %lld Title Description   This is the fourth day when mengxiang000 and Ta ...

Problem description Question No.:202104-2Test title:Neighborhood meantime limit:1.0sMemory limit:512.0MBProblem Description: Test background After learning digital image processing, Dunton wants to denoise a gray image on his opponent. However, the image only has a lot of noise in the darker area. If you rashly denoise the whole image, you wil ...

A classical probability problem   Competition home page   My submission Time limit: 1 second for C / C + + and 2 seconds for other languages Space limitation: C / C + + 26244k, other languages 524288K 64bit IO Format: %lld Title Description   Students bit noob and lit noob (hereinafter referred to as B and L) of Niuniu univ ...