最新 最热

代码解析《Learning Latent Dynamics for Planning from Pixels》及carla效果

跑算法就是先收集数据,然后把它feed到构建好的模型中去训练。这个代码还多了一步planning。planning完收到新的数据,于是又开始新的一轮训练,循环下去。...

2019-05-10
1

硅谷码工的lifecycle是怎样的?

做了几年码工,当想理解一个系统的时候,喜欢问这两个问题:这个模块的input,output是什么?这个东西的lifecycle是什么?前者是把系统当黑象,理解静态的的存在意义,后者为了理解动态的过程。...

2019-04-30
1

求第K个素数----08年上海交大复试上机题第一题

函数名: clock 功 能: 确定处理器时间 用 法: clock_t clock(void);

2019-04-24
1

Linux连接投影仪(ubuntu)失败或显示不正常--未测试

Linux连接投影仪,网上这方便的资料比较少,尤其是图文资料。最近有这方面的需求,查了很多的资料,最终实现的投影。直接插上VGA后,发现屏幕显示的不正确,或不显示。这是由于投影仪的分辨率引起的。...

2019-04-10
1

CodeForces 733B Parade

B. Parade time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Very soon there will be a parade of vict...

2019-04-09
1

BFS练习-POJ.2386

Lake Counting Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 35122 Accepted: 17437 Description

2019-02-21
1

动态规划(二)HDU1114

Sample Input 3 10 110 2 1 1 30 50 10 110 2 1 1 50 30 1 6 2 10 3 20 4

2019-02-21
1

数论(一)LOJ1282

You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.

2019-02-21
1

Problem 1002-2017 ACM/ICPC Asia Regional Shenyang Online

As the picture is shown, when you select M1 and M2, M1 show the color of K1, and M2 show the color of K2. When you select M3 and M2, M2 show the color of K...

2019-02-21
1

LightOJ 1203--Guarding Bananas(二维凸包+内角计算)

Once there was a lazy monkey in a forest. But he loved banana too much. One day there was a storm in the jungle and all the bananas fell from the trees. The mon...

2019-02-20
1