#!/usr/bin/env python #有如下值集合[11,22,33,44,55,66,77,88,99,90...],将所有大于66值保存至字典的一个key中,将小于66的值保存至大二个key的值 li = [11,22,33,44,55,66,77,88,99,90] person = {">66":[],"<=66":[]} for i,j in enumerate(li,0) : if int(j) > 66 : person[&q
Once, Leha found in the left pocket an array consisting of n integers, and in the right pocket q queries of the form l r k. If there are queries, then they must be answered. Answer for the query is minimal x such that x occurs in the interval l r str
Ext.apply(Ext.form.VTypes,{ numberrange: function(val, field) { var num = parseFloat(val); if (field.startNumberField) { var sd = Ext.getCmp(field.startNumberField); sd.maxValue = num; } else if (field.endNumberField) { var ed = Ext.getCmp(field.endN