d********4 发帖数: 860 | 1 公司的401k可以match 3%,但是里面只有28个fund options,就是列在下面的,网上搜
了一下好像评价都一般,这里面blended investment好像都很一般啊,有没有想
vanguard index那种比较省心的,但是又是比较aggressive,有high yield long term
的fund啊?谢谢
如果都没有,我就放3%拿到公司的match,其他钱放ira对吧?
Bench- mark
BLKRK CAP APPR I (MAFGX)
FID 500 INDEX PR (FUSVX)
INVS DIVRS DIVD Y (LCEYX)
FID MID CAP IDX PR (FSCKX)
PRU/J MID CAP GR Z (PEGZX)
RW C MIDCAP VAL EQ I (SMVTX)
FID SM CAP IDX PR (FSSVX)
JANUS TRITON T (JATTX)
FID EM MKTS IDX PR (FPMAX)
FKLN MTL GLB DISC Z (MDISX)
INVS INTL GROWTH Y (AIIY... 阅读全帖 |
|
h******u 发帖数: 120 | 2 AmerFunds Bond America SA1E N
BlackRock GlbalAllocation SALE N,L1
Del Ltd-Term Div Income SA87 N
Del VIP DiversifiedIncome SA93N,L7
Franklin High Income SA20 N,L7
LVIP Delaware Bond SA12 N,L6
LVIP SSgA Bond Index SAL6 N,I
PIMCO Total Return SALM N
Templeton Global Bond VIP SA86 N,L1
AmerFunds Amer High-Inc SA1C N
Delaware VIP Value SA61 N
Invesco Growth & Income SA28 N
LVIP DELAW WEALTH BUILDER SA97 N,FF,22,28
LVIP JPMORGAN RETIRINCOME SA95N,FF,22,28
LVIP Managed Risk Pr 2010 SAL1 N,P1,TD
LVIP M... 阅读全帖 |
|
k*k 发帖数: 49 | 3 this should work... O(n * (n k)) where k is the range of elements. if we
only check k from 1 to s such as that s + i <= n then, the complexity
becomes n^3.....
not sure this is the most efficient....
#include
int jump(int* arr, int n){
int idx[n];
int edge[n];
int i = 0;
int j = 0;
idx[0] = 0;
for(i=1; i
int min = i;
int minidx = -1;
for(j=i-1; j>=0; j--){
int k = 0;
for(k=1; k<=arr[j]; k++){
if (arr[j]!=-1 && k+j==i){
if (idx |
|
k***e 发帖数: 556 | 4 ok, my fault
i misunderstand the problem
suppose the problem is: given an array of pos ints, find a subseqence (may
not be continuous in the idxes), that is continuous integers that sum to a
certain value)
1) for each a[i] in the array, find idxUp > i such that a[idxUp] = a[i] + 1
idxDown < i such that a[idxDown] = a[i] - 1, note that the idxUp is the one
who is closest to i (similar to find idxDown)
2) thus from any idx, we know where is the next a[idx]+1, now we need to get
the length of the c |
|
D********g 发帖数: 650 | 5 这题如果用strstr的话应该可以greedy。
pseudo code:
bool match(const char *s, const char *pattern)
{
string[] ps = string.split(pattern, '*');
foreach(string p in ps)
{
idx = s.find(p);
if (idx == -1) return false;
s = s.substr(idx + p.length());
}
return true;
} |
|
l*******o 发帖数: 791 | 6 原因是idx永远也到达不了你想的负1,因为idx是unsigned的不能表示负数。比如哦idx
为0时,你再减去一个1得到的值会overflow,这个结果还是个整数。你的循环将执行下
去 |
|
g*********s 发帖数: 1782 | 7
?
using namespace std;
vector find_duplicate_idx(const vector& A)
{
unsorted_map X;
vector idx;
for ( int i = 0; i < A.size(); ++ i ) {
unsorted_map::iterator it = X.find(A[i]);
if ( it != X.end() ) {
idx.push_back((*it).second);
break;
}
else X[A[i]] = i;
}
return idx;
} |
|
i**********e 发帖数: 1145 | 8 我写的 boggle 游戏算法,DFS + trie.
一秒以内给出所有 5x5 的答案。
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct Trie {
bool end;
Trie *children[26];
Trie() {
end = false;
memset(children, NULL, sizeof(children));
}
void insert(const char *word) {
const char *s = word;
Trie *p = this;
while (*s) {
int j = *s-'A';
assert(0 <= j && j < 26);
if (!p->childre... 阅读全帖 |
|
c**********e 发帖数: 2007 | 9 Suppose 排列 1, 2, ..., n is expressed as a[n].
long index(int a[], int n) {
long idx=0;
for(int i=0;i
idx+=(a[i]-1)*factorial(n-1-i);
return idx;
} |
|
s******n 发帖数: 3946 | 10 long index(int a[], int n) {
long idx=0;
long factorial = 1;
for(int i=n-2;i>=0;i--) {
int rank = 0;
for (int j=i+1; i
if (a[j]
factorial = factorial* (n-i-1);
idx+=rank*factorial;
}
return idx;
} |
|
b*****n 发帖数: 143 | 11 My C++ implementation:
#include
#include
#include |
|
l******6 发帖数: 340 | 12 3.
struct data{
int idx;
int val;
data(int id , int v):idx(id),val(v){}
};
int wlen = 100M;
int curVal;
int curIdx = 0;
list window;
while(cin >> curVal)
{
while(!window.empty() && window.back().val <= curVal)
window.pop_back();
window.push_back(data(curIdx , curVal));
curIdx ++;
if(curIdx - window.front().idx > wlen)
window.pop_front();
cout << window.front().val<
} |
|
A*******e 发帖数: 2419 | 13 已经是O(n)/O(1)了,怎么提交的答案在C/C++里特别慢?用了46ms,但分布图显示不到
20ms就够了,甚至还有不到10ms的。试着用equal_range跳着来,结果更慢,56ms。这
里面有啥秘诀?
class Solution {
public:
int removeDuplicates(int A[], int n) {
if (n == 0) {
return 0;
}
int dup_count = 0;
int base = A[0];
for (int i = 1; i < n; ++i) {
if (A[i] == base) {
++dup_count;
} else {
if (dup_count > 0) {
A[i - dup_count] = A[i];
... 阅读全帖 |
|
b*****p 发帖数: 9649 | 14 我的伪码
假设有N个房间,strategy[0..k]
首先initialize一个N+2的数组[0..N+1],其中0和N+1是dummy
boolean eval(int N, int[] strategy)
{
//assert N>1
ArrayList room = new ArrayList();
//room[0..N+1]都为initialized为1
for (i=0;i
if (finished(room)){
return true;
}
room[strategy[i]] = 0; //执行strategy
expand(room); //根据题意来确定下一状态
}
if (finished(room)){
return true;
}
return false;
}
boolean finish(ArrayList room){
if room[1..room.size()-2] 都为 ... 阅读全帖 |
|
k****r 发帖数: 807 | 15 来自主题: JobHunting版 - FB 题目 1. sort based on end
2. dp calculate the cost from the 1st to the last.
DP function:
for (int i = 1; i < n; i++) {
int idx = LastNonoverlopJob(input, i);
dp[i] = Math.max(dp[i - 1], idx == -1 ? input[i].profit : (dp[idx] +
input[i].profit));
}
where LastNonoverlopJob can be realized by binary search.
Any better idea? |
|
h******u 发帖数: 120 | 16 【 以下文字转载自 Investment 讨论区 】
发信人: happyhou (小猴), 信区: Investment
标 题: 请问下面401k可以选哪个? -- 谢谢
发信站: BBS 未名空间站 (Thu Nov 30 22:00:09 2017, 美东)
AmerFunds Bond America SA1E N
BlackRock GlbalAllocation SALE N,L1
Del Ltd-Term Div Income SA87 N
Del VIP DiversifiedIncome SA93N,L7
Franklin High Income SA20 N,L7
LVIP Delaware Bond SA12 N,L6
LVIP SSgA Bond Index SAL6 N,I
PIMCO Total Return SALM N
Templeton Global Bond VIP SA86 N,L1
AmerFunds Amer High-Inc SA1C N
Delaware VIP Value SA61 N
Invesco Growth & Income ... 阅读全帖 |
|
h******u 发帖数: 120 | 17 【 以下文字转载自 Investment 讨论区 】
发信人: happyhou (小猴), 信区: Investment
标 题: 请问下面401k可以选哪个? -- 谢谢
发信站: BBS 未名空间站 (Thu Nov 30 22:00:09 2017, 美东)
AmerFunds Bond America SA1E N
BlackRock GlbalAllocation SALE N,L1
Del Ltd-Term Div Income SA87 N
Del VIP DiversifiedIncome SA93N,L7
Franklin High Income SA20 N,L7
LVIP Delaware Bond SA12 N,L6
LVIP SSgA Bond Index SAL6 N,I
PIMCO Total Return SALM N
Templeton Global Bond VIP SA86 N,L1
AmerFunds Amer High-Inc SA1C N
Delaware VIP Value SA61 N
Invesco Growth & Income ... 阅读全帖 |
|
|
W*W 发帖数: 293 | 19 不好意思,我才发现我没法解决的是这个问题
对 X 里面每个元素,我需要做 interpolation 的范围不一样,就是说我有一个 idx,
idy 的matrix, 如下:
for i = 1:L
for j = 1:L
Y(i,j) = interp1(XI(idx(i,j):idy(i,j)),YI(idx(i,j):idy(i,j)), X(i,j))
end
end
这样就不能直接用 Y=interp1(XI, YI, X);来算了。 请问有什么效率更高的计算方法
吗? 我需要解的是一个 image file, 所以如果做循环计算会很慢。 |
|
w****w 发帖数: 521 | 20 搞了两个礼拜,对python有点感觉了。
import math
_expr=lambda x,y,z:"(%s%s%s)"%(x,y,z)
_plus=lambda x,y: (x[0]+y[0],_expr(x[1],"+",y[1]))
_minus=lambda x,y: (x[0]-y[0],_expr(x[1],"-",y[1]))
_rminus=lambda x,y: _minus(y,x)
_mul=lambda x,y: (x[0]*y[0],_expr(x[1],"*",y[1]))
_div=lambda x,y: (y[0]==0 and (0,"err")) or (x[0]/y[0],_expr(x[1],"/",y[1]))
_rdiv=lambda x,y: _div(y,x)
_mod=lambda x,y: (y[0]==0 and (0,"err")) or (x[0]%y[0],"mod(%s,%s)"%(x[1],y[
1]))
_rmod=lambda x,y: _mod(y,x)
def _power(x,y):
try: ret... 阅读全帖 |
|
w****w 发帖数: 521 | 21 搞了两个礼拜,对python有点感觉了。
import math
_expr=lambda x,y,z:"(%s%s%s)"%(x,y,z)
_plus=lambda x,y: (x[0]+y[0],_expr(x[1],"+",y[1]))
_minus=lambda x,y: (x[0]-y[0],_expr(x[1],"-",y[1]))
_rminus=lambda x,y: _minus(y,x)
_mul=lambda x,y: (x[0]*y[0],_expr(x[1],"*",y[1]))
_div=lambda x,y: (y[0]==0 and (0,"err")) or (x[0]/y[0],_expr(x[1],"/",y[1]))
_rdiv=lambda x,y: _div(y,x)
_mod=lambda x,y: (y[0]==0 and (0,"err")) or (x[0]%y[0],"mod(%s,%s)"%(x[1],y[
1]))
_rmod=lambda x,y: _mod(y,x)
def _power(x,y):
try: ret... 阅读全帖 |
|
c***n 发帖数: 223 | 22 1. 用matlab尽量避开for loop
2. 能事先知道结果的大小,最好先分配内存。动态分配内存特别慢,尤其是后来数组
大了之后。
3. 可以把找到的sample的index写进vector,而不是数据本身。
% find values that are larger than 0.8 from a 10000x1 vector of Gaussian %
random numbers
fakeData = randn(10000, 1);
collectedIdx = [];
for idx = 1:numel(fakeData)
if fakeData(idx) > 0.8
collectedIdx = [collectedIdx, idx];
end
end
collectedData = fakeData(collectedIdx);
当然最快的方法是用slicing,一行搞定:
collectedData = fakeData(fakeData>0.8);
loop |
|
y****n 发帖数: 46 | 23 change dapangmao's code to following:
data have;
input
xx;
idx = _n_;
SCHOOLID=xx;
cards;
1
1
5
6
10
10
10
11
;
run;
proc transpose data = have out = _tmp(drop=_name_ idx) prefix = school_;
by idx schoolid;
var xx;
id xx;
run;
data want;
set _tmp;
array a[*] school_:;
do i = 1 to dim(a);
if missing(a[i]) = 0 then a[i] = 1;
else a[i] = 0;
end;
keep s:;
run; |
|
D******n 发帖数: 2836 | 24 y not this
idx <- sample(1:99);
1) x[idx[1:33]]
2) x[idx[34:66]]
3) ... |
|
l******t 发帖数: 96 | 25 idx <- sample(20, 3) # sample three positions
x2 <- x1
x2[idx] <- x2[idx] + 1 |
|
Y****a 发帖数: 243 | 26 my guess is:
tmpTestIn@data@data@Dim[2] = 50
topn = 1000
Q1: length(v2) = 50, length(v2[[1]]) = 1000
v2 <- unlist(v2)
Q2: assume now your create df returns a data.frame of dim 50,000 x 7
dfall <- do.call('rbind',lapply(range of i, function(i) create df)
Q3:
dfall$v8 <- F(v4, v5, v6)
dfall$v9 <- 0
for (u in userIDs) {
for (i in itemIDs) {
idx <- which((dfall$userID == u) & (dfall$itemID == i))
dfall$v9[idx] <- order(dfall$v8[idx])
}
} |
|
H*H 发帖数: 472 | 27 题目的意思只懂个大概,你需要的应该是R里面的match() function
idx <- match(y$ID, x$ID)
然后你就可以用这个idx去直接提取x的信息并赋给y
y$info <- x$info[idx]
向量化操作,这么点数据,应该瞬间就能完成了 |
|
|
|
|
e******u 发帖数: 3206 | 31 好几个公众号追着我要评论,我直接就躲开了。这么多现成的科普文章,还要啥评论啊
。比如这篇https://mp.weixin.qq.com/s?__biz=MzIxOTc0MDY1MQ==&mid=2247483700&
idx=1&sn=eeb9535a48db7004caf356bb5765b3b4&chksm=
97d7e1b0a0a068a6c2117ce130b1d1cf36fe8e347cf49ad74299719b28f3242661b924582ca8
&mpshare=1&scene=1&srcid=1004S9JyqriJ95GVrmxDVXTO&pass_ticket=dC75vp080P/
U3SPKTKmLaNz2uejSQrbppYDAEBl1sW/w0EX5BR6kpXAAptH95/vb#rd
感想倒是有一些--看看今年三大科学奖项的获奖人,全部是白发苍苍,好多位退休的啊
。为啥诺奖的奖金不是最高,却依旧是科学界最被认可的一个奖?因为他总是尽量追根
溯源,找到真正的先驱和开创者,这种奖鼓励的是真正原创啊。并且经过了时间的冲洗
,剩下真金的概率也就更大不是?... 阅读全帖 |
|
发帖数: 1 | 32 “被 FDA 认定为‘突破型设备’(breakthrough device),不仅是对 IDx-DR 价值的
肯定,也坚定了我们长久以来的信念,” IDx 创始人兼总裁 Michael Abràmoff 博士
说到,“太多的人因为没有及时诊断而导致失明,这样一种高效、高性价比的方法可以
说是众望所归。” |
|
|
|
B********s 发帖数: 2575 | 35 【 以下文字转载自 USChineseRight 俱乐部 】
发信人: Blackholes (浪里白条), 信区: USChineseRight
标 题: 再跟华左谈谈心
发信站: BBS 未名空间站 (Tue Feb 14 23:36:04 2017, 美东)
以前从来没玩过微信群,前几天刚加入了几个:大部分都是床粉群,个别是床粉希粉混
合群。因为是新人,不了解新鲜的生态环境,我很少说话,经常不登录,偶尔登录的时
候就看看热闹。我很“诧异”地发现,左右都有的混合群里经常是骂得昏天黑地的。
我虽然不参与,但是心理上是跟床粉站在一起的,厌恶希粉。出于研究的目的,我仔细
观察了下希粉的行为,发现希粉虽然爱骂人不太好(我并不是说床粉就不骂人,但是这
篇是研究希粉,是我个人跟希粉的对话,所以就集中讨论希粉,不要跑题),但是希粉
的愤怒是真实的。这并不奇怪,每个人都觉得自己的政治立场最高贵,对方都是纯傻逼
。最让我奇怪的是,大选都过去这么久了,希粉居然还在喋喋不休地重复着那些古老而
幼稚的谎言,比如床粉爱传谣。唉,我老人家亲手炮制出来的那篇“又臭又长”的《防
民之口,甚于防川(普)》为什么就... 阅读全帖 |
|
B********s 发帖数: 2575 | 36 【 以下文字转载自 USChineseRight 俱乐部 】
发信人: Blackholes (浪里白条), 信区: USChineseRight
标 题: 再跟华左谈谈心
发信站: BBS 未名空间站 (Tue Feb 14 23:36:04 2017, 美东)
以前从来没玩过微信群,前几天刚加入了几个:大部分都是床粉群,个别是床粉希粉混
合群。因为是新人,不了解新鲜的生态环境,我很少说话,经常不登录,偶尔登录的时
候就看看热闹。我很“诧异”地发现,左右都有的混合群里经常是骂得昏天黑地的。
我虽然不参与,但是心理上是跟床粉站在一起的,厌恶希粉。出于研究的目的,我仔细
观察了下希粉的行为,发现希粉虽然爱骂人不太好(我并不是说床粉就不骂人,但是这
篇是研究希粉,是我个人跟希粉的对话,所以就集中讨论希粉,不要跑题),但是希粉
的愤怒是真实的。这并不奇怪,每个人都觉得自己的政治立场最高贵,对方都是纯傻逼
。最让我奇怪的是,大选都过去这么久了,希粉居然还在喋喋不休地重复着那些古老而
幼稚的谎言,比如床粉爱传谣。唉,我老人家亲手炮制出来的那篇“又臭又长”的《防
民之口,甚于防川(普)》为什么就... 阅读全帖 |
|
x****i 发帖数: 400 | 37 上次在这里问,建议说选择Target Retirement, 预计哪年退休就选哪个。这星期单位
把各种fund的简单介绍发了,怎么我看今年return,高的是Emergency Mkts Stk Idx,
Extended Mkts Stk Idx, Explore Fund Investor, International Growth Inv什
么的,都是2位数的增长。还有Long-term Bond Index也收益不错。
为什么这几种受益这么好。我还是应该选择Target Retirement吗? |
|
C*******O 发帖数: 147 | 38 其构成比如:
Vanguard Total Stock Mkt Idx Inv 60%
Vanguard Total Intl Stock Index Inv 30%
Vanguard Total Bond Market II Idx Inv 10%
那跟我自己按同等比例买以上三个INDEX有什么区别?管理费和DIVIDEND等有差别吗? |
|
s***g 发帖数: 1250 | 39 看了一年的回报,大多数都是负的,这样还有必要搞吗,特别是现在经济不景气?
谢谢
我的账号fund list如下:
Stock InvestmentsHelp for Stock Investments
Investment
Average Annual Returns
Desired %
1 Yr 3 Yr 5 Yr 10 Yr Life As of
FID BLUE CHIP GR
Inception Date 12/31/1987 -2.72% 19.04% 2.98% 2.33% 10.
04% 12/31/2011 %
FID CONTRAFUND
Inception Date 05/17/1967 -0.12% 14.70% 2.58% 6.96% 12.
06% 12/31/2011 %
FID DIVIDEND GR
Inception Date 04/27/1993 -8.51% 18... 阅读全帖 |
|
j****y 发帖数: 1714 | 40 Assuming you are 30 years old, here is a low-cost, conservative growth
portofolio.
FID INTERMED BOND : 30%
SPTN TOT MKT IDX INV: 50%
SPTN EXT MKT IDX INV: 20%
------------------------
Skip other craps.
Buy and hold, rebalance annually.
More investment information: bogleheads.org |
|
F*********o 发帖数: 351 | 41 我现在在选403b fund,没看见SPTN TOT MKT IDX INV,这个和SPTN TOT MKT IDX ADV
有大的区别吗?能不能推荐一个alternative? Thanks a lot. |
|
y*c 发帖数: 904 | 42 我们公司选择很少,牛牛们给看看怎么选?谢谢。
Investments 1 YR 3 YR 5 YR 10 YR Life As of Date
TIER 2
Stock Investments
Large Cap
VAN VALUE INDEX INST
Inception Date 07/02/1998 15.20 10.09 0.49 7.49 3.87 12/31
/2012
VANG INST INDEX PLUS
Inception Date 07/07/1997 16.00 10.88 1.72 7.14 4.87 12/31
/2012
VANG GRTH INDEX INST
Inception Date 05/14/1998 17.04 11.80 3.35 7.53 3.56 12/31
/2012
FID GROWTH CO UNITS
Inception Date 01/04/2013 N/A N/A ... 阅读全帖 |
|
s********a 发帖数: 2796 | 43 对这个东西不是很懂,去年乱放,结果亏了12%,今年不敢乱来了,能请各位执导一下该
怎么选择我的401k么?谢谢
Name Expense ratio
Company STOCK FUND Company stock(Stock) 0.01%
HARTFORD CAP APP IA Large Cap Blend(Stock) 0.67%
NT S&P 500 INDEX Large Cap Blend(Stock) 0.01%
NT RUSSELL 2000 INDX Small Cap Blend(Stock) 0.03%
TRP INST SM CAP STK Small Cap Blend(Stock) 0.73%
HARRIS OAKMRK GLOBAL World(Stock) 0.80%
NT ACWI EX-US IDX DC Foreign(Stock) 0.06%
OPPHMR DEV MKTS Y ... 阅读全帖 |
|
s********a 发帖数: 2796 | 44 对这个东西不是很懂,去年乱放,结果亏了12%,今年不敢乱来了,能请各位执导一下该
怎么选择我的401k么?谢谢
Name Expense ratio
Company STOCK FUND Company stock(Stock) 0.01%
HARTFORD CAP APP IA Large Cap Blend(Stock) 0.67%
NT S&P 500 INDEX Large Cap Blend(Stock) 0.01%
NT RUSSELL 2000 INDX Small Cap Blend(Stock) 0.03%
TRP INST SM CAP STK Small Cap Blend(Stock) 0.73%
HARRIS OAKMRK GLOBAL World(Stock) 0.80%
NT ACWI EX-US IDX DC Foreign(Stock) 0.06%
OPPHMR DEV MKTS Y ... 阅读全帖 |
|
c*******d 发帖数: 353 | 45 I can take moderate risk, I seek moderate risk growth in 401k, here are my
first 401k fund selections. Another question I would like to ask is if I
should merge my 2nd 401k into my first. Funds I already own is marked by *.
Thank you!
Fund name, inception date, 1Y, 3Y, 5Y, 10Y, lifetime, As of Date return
rate
Stock Investments
Large Cap
ABF LG CAP VAL INV
Inception Date 08/01/1994 -0.55 17.78 -1.86 5.11 7.75
01/31/2012
EATON LG CAP VALUE A
Inception Date 09/23/1931 ... 阅读全帖 |
|
m****m 发帖数: 101 | 46 现在投资:
65% stable value,
20% TRP EXT EQ MRKT IDX (mid cap)
15% TEMPLETON FOREIGN AD (international)
去年收益-4。1%,今年YTD 4。5%。 我这STABLE VALUE是不是太多了? 能帮我
看看吗?下面是可选的Plan。
Large Cap
BLKRK EQUITY DIV I
DREY BASIC S&P 500
FA NEW INSIGHTS I
Mid-Cap
BLKRK MDCPVL OP INST
COLUMBIA ACORN Z
* TRP EXT EQ MRKT IDX
Small Cap
HEARTLAND VAL PLS IS
JANUS TRITON T
Inception Date 02/25/2005
International
OPPHMR DEV MKTS Y
OPPHMR INTL GRTH Y
* TEMPLETON FOREIGN AD
THORNBURG INT VAL R5
Blended Investments
FA FREEDOM 2005 ... 阅读全帖 |
|
a*****p 发帖数: 1285 | 47 谢谢好心人啊。list 如下。
Blended Investment -- FID FREEDOM 2000 %
Blended Investment -- FID FREEDOM 2005 %
Blended Investment -- FID FREEDOM 2010 %
Blended Investment -- FID FREEDOM 2015 %
Blended Investment -- FID FREEDOM 2020 %
Blended Investment -- FID FREEDOM 2025 %
Blended Investment -- FID FREEDOM 2030 %
Blended Investment -- FID FREEDOM 2035 %
Blended Investment -- FID FREEDOM 2040 %
Blended Investment -- FID FREEDOM 2045 %
Blended Investment -- FID FREEDOM 2050 20% %
Blended ... 阅读全帖 |
|
c*******y 发帖数: 302 | 48
以前都是把401k里面的钱那么放着不知道还可以从新分配,这周来到贵版,才开始慢慢
学习。公司的vanguard里面提供了以下的fund的选择,想请教大家的建议,应该买哪些
个比较好呢?我看了去年的盈利报告,又好几个涨的很多,是应该继续跟进去年表现好
的么?万分感谢大家!
American Funds EuroPacific Gr R6 RERGX
Artisan Mid Cap Inv ARTMX
Artisan Small Cap Value Investor ARTVX
Dodge & Cox Inc Sep Acct 3631
Neuberger Berman Genesis Instl NBGIX
Vanguard Balanced In... 阅读全帖 |
|
b********n 发帖数: 632 | 49 去年一年的401k全放在money market.今年想投资一下,本人40岁,以下是
可选的投资方案。烦请各位大牛能否帮忙选一个?谢谢。
Investments 1 YR 3 YR 5 YR 10 YR Life As of Date
Stock Investments
Large Cap
FID BLUE CHIP GR
Inception Date 12/31/1987 15.26 14.80 6.95 7.86 10.50 01/
31/2013
FID CONTRAFUND
Inception Date 05/17/1967 15.02 13.92 4.83 10.45 12.22 01/
31/2013
FID DIVIDEND GR
Inception Date 04/27/1993 15.80 12.90 4.78 6.77 10.26 01/
31/2013
FID EQ DIV INCOME
Inception Date 08/... 阅读全帖 |
|