orange_melon-CSDN博客

原创 tensorflow cats vs dogs

作为一个萌新，跟随网易云课堂的课程和参考博客做了catsvsdogs项目，现在做个总结网易云课堂网址：https://mooc.study.163.com/course/2001396000#/info 参考该博客的读入数据：https://blog.csdn.net/lin453701006/article/details/79402976 数据集:https://www.ka...

2019-07-11 22:28:02 898 8

原创通过结果总结特征处理鸢尾花数据

刚开始学习机器学习，在学习knn时接触到了iris，突发奇想，为什么不能通过结果总结出特征来判断种类呢，就像现实中认识一朵花，你得先了解它有哪些特征，在根据特征判断花的种类。不知道这种想法是否已经被他人考虑过，如有雷同请原谅。为了更好画图，这里只截取了iris的前两个特征。将特征转换成向量形式，画图如下。很明显，红色和黄色重合在一起，很难区分，...

2019-04-04 16:13:38 1595

Boys vs Girls (25) 时间限制 400 ms内存限制 65536 kB代码长度限制 16000 B判题程序 Standard 作者 CHEN, YueThis time you are asked to tell the difference between the lowest grade of all the male students and the highest grade

2017-10-25 20:02:14 199

原创 1018. Public Bike Management (30)

Public Bike Management (30) 时间限制 400 ms内存限制 65536 kB代码长度限制 16000 B判题程序 Standard 作者 CHEN, YueThere is a public bike service in Hangzhou City which provides great convenience to the tourists from all ove

2017-10-15 20:00:30 258

原创 1015. Reversible Primes (20)

A reversible prime in any number system is a prime whose “reverse” in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a pri

2017-07-21 09:16:01 310

原创 pat 1014. Waiting in Line

Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:The space in

2017-07-20 16:27:42 211

原创 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 need

2017-07-20 15:07:34 156

原创 pat 1012. The Best Rank (25)

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algebra), and E - Engl

2017-07-20 09:23:56 299

原创 1011. World Cup Betting (20)

#include #include #include using namespace std; int main() { double ans=1; double a,b,c; for (int i=0;i<3;i++) { scanf("%lf%lf%lf",&a,&b,&c); if (a>b&&a>c){ printf("W "); ans*=a; }

2017-07-18 15:19:40 190

原创 pat 1009. Product of Polynomials (25)

Product of Polynomials (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue This time, you are supposed to find A*B where A and B are two polynomials.Input Specification:E

2017-07-18 10:06:03 236

原创 acdream A - A Math game

#include #include #include using namespace std; int n; long long m; long long num[100]; long long sum[100]; bool f; void dfs(int x,long long s) { if (s==m){ f=true;return; } if (f) return; if (

2017-07-17 19:50:53 256

原创 1008. Elevator (20)

1008. Elevator (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue The highest building in our city has only one ele

2017-07-16 10:38:07 194

原创 1007. Maximum Subsequence Sum

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given a sequence of K integers { N

2017-07-16 10:10:39 276

原创 1006. Sign In and Sign Out

1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue At the beginning of every day, the fi

2017-07-16 09:45:32 253

原创 pat 甲级 1004. Counting Leaves (30)

1004. Counting Leaves (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A family hierarchy is usually presented by a

2017-07-16 09:24:17 255

原创 PAT 甲级1003. Emergency (25) DIJKSTRA

1003. Emergency (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue As an emergency rescue team leader of a city, yo

2017-07-14 19:17:33 345

原创 Hashing - Hard Version

Given a hash table of size NNN, we can define a hash function . Suppose that the linear probing is used to solve collisions, we can easily obtain the status of the hash table with a given sequence o

2017-07-13 10:19:31 618

原创 pat 关键活动拓扑排序关键路径

拓扑排序，读取一个入度为0的点，将与其相连的节点入度-1，并更新最早完成时间，earliest[k]=max(earliest[k],earliest[head]+p[i].v) p[i].v为head到K的距离。更新完成后寻找出度为0并且earliest最大的点，将其latest=earliest，利用这个点逐个更新节点的latest值。如何节点的latest==earliest 则为关键路径

2017-07-13 09:41:43 1111 4

orange_melon的博客