- 博客(10)
- 收藏
- 关注
RSS订阅原创 1003 Emergency (25)
Emergency (紧急时刻).As an emergency rescue(营救) team leader of a city, you are given a special map of your country. The map shows several scattered(分散的) cities connected by some roads. Amount of rescu...
2018-05-29 19:06:09
335
原创 18蓝桥国赛JavaB第二题(全排列)
#include <cstdio>#include <algorithm>#include <cstring>using namespace std;long long num[9]={1,2,3,4,5,6,7,8,9};long long theMax = 0;bool isok(long long sum) { if(sum / 100000...
2018-05-29 12:51:04
169
原创 1002 A+B for Polynomials (25) -
A+B for Polynomials(多项式).This time, you are supposed to find A+B where A and B are two polynomials.InputEach input file contains one test case. Each case occupies 2 lines, and each line contains...
2018-05-23 19:19:51
140
原创 1001 A+B Format (20)
#include <cstdio>#include <cmath>using namespace std;const int MAXN = 10010;int main() { int long long a, b, c; scanf("%lld%lld",&a,&b); c = a + b; if(c < 0) { printf(...
2018-05-22 12:24:38
162
原创 pat-a
1001 A+B Format (20) 1002 A+B for Polynomials (25) 1003 Emergency (25) 1004 Counting Leaves (30) 1005 Spell It Right (20) 1006 Sign In and Sign Out (25) 1007 Maximu...
2018-05-21 22:28:59
617
原创 dp
// DP基础// DP有两种写法———— 递归 / 递推(for循环)// DP的递归写法（缺点是：不利于节省空间）// 递归：带有“记忆化搜索(备忘录)”结构的菲波那切数列 int f(int n){ if(n == 0 || n == 1) return 1; if(dp[n] != -1) return dp[n]; else{ dp[n] = f(n - 1)...
2018-05-21 18:47:47
269
原创 《算法笔记》2
// 链表// 创建链表#include <cstdio>#include <cstdio>struct node{ int data; node* next;};node* create(int Array[]) { node *head, *p, *pre; head = new node; head->next = NULL; pre ...
2018-05-16 17:11:10
172
原创 常用的计算长度函数
.size() int vector<int> G[MAXN]; G[i].size();.length() String srt; str.length();strlen() char a[20]; strlen(a);
2018-05-15 12:18:04
3002
原创 缺陷键盘
Sample Input:They are students.aeiouSample Output:Thy r stdnts.#include <cstdio>#include <cstring>#include <iostream>using namespace std;int main() { //string str1... 因s...
2018-05-09 19:07:05
143
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人