原创 HDU6198 number number number
number number number HDU - 6198 We define a sequence FF: ⋅⋅ F0=0,F1=1F0=0,F1=1; ⋅⋅ Fn=Fn−1+Fn−2 (n≥2)Fn=Fn−1+Fn−2 (
原创 Rikka with Stone-Paper-Scissors
Rikka with Stone-Paper-Scissors Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) T
原创 Graduation Examination
Graduation Examination Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB Total submit users: 41, Acce
原创 Problem C DRM Messages
Problem C DRM Messages DRM Encryption is a new kind of encryption. Given an encrypted string (which we’ll call a DRM me
原创 Magic Square
Magic Square Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s):
原创 Hamburger String
Hamburger String Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB Total submit users: 17, Accepted u
原创 Problem D Game of Throwns
Problem D Game of Throwns Daenerys frequently invents games to help teach her second grade Computer Science class about
原创 Harmonious Contest
Harmonious Contest Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB Total submit users: 18, Accepted
原创 B. Obtaining the String
B. Obtaining the String time limit per test 1 second memory limit per test 256 megabytes input standard input output st
原创 A. Death Note
A. Death Note time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard ou
原创 鵬
鏈接:https://www.nowcoder.com/acm/contest/136/B 來源:牛客網 鵬 時間限制:C/C++ 2秒,其他語言4秒 空間限制:C/C++ 262144K,其他語言524288K 64bit IO F
原创 題目 D. 錯誤的算法
題目 D. 錯誤的算法 有道題目是這樣的: 輸入一個 n 行 m 列網格,找一個格子,使得它所在的行和列中所有格子的數之和最大。如果答 案不唯一,輸出任意解即可。比如,在下面的例子中,最優解是(1,3),即第一行和的三列的交 點(行從上到
原创 A. Wrong Subtraction
A. Wrong Subtraction time limit per test 1 second memory limit per test 256 megabytes input standard input output stand
原创 C. Less or Equal
C. Less or Equal time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard
原创 The Triangle Division of the Convex Polygon
The Triangle Division of the Convex Polygon Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB Total s