l**u
发帖数: 731 | 1 【 以下文字转载自 Texas 讨论区 】
发信人: lexu (真假~~~美猴王~~~后加价), 信区: Texas
标 题: 昨天去REC跑步的时候看到老布什了
发信站: BBS 未名空间站 (Wed Apr 11 14:19:51 2007), 转信
昨天下午，去REC
REC外面停着两辆崭新的YUKON XL，一个黑的，一个maroon的，都是暴亮的，后窗贴
着厚厚的膜，司机似乎西装，感觉像是机构的车。
进了REC，看到两个西装墨镜帅哥（在REC的汗衫裤衩环境里，西装墨镜真的很扎眼
），中间夹着穿着破背心，裤衩，一瘸一拐的老布什，哥们竟然跑来锻炼来了。嘿
嘿。不过好像在REC的小朋友们都不知道老布什在，也没见到歌迷上去要签字啥的。
要是在大陆，赶上太上皇出来，是不是REC要全场清场，戒严，然后只让根正苗红的
人进去貌似锻炼啊。 |
|
l**u
发帖数: 731 | 2 昨天下午，去REC
REC外面停着两辆崭新的YUKON XL，一个黑的，一个maroon的，都是暴亮的，后窗贴
着厚厚的膜，司机似乎西装，感觉像是机构的车。
进了REC，看到两个西装墨镜帅哥（在REC的汗衫裤衩环境里，西装墨镜真的很扎眼
），中间夹着穿着破背心，裤衩，一瘸一拐的老布什，哥们竟然跑来锻炼来了。嘿
嘿。不过好像在REC的小朋友们都不知道老布什在，也没见到歌迷上去要签字啥的。
要是在大陆，赶上太上皇出来，是不是REC要全场清场，戒严，然后只让根正苗红的
人进去貌似锻炼啊。 |
|
C********o
发帖数: 67 | 3 小rec被一对B-组合随意推倒数次，向哥求救，哥带着rec 2v2直接把对方打傻了
对方问rec，I wonder what is the real rank of the player you are playing with
, B+,A- or A?
哈哈唯有小rec你的菜才能反衬出哥的刚猛啊~ |
|
A******7
发帖数: 1920 | 4 上市公司的bank rec,几十页的bank statement,百万百万的balance？
每天都rec, 还是每周rec?
我帮客户做过的最大statement是30多页，一个月的，用了4个小时。因为不是上市公司
，discrepancies都放到一个clearing account, 到年底close到misc expenses。 |
|
A******7
发帖数: 1920 | 5 上市公司的bank rec,几十页的bank statement,百万百万的balance？
每天都rec, 还是每周rec?
我帮客户做过的最大statement是30多页，一个月的，用了4个小时。因为不是上市公司
，discrepancies都放到一个clearing account, 到年底close到misc expenses。 |
|
P******i
发帖数: 22 | 6 Totally agree with Stone. For Bank Rec, the most challenging part is to find
what the transaction is for so you can know how to record it. I used to
reconcile about 27 bank accounts and were able to finish all the recs in 4
days since I had much more other duties to take care. The bank rec is boring
and so straight forward. Excel skills (such as Pivot table and VLookup) can
help you identify which transactions are recorded or not recorded quickly.
bank |
|
m******8
发帖数: 2153 | 7 韩国的同性恋题材影片《REC》将于11月24日上映，电影海报上和影片中都有一对男男
情侣的床上性爱亲密镜头，该片在韩国已被定为少儿不宜。
2010年就已摄制完成的《REC》片长约65分钟，是关于一对男同性恋情侣在一起五
周年时，来到一家小旅馆，拍摄记录下两人的生活甚至性爱，以此留下美好的时光和纪
念，见证爱情和承诺，但同时他们的感情却又出现了问题，五周年或许也是他们的关系
结束的时候。（爱白网）
剧照：http://www.aibai.com/infoview.php?id=22803 |
|
I****d
发帖数: 185 | 8 ftl你这是肿么了，对rec失去兴趣了？原来可是只有你才能弹他小jj的来着...
乃不能酱紫对基友啊，人家rec从来都对你一心一意的啊... |
|
b******g
发帖数: 2965 | 9 广告标题:
3/05 pc receipt upc 换 3/30 or 4/3 pc rec
我现有的物品:
3/05 pc receipt up
我想要的物品:
4/3 pc receipt up
建议交换比率 (required):
1:1
邮寄方式要求:
email
买卖双方谁承担邮寄损失(required if not code only):
其它补充说明:
广告的有效期:
我的联系方式:
bbs
单张面值:
物品来源 (required for ALL cards!):
lenovo |
|
g********e
发帖数: 1638 | 10 please judge the chance
===
Dr. ****
Thank you so much for your time spent at our ***** facility. It was a
pleasure meeting you, and your patience was very much appreciated.
At this time, we believe that your background and qualifications would
make you a better candidate for REC’s Technology Department than Sales and
Marketing. Your resume has been forwarded to the Technology Manager, and we
will be in touch soon.
Regards,
**** |
|
g********e
发帖数: 1638 | 11 REC还有很多job opening。他们的决定是很明智的。我都不知道这个工作是sale和
marketing的。面试的时候我吹嘘了很多technology的地方。 |
|
s********e
发帖数: 1596 | 12 【 以下文字转载自 Parenting 讨论区 】
发信人: smallstone (小丸子), 信区: Parenting
标 题: Need Recs for Christmas Gift for 3.5 yr Girl? Thanks a million!
发信站: BBS 未名空间站 (Mon Dec 20 12:29:48 2010, 美东)
Finally got a little break from work. Haven't bought anything for my 3.5 yr
daughter. All she wants is a Toy Car cup and a green spoon. Any idea where
can I get these?
And any other ideas about the gift? I bought a kitchen set for her, and she
does not seem to be interested. Anything else?
Does eveybody buy gifts for an... 阅读全帖 |
|
d**********r
发帖数: 24123 | 13 no
if you sell on rec day, you get the dividend.
if you buy on ex-dividend day, you get the dividend |
|
H*****5
发帖数: 8 | 14 Start from this Saturday, Lake Bluff Rec Center opens for badminton two
times a week: Saturday morning (9:00am to 11:00am) and Wednesday night (7:
00pm to 9:00pm). Address is 355 West Washington Avenue,Lake Bluff, IL 60044,
admission fee is $5 each. There are three wood courts and players of
different levels. |
|
y****i
发帖数: 17878 | 15 I think anyone can purchase Rec Card, but you pay higher fee as general
public than students, faculty, senior, etc. |
|
|
t***z
发帖数: 5112 | 17 如果俩孩子有一个孩子在那里上课，另外一个孩子可不可以免费在旁边游泳？我们去的
wakefield的那个可以但是不知道providence rec center是不是也一样呢？多谢！ |
|
|
C********o
发帖数: 67 | 19 哈哈rec总是想速飞龙，每次都被人按住猛X，太柔弱了~ |
|
C********o
发帖数: 67 | 20 reach 小jj每天晚上在mitbbs channel等待你噢，亲~
1v1 2v2 3v3任您选择噢亲~让我们每天晚上都一起弹rec的小jj吧，亲~ |
|
l***y
发帖数: 791 | 21 saw this rec somewhere online, if you wanna do something like a gore-feast
marathon, here is a list of 'em up to 2000:
American Psycho (2000) -- Christian Bale
The Watcher (2000) -- Keanu Reeves, James Spader, Marisa Tomei
Felicia's Journey (1999) -- Bob Hoskins, Elaine Cassidy
Eye of the Beholder (1999) -- Ewan McGregor, Ashley Judd, k.d. Lang, Jason
Priestley, Geneviève Bujold
The Talented Mr. Ripley (1999) -- Matt Damon, Jude Law, Gwyneth Paltrow
Immortality (1998) (or the wisdom of crocodile |
|
l*****0
发帖数: 287 | 22 现在还有一个月的时间～～不知道来得来不及
或者我留到明年考？听说明年REC简单 |
|
|
s******8
发帖数: 108 | 24 yes, I do know the pains you have. I was doing over 20 bank rec in my
company a few years ago, the most difficult part to me was finding the bank
transactions that nobody knew what these were. Other than that, I would
think just need to be patient, and try to manager the deadlines. Goodluck
on
you, |
|
v*****1
发帖数: 3980 | 25 如果你是entry level， 做bank rec是基础，而且慢慢会积累经验熟悉公司运作，知道
问题出在哪儿对以后做financial或analysis有帮助，不能机械性地做那就没意思了 |
|
w*******y
发帖数: 60932 | 26 Energy RC Micro Theater System-Harman Kardon BDS 5 SO 5.1 AV Rec and Blu Ray:
http://www.acousticsounddesign.com/core/view_BigProduct.cfm?pid
$1,398 - $629 = $769 with code rcmicro
Atlantic Technology System 2400 #2-Harman BDS 5.1 AV Receiver and Blu-Ray
$2,624 - $1,725 = $899 with code ats2400
Polk Audio Blackstone TL350 System-Harman BDS 5.1 AV Receiver and Blu-Ray
$1,548 - $650 = $899 with code Blackstone
|
|
|
B****2
发帖数: 8892 | 28 http://www.athlonsports.com/college-football/college-footballs-
1. Adrian Peterson, Oklahoma (2004-06)
Stats: 747 att., 4,045 yds, 41 TD, 24 rec., 198 yds, TD
The BCS version of Herschel Walker or Bo Jackson was the three-year star
from Palestine (Texas) High. A three-time first-team All-Big 12 runner
finished No. 2 in the Heisman Trophy voting as a true freshman in 2004. His
1,925 yards was an NCAA record for a true freshman and it earned him
unanimous All-American honors. Despite missing chunk... 阅读全帖 |
|
w****x
发帖数: 2483 | 29 发现这道题属于没见过肯定想不出来，知道怎么解也很难写对。昨天重新写了一下，觉
得学到蛮多的，分享一下。
以前写过一个很挫的DP版本：
int GetEditDist(const char* str1, const char* str2)
{
assert(str1 && str2);
int nLen1 = strlen(str1);
int nLen2 = strlen(str2);
int* rec = new int[nLen2];
bool bFound = false;
for (int i = 0; i < nLen2; i++)
{
if (str2[i] == str1[0])
bFound = true;
rec[i] = bFound ? i : i+1;
}
bFound = (str2[0] == str1[0]); //(str2[0] == str1[0]) not false
for (int i = 1; i < nLe... 阅读全帖 |
|
s*****h
发帖数: 44903 | 30 ☆─────────────────────────────────────☆
sunfish (sunfish) 于 (Thu Jan 19 12:29:23 2017, 美东) 提到:
请竞猜周日AFC/NFC CCG两场：
竞猜1. [email protected]/* */的胜负分差
竞猜回答示例：如果您认为法空能赢5分， 可简写为 ATL-5
竞猜2. [email protected]/* */的胜负分差
回答示例：NE-6
竞猜3. 钢人RB铃铛的RUSH YDS
回答示例：120码
竞猜4. 法空WR狐狸琼的REC YDS
回答示例：120码
竞猜5. 龙哥和毅力软 PASS YDS的差值
回答示例：如果您认为龙哥PASS YDS比毅力软多20码，可以简写为 龙哥-20
反之毅力软PASS YDS比龙哥多30码，则简写为 毅力软-20
竞猜6. 大本和汤哥 PASS YDS的差值
回答示例：汤哥-30
===
以上6项竞猜独立发奖 猜中最接近者平分100伪币
合计总奖金600伪币
大家猜多项 单项均可
奖金赛后将请伪币中心代发
感谢大... 阅读全帖 |
|
p*****3
发帖数: 488 | 31 原来java里有balanced的BST, 比C++的好用些，就是接口太多了，记不住。
写了一个求2d overlap矩形面积的题，
核心代码没多少，code都是定义各种结构各种override各种comparator去了:
public class EPI_14_20_3 {
static class Rectangle {
public int xBeg;
public int xEnd;
public int yBeg;
public int yEnd;
public Rectangle(int xb, int xe, int yb, int ye) {
xBeg = xb;
xEnd = xe;
yBeg = yb;
yEnd = ye;
}
}
static class EndPoint {
public int index... 阅读全帖 |
|
d*k
发帖数: 207 | 32 好久没在线练习了，写个valid string，欢迎斧正
// assume n >= 3 for simplicity
int valid_string(int n) {
int rec[2][3][3];
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
rec[2&1][i][j] = 1;
}
}
for (int i = 3; i <= n; ++i) {
for (int x = 0; x < 3; ++x) {
rec[i&1][x][x] = sum(rec[(i-1)&1][x], rec[(i-1)&1][x] + 3);
int y = (x+1) % 3;
int z = (x+2) % 3;
rec[i&1][x][y] = sum(rec[(i-1)&1][y], rec[(i-1)&1][... 阅读全帖 |
|
g**********y
发帖数: 14569 | 33 赞！
试试G的题：
1. 二分找左右边界。
2. 常见题
3. 用一个collector收集结果，最底层的function:
isOverlapping(Rectangle a, Rectangle b)
collectCommon(ArrayList collector, Rectangle a, Rectangle b)
递归比较子节点，如果overlap, 进一步比较子节点，直到叶子，最后计算结果存入
collector。
4. 5.
6. DP
7. DFS
8. 计算P(i) = score(i)/sum(score[1..n]), 然后随机生成
9. 这个写起来最繁，45分钟内把头绪理清楚而且写清楚，我觉得很难，这是个大致框
架：
public class FindVertex {
ArrayList findVertices(Rectangle[] r) {
ArrayList collector = new ArrayList();
HashMap阅读全帖 |
|
x*********w
发帖数: 533 | 34 来自主题: JobHunting版 - 问道算法题 const char* minimumPadding(const char* szStr, char res[])
{
if (NULL == szStr || *szStr == 0 || NULL == res)
return 0;
int nLen = strlen(szStr);
int rec[100][100] = { 0 };
for (int i = 0; i < nLen-1; i++)
{
rec[i][i+1] = szStr[i] == szStr[i+1] ? 0 : 1;
}
for (int i = 2; i < nLen; i++)
{
for (int j = 0; j < nLen-i; j++)
{
rec[j][j+i] = 1 + min(rec[j+1][j+i], rec[j][j+i-1]);
if (szStr[j] == szStr[j+i])
... 阅读全帖 |
|
w****x
发帖数: 2483 | 35 vector getJumpSteps(int nCur, int nMaxStep)
{
vector vec;
if (nCur <= 0 || nMaxStep < nCur)
return vec;
int flg = 1;
while (nCur + flg <= nMaxStep)
{
vec.push_back(nCur + flg);
flg = (flg << 1);
}
flg = 1;
while (nCur - flg > 0)
{
vec.push_back(nCur - flg);
flg = (flg << 1);
}
return vec;
}
int getMinStep(int n, int nMaxStep)
{
if (n <= 0 || nMaxStep < n)
return -1;
int* rec = new int[nM... 阅读全帖 |
|
d**********x
发帖数: 4083 | 36 应该没问题，和coldknight的程序在2-10000之内做了对比，结果完全一致。他的
nMaxStep我设置为了2 * target，不知道会不会引起问题。
在纸面上也做了不太严格的证明。。这样复杂度就是O(logn)。
对比程序：（前半部分还是coldknight的）
#include
#include
#include
using namespace std;
vector getJumpSteps(int nCur, int nMaxStep)
{
vector vec;
if (nCur <= 0 || nMaxStep < nCur)
return vec;
int flg = 1;
while (nCur + flg <= nMaxStep)
{
vec.push_back(nCur + flg);
flg = (flg << 1);
}
flg = 1;
while (nCur - ... 阅读全帖 |
|
w****x
发帖数: 2483 | 37 做了一个QuadTree
struct PT
{
int x;
int y;
};
struct REC
{
POINT topLft;
POINT bottomRgt;
REC(int a, int b, int c, int d)
{
topLft.x = a;
topLft.y = b;
bottomRgt.x = c;
bottomRgt.y = d;
}
bool inRect(PT pt)
{
return pt.x >= topLft.x && pt.x <= bottomRgt.x
&& pt.y >= topLft.y && pt.y <= bottomRgt.y;
}
bool intersect(REC rect)
{
return min(bottomRgt.x, rect.bottomRgt.x) >= max(topLft.x, rect.
to... 阅读全帖 |
|
w****x
发帖数: 2483 | 38 来自主题: JobHunting版 - 请教两个题 max rectangle做了个O(n^3)的解法， histogram那个我是不指望了
const int M = 5;
int GetMaxRect(bool A[M][M])
{
int rec[M][M];
for (int j = 0; j < M; j++)
{
for (int i = 0; i < M; i++)
{
if (A[i][j])
rec[i][j] = 0;
else
rec[i][j] = i == 0 ? 1 : 1 + rec[i-1][j];
}
}
int nMax = 0;
for (int i = M-1; i >= 0; i--)
{
for (int j = i; j >= 0; j--)
{
int nLen = 0;
int nBeg = -... 阅读全帖 |
|
f*******e
发帖数: 3433 | 39 我投的一般有4个：
high rec
rec
low rec
not rec
high rec + rec < 30%
low rec - 35%左右
not rec - 35%左右 |
|
w****x
发帖数: 2483 | 40
/*
Given an array list of lots of strings, they are arranged by unknown
alphabetical
order, print all possible alphabetical orders (Sort)
*/
void buildMap(const char* str[], int n, int nBeg, bool bMap[26][26])
{
if (str == NULL || n <= 1) // <= 1 not 0
return;
int nPrev = 0;
while (str[nPrev][nBeg] == 0 && nPrev < n) // missing nPrev < n
nPrev++;
int nIter = nPrev + 1;
while (nIter < n)
{
if (str[nPrev][nBeg] != str[nIter][nBeg])
{
... 阅读全帖 |
|
x*********w
发帖数: 533 | 41 第一题：
这里假设都是正数并且打印了需要变为负数的数字
/*
* Given a set of integer, you could apply sign operation to the integer,
find
the minimum sum that is close to but no less than 0;
eg.
input 3 5 7 11 13
output 1
* */
public class SubSetSum
{
static int getNegOnes(int a[])
{
int sum = 0;
for (int i = 0; i < a.length; i++)
sum += a[i];
int half = sum/2;
boolean[][] rec = new boolean [a.length][half+1];
for (int i = 0; i < a.leng... 阅读全帖 |
|
G**Y
发帖数: 33224 | 42 M. Ryan QB 342 Pass Yds, 2 Pass TD, 1 Int 19.68
R. Rice RB 121 Rush Yds, 1 Rush TD, 15 Rec Yds 19.60
D. Murray RB 53 Rush Yds, 1 Rush TD, 22 Rec Yds 13.50
S. Smith WR 109 Rec Yds 10.90
V. Jackson WR 131 Rec Yds, 1 Rec TD 19.10
A. Hernandez TE 58 Rec Yds, 2 Rec TD 17.80
V. Ballard RB 94 Rush Yds, 10 Rec Yds 10.40
C. Barth K 3 PAT 3.00
Jets DEF 10 Pts, 3 Sck, 2 Int 11.00
除了Kicker全是理想发挥了。打出了本人呢本赛季最高分。（不过还不是本轮最高分，
有Seattle D的那哥们更高。好在没碰上他。呵呵。）
成功的阻击了对家进入季后赛的机会。也算为本赛区做了贡献。
常规赛最后6胜8负，列第9。我们这里第4名也只有7胜。所... 阅读全帖 |
|
w****x
发帖数: 2483 | 43 上个O(n)空间的
bool isInterleave(string s1, string s2, string s3) {
const char* p1 = s1.c_str();
const char* p2 = s2.c_str();
const char* p3 = s3.c_str();
int nLen1 = strlen(p1);
int nLen2 = strlen(p2);
int nLen3 = strlen(p3);
if (nLen3 != nLen1 + nLen2)
return false;
if (nLen3 == 0) return true;
bool* rec = new bool[nLen2+1];
for (int i = nLen1; i >= 0; i--)
{
... 阅读全帖 |
|
w****x
发帖数: 2483 | 44 一直认为面试出这么难得题真是过分啊！！
================= kth element in young tablet (M+N)log(numeric range)
solution ===========
const int M = 4;
const int N = 4;
int getOrder(int A[M][N], int tg)
{
int c = 0;
int i = 0;
int j = N-1;
while (i < M && j >= 0)
{
if (A[i][j] >= tg)
j--;
else
{
c += j+1;
i++;
}
}
return c+1;
}
int getKthMin(int A[M][N], int k)
{
if (k <= 0 || k > M*N)
return INT_MIN;
int nBe... 阅读全帖 |
|
l*n
发帖数: 529 | 45 每个时间段还有找最大的要求，应该会比O(nolgn)要稍大。
class Record {
int start;
int end;
int vol;
public Record(int s, int e, int vol) {
assert (s < e);
this.start = s;
this.end = e;
this.vol = vol;
}
}
class Point {
int time;
boolean isStart;
Record rec;
public Point(int time, boolean isStart, Record rec) {
this.time = time;
this.isStart = isStart;
this.rec = rec;
}
}
ArrayList loudestVol(Record[] varr) {
assert (v... 阅读全帖 |
|
l*n
发帖数: 529 | 46 class Record {
int start;
int end;
int vol;
public Record(int s, int e, int vol) {
assert (s < e);
this.start = s;
this.end = e;
this.vol = vol;
}
}
class Point {
int time;
boolean isStart;
Record rec;
public Point(int time, boolean isStart, Record rec) {
this.time = time;
this.isStart = isStart;
this.rec = rec;
}
}
ArrayList loudestVol(Record[] varr) {
assert (varr != null);
ArrayList阅读全帖 |
|
y**********a
发帖数: 824 | 47 int longestTwoCharWindow(String s) {
if (s.length()==0) return 0;
char c1=s.charAt(0),c2=c1;
int ct=1,ml=1,rec=1;
for (int l=0,r=1;r
if (ct==1)
if (s.charAt(r)==c1)++rec;
else {++ct;rec=1;c2=s.charAt(r);}
else if (ct==2)
if (s.charAt(r)==c1){rec=1;}
else if (s.charAt(r)==c2){++rec;}
else {l=r-rec;rec=1;c1=c2;c2=s.charAt(r);}
ml=... 阅读全帖 |
|
y**********a
发帖数: 824 | 48 int longestTwoCharWindow(String s) {
if (s.length()==0) return 0;
char c1=s.charAt(0),c2=c1;
int ct=1,ml=1,rec=1;
for (int l=0,r=1;r
if (ct==1)
if (s.charAt(r)==c1)++rec;
else {++ct;rec=1;c2=s.charAt(r);}
else if (ct==2)
if (s.charAt(r)==c1){rec=1;}
else if (s.charAt(r)==c2){++rec;}
else {l=r-rec;rec=1;c1=c2;c2=s.charAt(r);}
ml=... 阅读全帖 |
|
d*******d
发帖数: 2050 | 49 好吧，我写个copy random graph的通解，对一切graph，tree，list什么的都有效。
区别是O(n)space 复杂度。可以拿来救场。
标准list copy应该是O(n) time, O(1) space.
假设hash class, equal class已经定义好了。
Node * copy(Node * root, unordered_map & rec){
if(root == 0)
return 0;
unordered_map::iterator it = rec.find(root);
if( it != rec.end()){
return it->second;
}else{
Node * newnode = new Node(root);// a new node, copy data
rec.insert(make_pair( root, newnode));
// then copy each ... 阅读全帖 |
|
