随笔分类 -  矩阵

摘要:E. Okabe and El Psy Kongroo time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output E. Okabe and 阅读全文
posted @ 2017-09-14 17:43 Blackops 阅读(556) 评论(0) 推荐(0)
摘要:EXTENDED LIGHTS OUT Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10835 Accepted: 6929 Description In an extended version of the game Lig 阅读全文
posted @ 2017-07-18 14:53 Blackops 阅读(231) 评论(0) 推荐(0)
摘要:Problem C. Numbers This contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problem 阅读全文
posted @ 2017-07-02 21:53 Blackops 阅读(679) 评论(0) 推荐(1)
摘要:M斐波那契数列 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2598 Accepted Submission(s): 774 Problem 阅读全文
posted @ 2016-06-25 15:08 Blackops 阅读(353) 评论(0) 推荐(0)
摘要:D. Iterated Linear Function time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output D. Iterated L 阅读全文
posted @ 2016-06-16 22:18 Blackops 阅读(227) 评论(0) 推荐(0)
摘要:Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1424 Accepted Submission(s): 469 Proble 阅读全文
posted @ 2016-05-26 17:47 Blackops 阅读(632) 评论(0) 推荐(0)
摘要:So Easy! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4316 Accepted Submission(s): 1402 Probl 阅读全文
posted @ 2016-05-13 22:33 Blackops 阅读(386) 评论(0) 推荐(0)
摘要:递推求值 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 给你一个递推公式: f(x)=a*f(x-2)+b*f(x-1)+c 并给你f(1),f(2)的值,请求出f(n)的值,由于f(n)的值可能过大,求出f(n)对1000007取模后的值。 注意:-1对3取模后等于2 阅读全文
posted @ 2016-05-10 22:04 Blackops 阅读(157) 评论(0) 推荐(0)
摘要:Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12329 Accepted: 8748 Description In the Fibonacci integer sequence, F0 = 0, F1 = 阅读全文
posted @ 2016-05-04 16:36 Blackops 阅读(620) 评论(0) 推荐(0)