s*********s 发帖数: 428 | 1 你们都是什么时候学会count by 5,count by 2的?这么简单的东西,硬是教不会,郁
闷。 |
|
h*****z 发帖数: 4732 | 2 Count by 1都count不对的娃妈飘过:( |
|
s****u 发帖数: 2203 | 3 count by 2是K吧,count by 5还没听娃说过 |
|
|
J****n 发帖数: 8583 | 5 Chris Chase
大家一定要记住这个NC!!
果然有per capital count。。。。。。。彻底雷倒~~~~ |
|
m*****e 发帖数: 789 | 6 Can you count to 10 under this thread?
So, I can discover there are some t-baggers not idiots? |
|
b******3 发帖数: 93 | 7 Since I joined the protest against Jimmy Kimmel&ABC on 10.28,and watched the
earlier protest in New York City,I was really so proud
for
all the people speaking out!
I'm living in Palo Alto Area,with the resource of Stanford Law School(I
know some professors there).So
these days I am preparing the necessary work for suing ABC&Jimmy Kimmel,
reading some similar cases in the past,and needing help to find strong
attorneys.I
sincerely appreciate your help,no matter where you are,just so welcome to
se... 阅读全帖 |
|
b******3 发帖数: 93 | 8 Since I joined the protest against Jimmy Kimmel&ABC on 10.28,and watched the
earlier protest in New York City,I was really so proud
for
all the people speaking out!
I'm living in Palo Alto Area,with the resource of Stanford Law School(I
know some professors there).So
these days I am preparing the necessary work for suing ABC&Jimmy Kimmel,
reading some similar cases in the past,and needing help to find strong
attorneys.I
sincerely appreciate your help,no matter where you are,just so welcome to
se... 阅读全帖 |
|
p****l 发帖数: 175 | 9 re-count后发现Trump的增加了反而,一生气,H要求再数一遍咋办。 |
|
w*****s 发帖数: 14 | 10 不建议交易打印胖子;胖子是免费的,收费的是服务:
Y
所求物品名称:
Osteo Bi-flex One Per Day, 30-Count
绿墙倒赚的那次,日期不记得了,大概价格发下:9.99-1RR=8.99,B1G1用两张6OFF的胖子,倒赚
物品类别(coupon: mfc 等;血糖仪等):
物品来源(报纸夹页,厂家邮寄等):
vary
可接受的价格(必须明码标价,必填):
$3.5EACH 需要10瓶以上,省省邮费
邮寄损失方式哪方承担(若需邮寄,必填):
ML
付款方式说明:
NON CC PAYPAL
本贴有效期(必填):
TILL GOT
联系方式(例: 站内):
MITBBS PM |
|
w*****s 发帖数: 14 | 11 不建议交易打印胖子;胖子是免费的,收费的是服务:
y
所求物品名称:
walgreens Osteo Bi-flex One Per Day, 30-Count@$3.5each
物品类别(coupon: mfc 等;血糖仪等):
X
物品来源(报纸夹页,厂家邮寄等):
walgreens
可接受的价格(必须明码标价,必填):
Quantity>=10 $3.5each
邮寄损失方式哪方承担(若需邮寄,必填):
my label
付款方式说明:
non cc paypal
本贴有效期(必填):
till got enouth
联系方式(例: 站内):
mitbbs pm,thanks |
|
o******w 发帖数: 3262 | 12 我想要的物品:
prevacid 28 count $7.5 each
need 2
单张面值:
可接受的价格(必须明码标价!):
$7.5
物品新旧要求:
please email ur mitbbs ID and total value have.
邮寄方式要求:
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
billpay / boa
其他补充说明:
广告的有效期:
物品来源:
我的联系方式:
二手交易风险自负!请自行验证是否合法和一手卡!: |
|
p****a 发帖数: 4829 | 13 【 以下文字转载自 shopping 讨论区 】
发信人: pharma (rock), 信区: shopping
标 题: It seems "time to sell out" counts the 5 seconds advantage
发信站: BBS 未名空间站 (Fri Dec 3 15:26:35 2010, 美东)
My statisitics:
J&R 12/03 sold out 7 seconds 500 rank: 1,309 missed by
2 Seconds
So you need to finish in 3 seconds to get it if you only have 1 second
advantage |
|
l*****y 发帖数: 871 | 14 Does it count if $24+$1 shipping? |
|
r*******t 发帖数: 8550 | 15 Does Kindle (4G touch, or fire) count as qualified purchase in OfficeMax (
for ink recycle program)? |
|
m*****n 发帖数: 2152 | 16 yes, I bought kindle and it does count |
|
d******y 发帖数: 11545 | 17 amazon超过200个order要发1099,那cancel的order 会count在里面吗?
年底了,算算账,还能卖几个。 |
|
M****o 发帖数: 4860 | 18 count on 的可以是还没发生的事情啊
确实有些人会觉得career就是只要追求publication和award
我也觉得这篇文章写得很好
很受启发
科学以人为本
good |
|
s**********t 发帖数: 544 | 19 You are right. Your explanation makes sense too. But somehow I feel " count
on" refers the things you already have... |
|
|
G*****i 发帖数: 271 | 21 【 以下文字转载自 Mathematics 讨论区 】
发信人: pascaldechin (小帕), 信区: Mathematics
标 题: Re: 关于张益唐先生的电影《Counting From Infinity》
发信站: BBS 未名空间站 (Mon Jun 8 21:36:44 2015, 美东)
找了半天,终于找到了,发个辛苦包子把:
http://www.bilibili.com/video/av2411209/
不过还是会买dvd,我是导演的粉丝。
他的上一部作品 N is a Number 说的是Paul Erdos的故事,是经典中的经典,每次看
了都很激动。 |
|
g*********1 发帖数: 459 | 22 请教各位老师: 找工作的简历,文章的状态是“under revision” 在你们心中count
吗? 生物类
多谢! |
|
d*******h 发帖数: 2146 | 23 不算
因为远远不等于发表
我两个positive review的nat mater revision回去还被编辑干掉了呢
大家最多看accepted的
还有就是你不怕的话把manuscript给出来也许有点credit
count |
|
|
|
L*********4 发帖数: 883 | 26 minor revision可以算吧。如果major revision肯定不能算。
count |
|
T*******g 发帖数: 2322 | 27 我们这个领域的话,
在我心里是count 的,
不过不好说其他人。 |
|
|
g*********1 发帖数: 459 | 29 因为grant的关系,今年必须上市场,但是两篇文章都在revision. 请教各位过来人,
有什么办法,让这两篇文章能count一些呢?
多谢!! |
|
C***t 发帖数: 915 | 30 很好的文章。
顶锅盖说一句: It's who you know that counts 就行了。Whom在语法上是对的,但
是现实中没有这么说滴。就像 Who are you talking about? 或者I know who you are
talking about. 如果是国内的同胞写的那就很不错了,说出来主要是不想这里的学生
跟着学。
好了,遁了。。。 |
|
C***t 发帖数: 915 | 31 很好的文章。
顶锅盖说一句: It's who you know that counts 就行了。Whom在语法上是对的,但
是现实中没有这么说滴。就像 Who are you talking about? 或者I know who you are
talking about. 如果是国内的同胞写的那就很不错了,说出来主要是不想这里的学生
跟着学。
好了,遁了。。。 |
|
i*****j 发帖数: 1 | 32 I want to a room around woodbridge or middlesex count NJ, start from Nov 15,
2006. Please contact me at w*****[email protected] if you have a room near this
area want to rent out. |
|
|
f*******e 发帖数: 628 | 34 date of last count 是 4/7 啊。 |
|
|
j******2 发帖数: 362 | 36 原题如下
Given a set, and functions insert(i), delete(i), count(i), size(), random.
Design a data structure and implement PopRandom() to pop a random element
from the set and return it. |
|
c*********i 发帖数: 46 | 37 http://www.geeksforgeeks.org/counting-inversions/
给出了代码,可是看了程序后, 有点不解,想请大牛指教一下:
/*this is tricky -- see above explanation/diagram for merge()*/
inv_count = inv_count + (mid - i);
不应该是:
inv_count = inv_count + (mid - i)+1?
当copy a[j]时,left array 剩下的都是inversion,不应该是(mid - i)+ 1 个吗?
int merge(int arr[], int temp[], int left, int mid, int right)
{
int i, j, k;
int inv_count = 0;
i = left; /* i is index for left subarray*/
j = mid; /* i is index for right subarray*/
k = left; /*... 阅读全帖 |
|
z****e 发帖数: 54598 | 38 不过核心思想无非是分治
先把所有文件切割成4分
然后启动4个线程
对每一份文件进行word counting
最后归并所有结果
不难,只要文件不是很多
另外扫描查找效率最高的还是hashcode
大概就这样 |
|
y*********0 发帖数: 406 | 39 这个问题是不是就用最经典map reduce word count的example就能解决? |
|
s*w 发帖数: 729 | 40 just practicing c++11 multi-threading and got the following code to try out
your example
problem with my code now:
1. it does not deal with last line of input file
2. it has deadlock for certain test file
Anyone familiar with c++11 multi-threading?
#include
#include
#include
#include
#include
#include
#include
#include
#include |
|
g*********e 发帖数: 14401 | 41 取决于字典的大小
如果字典足够小 每个线程安排一个local的统计hashmap 每次取900M的
文件给一个线程即可。最后把hashmap加起来。 |
|
S*******C 发帖数: 822 | 42 Google面试题
Given a sequence S of integers, a subsequence is any selection of numbers of
S in the same order as S. For example, if S = 1,1,2,3,5,8,13 then 2,3,8 is
a subsequence of S and so is 1,1,5,13 and so is 1,2,3. However, 5,6,7 is not
a subsequence, 8,5,2 is also not a subsequence.
A subsequence T is increasing is T[i] < T[i+1] for all i.
Given a sequence S = 4, 9, 3, 8, 6, 7, 10 .... : we can have 3, 8, 10 or 4,
9, 10 or 4, 6,7,10 as its increasing subsequences.
Our task is : given a sequ... 阅读全帖 |
|
j**7 发帖数: 143 | 43 我感觉这题类似Counting Inversions. Algorithm Design Section 5.3 |
|
S*******C 发帖数: 822 | 44 10 million的数组,数字是8bit的非负数,排序
count sort搞定
follow up,10 million的item class,item有rating和name,根据rating sort。
rating和上面一样也是8bit unsign.
Amazon intern问题 |
|
S*******C 发帖数: 822 | 45 这样的话是调用Collections.sort()方法,这个是mergeSort()
时间复杂度是O(NlogN) 而不是counting sort 的O(N) |
|
S*******C 发帖数: 822 | 46 If you were given an array of 1 million integers representing age of people
in a city. What kind of sort would you use for that array?
然后要我实现因为在写bucketsort用了一些时间还卡顿了一下,小哥也给了提示,最后
还是写出来了。其中有试着去google,结果被小哥听到了,说你是在coding吗?你先给
我一个思路再coding···表示超级囧···
最后小哥说你做得很好,成功了99%由于时间关系,我们就停止了(此处表示很虚啊·
·····)
我认为应该用counting sort啊。bucket sort只能实现分段排序,不能每个元素都依次
排序啊 |
|
b**********5 发帖数: 7881 | 47 counting sort不就是bucket sort的一种specialised? bucket size为一。。。
这种东西, 我面试时, 会问interviewer, 他要哪种。。。。
people |
|
y*****e 发帖数: 712 | 48 可是这些都不是valid input啊,并不是count and say sequence里的一分子啊。 |
|
m**********j 发帖数: 610 | 49 现在年底好像都不怎么招人了,要么是今年的head count用完了,要么是recruiter都
去度假去了
什么时候投机会比较好呢?1月初?月中?月底?一般是不是要等度假回来,再开会制
定招人计划,还是一开过年来就马上开始大规模招人? |
|
i****t 发帖数: 85 | 50 Senior position, 口头offer, 最后一秒说head count 没批,然后一个junior 的同时
fill 了。 这个意思是公司找到更便宜的了吧?
然后说让我等重新开,可能要等两个月。这是忽悠吗? |
|