07 2016 档案
摘要:Bubble Sort Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 224 Accepted Submission(s): 147 Prob
阅读全文
摘要:Acperience Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Deep neural networks (DNN) have shown
阅读全文
摘要:Time Limit: 5000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u Description Give you a sequence of N(N \leq 100, 000) integers : a_{1},...,a_{
阅读全文
摘要:扩展欧几里得算法是数论当中一种常用的算法,他可以用如下的姿势来表达: 设a, b为不全为0的整数,则存在整数x和y,使得 gcd(a, b) = a*x + b*y。 扩展欧几里得算法的代码实现: #include <cstdio> #include <cstring> #define ll lon
阅读全文
摘要:题目:统计一个数字可以有多少种立方和的表示方式。 分析:dp,完全背包。又见整数拆分。 #include <bits/stdc++.h> using namespace std; int cube[25]; long long F[10001]; int main() { for (int i =
阅读全文
摘要:Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description Robbers, who attacked the Gerda's cab, are very successful in coveri
阅读全文
摘要:转载自:http://www.cnblogs.com/shawn-ji/p/5668293.html#3470095 原题: Description Recently, Pari and Arya did some research about NP-Hard problems and they f
阅读全文
摘要:Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Description Mike and !Mike are old childhood rivals, they are opposite in everyt
阅读全文
摘要:Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description Bad news came to Mike's village, some thieves stole a bunch of choco
阅读全文
摘要:Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Time Limit
阅读全文
摘要:题目链接:http://codeforces.com/contest/689/problem/A 题目链接:http://codeforces.com/contest/689/problem/A 题目链接:http://codeforces.com/contest/689/problem/A 题目链
阅读全文