We know how to write that in terms of the state numbers, 1 0 0 so it would be 1, 0, 0, because we're talking about the ground state.
我们知道如何去,写出态数字,它是,因为我们在讨论基态,我们总是讨论基态除非。
It says if this is a string of length 0 or 1, I'm done. I'm going to return the answer true.
我就会返回答案为真,否则的话我得判断它。
And in terms of radial nodes, we have 2 minus 1 minus 0, so what we have is one radial node.
对于径向节点,我们有2减去1减去0,所以有一个径向节点。
Yes or no. That can give you a true or false, a one or a zero answer. What about this?
是或者否,它告诉你真假,1,或,0,这个怎么样?
Again, how much quantity would Firm 2 have to produce in order to induce Firm 1's best response to be 0?
重复一遍,公司2的产量是多少时,公司1的最佳对策是产量为0呢
It takes on the value 1 with the probability of 20% and the value of 0 with the probability of 80%.
等于1的概率是20%,等于0的概率是80%
They expect 2 - 1 = 1 and when 2 - 1 = 2 or 3 or 0, they look longer, indicating surprise.
它们认为2-1=1,所以当2-1=2或3或0,他们注视时间更长,表明了惊奇
we learned that the average number of romantic relationships for people to take positive psychology in 4 years is between zero and one.
我们了解到上积极心理学课的人,在4年里恋爱次数的平均数在0到1之间。
eV It is a unit of energy. Now, this is 1.0 eV.
它是以单位的能量,现在,这有1。
Negative 1 plus 0 should add up to negative 1, if in fact, we're correct for the c n anion.
负一加上零应该等于负一,如果是这样,我们对于氰离子的结果就是正确的。
Let's switch to a clicker question and just confirm that that is, in fact, true. So what's the corresponding orbital if we talk about this state, 5, 1, 0?
让我们,转到,课堂问题上来,5,1,0态所对应的轨道,是哪一个?
And so this, in fact, when you say your computer stores information as zeros and ones, A you've just typed the capital letter A, that's all that's going on inside.
事实上,当你说电脑以这些0与1进行信息存储时,你已经键入了大写字母,那就是在计算机内部发生的过程。
All right, c p 1 dot y, x I've said assign that to the value 2, 2,0. So now c p 1 has inside of it an x and y value.
一个特定的版本,我现在命名了一个内置变量,并给它赋值了,我刚刚做的也就是给它。
It's much more interesting if you can actually build things that are interactive, that are animated, that play music and so forth and not just produce things on day 1 that outputs zeroes and ones like this.
如果你构建的东西是互动的,像动画,音乐播放等等,而不是编些像第一天那样,只是输出0和1的程序。
Then if I'm looking for the square root of something less than 1, I know it will be in my region, right?
如果我要求平方根的数小于,我就知道我们的答案应该,在0-1这个区间了,对不对?
If I choose Alpha and she chooses Alpha to get 0; Beta she gets -1. Alpha is better.
如果我选α,她选α她得0,选β她得-1,选α更好
Which are both defined to be, or I can define them in multiple ways, 0 and 1.
可以定义为,或者我可以用多种方式来定义它。
So, in particular, what would be Player 1's best response if Player 2 didn't produce at all?
比如说,参与人2产量为0时1的最佳对策是什么
If we try this for the 2 s, we have 2 minus 1 minus 0.
我们有2减去1减去,所以我们可以预期看到。
It is always a number that lies between zero and one, or between 0% and 100%.
概率一定是一个在0和1之间的数字,或者说0%和100%之间
I write 1.0 times 1.6. Even that I can do in my head.
写下1。0*1。6,即使我可以在头脑中想象。
The gap could be about one ten-thousandths of a millimeter wide.
这个缝隙大约只有0.1微米那么宽
I put in .9958 for every dollar I got out, so my appreciation of my money is 1/.9958. Subtract that by $1, which is what I put in, and that's how much money I made as a fraction of a dollar.
我投入0.9958美元,得到1美元,我的资产增值为1/0.9958,减去1美元,那是我的投入,这就是每1美元,赚了多少钱
If my opponent chooses Alpha and I choose Alpha, I get 0; Beta, I get -1. So Alpha would be better.
如果我对手选α我选α,我得0,选β我得-1,选α更好
Remember what range does, it gives me a set or a collection or a tuple of integers from 0 up to 1 - is the last value, so it's going to give me everything from 0 up to the total number of heads.
我将要在这个循环范围内加上鸡的数量,记住循环范围的目的,它给了我一个从一开始的整数集合,或者数组,这是最后的值。
Hence the name of the problem.
也就是这个问题的名字0/1背包问题。
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
但是让我们找一找它的一些变种,在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
应用推荐