University

Sum Problem-hdu-1001

Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).
·2015-10-27 14:43

Today I Cooked the Sun Yat-Sen University [2007-09-25 12:37:39]

Aha,yes,it is!   And I paticipate in the school page of sysu...and cann't change my previous csu to sysu...   Alas,what a good time that I registed at 12:34...How beautiful the number
·2015-10-27 14:33

hdoj1001--Sum Problem

Problem Description Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).
·2015-10-27 14:35

Java知识点：琐碎知识点(1)

Java基本介绍 SUN:Stanford University NetworkJava之父：James GoslingJava的跨平台性因为有Java虚拟机，运行class文件。
·2015-10-27 14:33

CSUOJ 1603 Scheduling the final examination

Memory Limit: 128 MBSubmit: 49  Solved: 15 Description For the most of the university
·2015-10-27 13:25

Study on Algorithm of Selecting Safe Landing Area on Ground During Asteroid Soft Landing (EEIC2013 +161)

Artificial Intelligence and Robots, School of Electronic Information and Control Engineering Beijing University
·2015-10-27 12:43

2015 Multi-University Training Contest 2 1004 Delicious Apples

 Delicious Apples Problem's Link:  http://acm.hdu.edu.cn/showproblem.php?pid=5303   Mean:  一条长为L的环形路上种着n棵苹果数。 第i棵苹果数的位置在xi，有ai个苹果，苹果树的位置按顺时针顺序给出，且都是整数。 在0位置有一个仓库，
·2015-10-27 12:40

2015 Multi-University Training Contest 1 Assignment

Assignment Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 297    Accepted Submission(s): 152 Problem
·2015-10-27 12:37

2015 Multi-University Training Contest 1 Tricks Device

Tricks Device Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0 Problem
·2015-10-27 12:36

2015 Multi-University Training Contest 1 OO’s Sequence

OO’s Sequence Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 312    Accepted Submission(s): 107 Pr
·2015-10-27 12:36

ZOJ-3410Layton's Escape(优先队列+贪心)

Memory Limit: 65536 KB Professor Layton is a renowned archaeologist from London's Gressenheller University
·2015-10-27 12:44

2013 Multi-University Training Contest 10

HDU-4698 Counting 题意：给定一个二维平面，其中x取值为1-N，y取值为1-M，现给定K个点，问至少包括K个点中的一个的满足要求的<Xmin, Xmax, Ymin, Ymax>共有多少中取值情况。也就是说K个点中至少一个点落在所给定的区间内。 解法：正面求解，由于点只有1000个，因此直接暴力离散化之后的x轴坐标，对于y轴则可以通过增加一个一个加入点，使
·2015-10-27 12:55

2013 Multi-University Training Contest 9

HDU-4687 Boke and Tsukkomi 题意：给定一个简单图，询问哪些边如果选择的话会使得最大的连边数减少。 解法：套用一般图的最大匹配算法（带花树）先算出最大匹配数，然后枚举一条边被选择（注意：如果改变被选择，则两端点相邻的边都应删除），看是否只减少一条匹配边。 #include <cstdlib> #include <cstring> #
·2015-10-27 12:55

2013 Multi-University Training Contest 8

HDU-4676 Sum Of Gcd 题意：给定一个1-N的全排列序列，N<=20000，有Q组询问，Q<=20000，每组询问给出左右区间[l, r]，问区间内的任意两个数的gcd之和为多少？ 分析：早几场多校做过一道题目是问任意区间的gcd最大值为多少。使用的离线加线段树的方法。这题的解题就需要一些数论知识知识了。对于任意一段区间，任意两个数的gcd值一定会是区间内
·2015-10-27 12:54

2013 Multi-University Training Contest 4

HDU-4632 Palindrome subsequence 题意：给定一个字符串，长度最长为1000，问该串有多少个回文子串。 分析：设dp[i][j]表示从 i 到 j 有多少个回文子串，则有动态规划方程： str[i] != str[j]：dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1];str[i]  = str
·2015-10-27 12:52

2013 Multi-University Training Contest 3

HDU-4622 Reincarnation 题意：给定一个字符串，有Q次询问，每次询问得出区间[L, R]内有多少个不同的子串。 分析：后缀数组搞，不过hash+dp也能够搞定这题，详解见http://www.cnblogs.com/Lyush/p/3233573.html。 #include <cstdlib> #include <cstring&g
·2015-10-27 12:51

2013 Multi-University Training Contest 2

HDU-4611 Balls Rearrangement 题意：具体题意不大清楚，最后要处理一个这样的表达式：sum{ |i % a - i % b| }，0 <= i < N 的取值很大，a、b均小于10^5。 分析：观察|i % a|和|i % b|可以发现其均为被模数的一个滚动剩余系，且中间的某些段的值是恒定的。再注意到其实处理到a和b的最小公倍数的时候又可以把最小
·2015-10-27 12:50

2013 Multi-University Training Contest 1

HDU-4605 Magic Ball Game 题意：给定一颗以1为根的数，每个节点要么有两个孩子节点，要么没有孩子，每个节点有一个重量，现在从节点1往下放置一个小球，根据小球和节点的重量的不同球落下的轨迹是一个概率问题： 设球的重量为X，节点的重量为w[i]：X = w[i]，那么小球的运动将停止；X < w[i]，那么小球向左孩子下落的概率为1/2，向右孩子下落的概率为1
·2015-10-27 12:50

2015 Multi-University Training Contest 1

1001 OO’s Sequence 定义两个数组L[i],R[i]保存第i个数左右最近的因子。 那么第i个数对ans的贡献就是(R[i]-i)*(i-L[i])。 更新L,R数组的方法如下： 用向量预存[1,10000]中每个数的位置。 对于a[i]，枚举它的所有倍数，记为j。若j在a[i]左边，且a[i]小于原来的R[j]，即a[i]与j更近，那么R[j]的位置更新为i。若
·2015-10-27 12:53

2015 Multi-University Training Contest 2

1001 Angry Trees   1002 Buildings 比赛的时候没看懂题。看完题解依旧WA好久。 偷看数据发现坑多。不容易考虑全。 假设m>=n，否则转置一下。 下面所描述的left，right，up，down全部和官方题解相同。 要注意。left，right与up，down在图上的取法是不一样的。   首先考
·2015-10-27 12:53

HDU 5289 2015 Multi-University Training Contest 1 1002 RMQ+二分

　　　　　　　　　　　　　　　　　　Assignment Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1758    Accepted Submissio
·2015-10-27 12:04

2015 Multi-University Training Contest 2 hdu 5303 Delicious Apples

Delicious Apples Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1057    Accepted Submission(s): 354
·2015-10-27 11:10

2015 Multi-University Training Contest 2 hdu 5308 I Wanna Become A 24-Point Master

I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 897    Accepted Submis
·2015-10-27 11:10

2015 Multi-University Training Contest 1 y sequence

Y sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 667    Accepted Submission(s): 147 Problem
·2015-10-27 11:10

2015 Multi-University Training Contest 2 Buildings

Buildings Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 804    Accepted Submission(s): 222 Proble
·2015-10-27 11:09

2015 Multi-University Training Contest 2 Friends

Friends Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0 Problem Descri
·2015-10-27 11:08

2015 Multi-University Training Contest 2 hdu 5306 Gorgeous Sequence

Gorgeous Sequence Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 349    Accepted Submission(s): 57
·2015-10-26 15:52

CheeseZH: Stanford University: Machine Learning Ex4:Training Neural Network(Backpropagation Algorithm

1. Feedforward and cost function; 2.Regularized cost function: 3.Sigmoid gradient The gradient for the sigmoid function can be computed as: where: 4.Random initialization randInitializeW
·2015-10-26 15:15

CheeseZH: Stanford University: Machine Learning Ex2:Logistic Regression

1. Sigmoid Function In Logisttic Regression, the hypothesis is defined as: where function g is the sigmoid function. The sigmoid function is defined as: 2.Cost function and gradient The cost f
·2015-10-26 15:14

CheeseZH: Stanford University: Machine Learning Ex3: Multiclass Logistic Regression and Neural Network

Handwritten digits recognition (0-9) Multi-class Logistic Regression 1. Vectorizing Logistic Regression (1) Vectorizing the cost function (2) Vectorizing the gradient (3) Vectorizing the regulari
·2015-10-26 15:14

CheeseZH: Stanford University: Machine Learning Ex1:Linear Regression

(1) How to comput the Cost function in Univirate/Multivariate Linear Regression; (2) How to comput the Batch Gradient Descent function in Univirate/Multivariate Linear Regression; (3) How to scale f
·2015-10-26 15:13

可怜的父母啊

是这么回事，上个周六那个老总给了我老板八份卷子，老板让我找人做，md,他的宝贝儿子在英国的university of manchester“念书”，竟然找我们给他写作业，但也感觉是考试题。
·2015-10-24 09:16

lua

是巴西里约热内卢天主教大学（Pontifical Catholic University of Rio de Janeiro）里的一个研究小组，由Roberto Ierusalimschy、Waldemar
·2015-10-23 09:10

ZOJ3705:Applications

Recently, the ACM/ICPC team of Marjar University decided to choose some new members from freshmen
·2015-10-23 09:15

hdu 2795 Billboard 线段树单点更新

pid=2795 Description At the entrance to the university, there is
·2015-10-23 09:10

hdu 4493 Tutor 水题

pid=4493 Description Lilin was a student of Tonghua Normal University. She is studying at Univers
·2015-10-23 09:59

poj 1466 Girls and Boys 二分图的最大匹配

id=1466 Description In the second year of the university somebody started a study on the
·2015-10-23 09:57

案例分析:校内网崛起原因及其发展前景

案例分析:校内网崛起原因及其发展前景 背景 创始人简介 内网创始人王兴：福建人，1997年被保送到清华大学电子工程系无线电专业，毕业后拿到全额奖学金去了美国特拉华大学（University
·2015-10-23 08:13

Interview总结

I graduacted from Ocean University of China, Computer department.
·2015-10-23 08:48

如何传送自定义json数据并解析处理

= [ {"Id":20547,"Name":"中南大学","NameEn":"central-south university
·2015-10-23 08:00

HDU 1520 Anniversary Party

Problem Description The president of the Ural State University is going to make an 80'th Anniversary
·2015-10-23 08:51

2014年全球“高被引科学家”数学类名单

Affliation) 第二单位(Secondary Affliation) Saeid Abbasbandy Mathematics Imam Khomeini International University
·2015-10-23 08:55

A fine property of the non-empty countable dense-in-self set in the real line

real line   Zujin Zhang   School of Mathematics and Computer Science, Gannan Normal University
·2015-10-23 08:10

[论文笔记]Combining Global Optimization with Local Selection for Efficient QoS-aware Service Composition (WWW 2009)"

Time Spended: 4.5 hours 第一作者的publication list如下(dblp): Mohammad Alrifai(L3S Research Center, University
·2015-10-23 08:00

Chongqing University Weekly Training (10.18) 小结

ChongqingUniversityWeeklyTraining(10.18)|传送门Pro.A——[UVA1609]FoulPlay[实现]题意分析：队伍1能打败至少一半的队伍，每次两支队伍两两对决，胜出的队伍进入下一轮，求队伍1一定胜利的场次安排。解题思路：分为三个阶段：第一阶段干掉能干掉的黑色。第二阶段给队伍1分配对手第三阶段，剩余的黑色互杀，还有剩下的黑色就合着灰色互杀。重复上述即可。个
CatGlory·2015-10-22 00:00

Postgres使用小结---安装

PostgreSQL及Berkeley DB都是University of California Berkeley 分校的研究成果，是Linux下的比较流行的数据库软件，而且都是Open Source（
·2015-10-21 13:08

UVA 12904 Load Balancing 暴力

cid=83008#problem/H Description The infamous University of Kala Jadu (UKJ) have been
·2015-10-21 12:54

Codeforces Round #311 (Div. 2) D. Vitaly and Cycle 图论

题目连接 http://codeforces.com/contest/557/problem/D Description After Vitaly was expelled from the university
·2015-10-21 12:43

Episode III 计算机病毒防治相关法律法规

Episode III 计算机病毒防治相关法律法规 FUDAN UNIVERSITY 3 我国对防病毒有哪些法律法规？
·2015-10-21 12:31

计算机病毒及其防治 Computer Virus Analysis and Antivirus

Episode I 计算机病毒的历史 FUDAN UNIVERSITY 3 世界上第一台计算机诞生 • 1946 年2月14日，宾夕法尼亚大学莫尔电气学院 （ Moore School
·2015-10-21 12:24
上一页 27 28 29 30 31 32 33 34 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他