2017年12月_chenxli23

原创高性能作业PSRS

#include #include #include #include #include #include #include "mpi.h" int i, j, k; int N = 36; int cmp(const void * a, const void * b) { if (*(int*)a < *(int*)b) return -1; if (*(int*)a >

2017-12-31 14:16:34 631

转载机器学习第四周神经网络

4. Neural Networks (part one) Content: 　　4. Neural Networks (part one) 　　　　4.1 Non-linear Classification. 　　　　4.2 Neural Model(神经元模型) 　　　　4.3 Forward Propagation 　　　　4.4 神经网络实现与或非门以

2017-12-28 16:34:14 390

原创剑指Offer_编程题用两个栈实现队列

题目描述用两个栈来实现一个队列，完成队列的Push和Pop操作。队列中的元素为int类型。 class Solution { public: void push(int node) { stack1.push(node); } int pop() { while(!stack1.empty()){ sta

2017-12-22 20:41:24 148

原创 PAT 1013. Battle Over Cities (25)

It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee

2017-12-17 17:23:20 132

原创 PAT 1010. Radix(25)

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number. Now for any pair of positive

2017-12-14 22:47:24 255

转载机器学习入门：线性回归及梯度下降

本文会讲到： (1)线性回归的定义 (2)单变量线性回归 (3)cost function：评价线性回归是否拟合训练集的方法 (4)梯度下降：解决线性回归的方法之一 (5)feature scaling：加快梯度下降执行速度的方法 (6)多变量线性回归 Linear Regression 注意一句话：多变量

2017-12-10 10:23:39 215

原创 PAT 1005 The Largest Generation (25)

这道题是牛客网上的模拟题，我用的是深搜，看了其他人的代码，大佬的代码真是简短，差距啊哈哈哈题目描述 A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is t

2017-12-07 23:30:28 129

原创 APT 1004 Counting Leaves (30)

#include #include #include using namespace std; const int N=101; map > adjlist; int levelLeaves[N] = {0}; void dfs(int node,int level) { if(adjlist[node].empty()) { levelLeaves[level]++;

2017-12-06 11:09:14 134

原创 PAT 1009 Product of Polynomials (25)

题目： This time, you are supposed to find A*B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, and each line contain

2017-12-06 10:36:33 121

Hickey_Chen的博客