08 2019 档案
摘要:阿克曼函数(Ackermann)是非原始递归函数的例子。它需要两个自然数作为输入值,输出一个自然数。它的输出值增长速度非常快,仅是对于(4,3)的输出已大得不能准确计算。 $$ A(m, n)=\left\{\begin{array}{ll}{n+1} & {m=0} \\ {A(m 1,1)} &
阅读全文
摘要:A题 给出n个数,问这n个数能不能分成奇数个连续的长度为奇数并且首尾均为奇数的序列 Codeforces849A 题解传送门 代码 1 #include <bits/stdc++.h> 2 #define ll long long 3 #define ull unsigned long long 4
阅读全文
摘要:Count Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1187 Accepted Submission(s): 433 Problem De
阅读全文
摘要:C. Party Lemonade C. Party Lemonade A New Year party is not a New Year party without lemonade! As usual, you are expecting a lot of guests, and buying
阅读全文
摘要:扫雷 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4861 Accepted Submission(s): 1316 Problem Desc
阅读全文
摘要:B. Divisiblity of Differences You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between an
阅读全文
摘要:B. Marvolo Gaunt's Ring Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present th
阅读全文
摘要:B. Maximum of Maximums of Minimums You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array into
阅读全文
摘要:A. Odds and Ends A. Odds and Ends Where do odds begin, and where do they end? Where does hope emerge, and will they ever break? Given an integer seque
阅读全文
摘要:题目背景 自动上次redbag用加法好好的刁难过了yyy同学以后,yyy十分愤怒.他还击给了redbag一题,但是这题他惊讶的发现自己居然也不会,所以只好找你 自动上次redbag用加法好好的刁难过了yyy同学以后,yyy十分愤怒.他还击给了redbag一题,但是这题他惊讶的发现自己居然也不会,所以
阅读全文
摘要:Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 75294 Accepted: 34483 Case Time Limit: 2000MS Description For the daily mil
阅读全文
摘要:D - Summer Vacation Time Limit: 2 sec / Memory Limit: 1024 MB Score : 400 points Problem Statement There are N one-off jobs available. If you take the
阅读全文
摘要:The merchant Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 6864 Accepted: 2375 Description There are N cities in a country, and there is
阅读全文
摘要:C. MaratonIME plays Nim time limit per test : 2.0 smemory limit per test : 64 MBinputstandard inputoutputstandard outputAi Fox!UNIONFIND, GERMANOYou o
阅读全文
摘要:Closest Common Ancestors Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines
阅读全文
摘要:Distance Queries Description Farmer John's cows refused to run in his marathon since he chose a path much too long for their leisurely lifestyle. He t
阅读全文
摘要:Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41290 Accepted Submi
阅读全文