- 博客(6)
- 收藏
- 关注
原创 PATbasic1007
#include "stdafx.h"#include#includeusing namespace std;vector Prime(int n) { //筛法判断质数 vector prime; bool *isprimes = new bool[n + 1]; int i, j, k; for (i = 2; i <= n; ++i) { is
2017-09-04 18:36:52 253
原创 PATbasic1005
#include "stdafx.h"#include#include#include#includeusing namespace std;int compare(int a, int b) { return a > b;}void function(vector &vec) { unordered_map m; int i, j, a; for (i = 0; i
2017-09-03 20:38:04 235
原创 PATbasic1004
#include "stdafx.h"#include#includeusing namespace std;typedef struct node { string name; string number; int result; struct node *next;}NODE;NODE *build(int n) { NODE *head, *p, *nextnode
2017-09-03 20:01:58 285
原创 PATbasic1003
#include "stdafx.h"#include#include#include#includeusing namespace std;int main(){ vector vec; int n, i; cin >> n; for (i = 0; i < n; i++) { string s; cin >> s; vec.push_back(s); }
2017-09-03 19:50:53 224
原创 PATbasic1002
假期集训做的题,AC了的都贴在这里了,望daolao指教#include "stdafx.h"#include#include#includeusing namespace std;void function(string n) { int sum = 0; int i; for (i = 0; i < n.size();i++) { sum += n[i] - '0';
2017-08-28 14:32:09 224
原创 初学二叉树
两个版本的由二叉树中序和前序推后序的代码:#include#include#include#define N 80typedef struct tnode{ char item; struct tnode *left; struct tnode *right; }TNODE; TNODE *add_tree(TNODE *root,char in
2017-03-18 21:06:40 205 1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人