2044 Problem C Magic Pocket

... 问题 C: Magic Pocket Time Limit: 1 Sec Memory Limit: 32 MB Submitted: 427 Solution: 196 [submit] [status] [discussion version] [proposition person: external import] 题描述 has a magic pocket, the total volume is 40, with this pocket can change some items, these items The total volume must be...


1020-moon cake (25)

... 月饼 is a traditional food that Chinese people eat during the Mid-Autumn Festival. There are many different flavors of moon cakes in different regions. Now give the stock quantity, total selling price, and the maximum demand of the market for all kinds of moon cakes. Please calculate the...


L1-005 Exam Seat Number (15 points)

... L1-005 Exam Seat Number (15 points) Each PAT candidate will be assigned two seat numbers when taking the test, one is the test seat. One is the test seat. Under normal circumstances, the candidate will get the seat number of the test machine when entering the venue. After entering the...


C++ Structure Sorting Exercise

... 7-37 Simulating EXCEL Sorting (25 points) Excel can sort a group of records by any specified column. Now write a program that implements similar functionality. Input format: The first line of input contains two positive integers N (≤10 5 ) and C, where N is the number of records, and C...


PKU pointer part exercises

... /* Programming #2: Two-dimensional array upper right left lower traversal Source: POJ (Coursera Statement: The exercises completed on the POJ will not count towards the final score of Coursera.) Note: Total time limit: 1000ms Memory limit: 65536kB description Given an array of integer...


Hdu 1408 (high-precision) pit people tender

... Problem Description 挂 salt water, if the drop is regular, first drop a drop, stop; then drop two drops, stop; drop three drops, stop..., now One problem: this bottle of salt has a total of VUL milliliters, each drop is D ml, the speed of each drop is one second (assuming the last drop...


Calculate the day of the week according to the given date (Celler's formula)

... 蔡勒公式 # include <iostream> using namespace std ; // 蔡勒公式 Given the date of the year Calculate the day of the week int weekday ( int year , int month , int day ) { if ( month == 1 || month == 2 ) { month + = 12 ; year -- ; } int c = year / 100 ; int y = year % 100 ; int m = month ;...


Superprime Rib Special prime ribs

... Description 农民John cows always produce the best ribs. You can recognize them by the numbers that Farmer John and the US Department of Agriculture mark on each rib. The peasant John determined that he sold the real prime ribs to the buyer because the ribs were cut from the right and the...


Catch That Cow(BFS)

... [Title Description] The farmer knows the location of a cow and wants to catch it. The farmer and the cow are located on the number axis. The farmer is located at the point N ( 0 &lt; = N &lt; = 100000 ) N(0&lt;=N&lt;=100000) N ( 0 < = N < = 1 0 0 0 0 0 ) , the cow...


Codeforces 1045 D. Interstellar battle

... 题大意: A tree, given the probability that each point disappears, find the expected value of the connected block. It is required to support the operation of modifying the vanishing probability and give the expected value after each modification. 数据范围 , time limit 1S. We consider doing a DP...