w*p
发帖数: 16484 | 1 The best vertical jump (no step) result from the 2012 NBA pre-draft combine
camp was 38 inches (96.5 cm) by Justin Anderson (see more 2015 NBA combine
results).
The best vertical jump (no step) result from the 2012 NBA pre-draft combine
camp was 36.5 inches (92.7 cm) by Jabari Brown (see more 2014 NBA combine
results).
The best vertical jump (no step) result from the 2012 NBA pre-draft combine
camp was 35.5 inches (90.2 cm) by Cody Zeller (see more 2013 NBA combine
results).
The best vertical ju... 阅读全帖 |
|
f*********m
发帖数: 726 | 2 题目如下，求code。非常感谢。
Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find
all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … ,ak) must be in non-descending
order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate s... 阅读全帖 |
|
c*****a
发帖数: 808 | 3 大牛快来看看
Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find
all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending
order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2... 阅读全帖 |
|
j*******t
发帖数: 223 | 4 大体顺序是这样的。有一点需要注意的是combiner的输出格式需要和map保证一样。即
不光是数据类型一样（这个编译器基本可以保证），含义也应该一样。
k1,v1 -> map -> k2,v2
k2,v2 -> combiner -> k2,v2
k2,v2 -> reduce -> k3,v3
需要注意的一点是combiner的行为在不同的版本不一样，具体可以参考HADOOP-3586，
https://issues.apache.org/jira/browse/HADOOP-3586。
基本大意就是：combiner可能会运行0-N次，因此一个程序应该考虑到无论combiner调
用多少次，其结果都应该正确。 |
|
l********r
发帖数: 140 | 5 Given an array (assume numbers, no duplicate),
print all its combinations.
My code clearly generates duplicates. :-(
public static void combination(ArrayList data)
{
combination(data, 0);
}
private static void combination(ArrayList data, int index)
{
if (index >= data.size())
return;
printArrayUpToIndex(data, index);
for (int i=index; i
{
swap(data, index, i);
combi... 阅读全帖 |
|
w***w
发帖数: 6301 | 6 周琦很可能隐瞒了站立摸高。
https://valleyofthesuns.com/2016/05/23/zhou-qi-ridiculous-verti
Zhou Qi’s Ridiculous Length
entire 2016 NBA Draft prospect pool.
He is physically gifted, coming in at over 7′ 1″ without shoes, and has a
7′ 7.75″ wingspan. Those are some of the best measurements in NBA Combine
history, with Rudy Gobert a notable player to beat those measurements,
coming in at 7′ 0.5″ with a 7′ 8.5″ wingspan.
Gobert is one of the best defenders in the NBA, and at 245 pounds comes in
27 pounds heavier... 阅读全帖 |
|
w*******y
发帖数: 60932 | 7 For all riders out there, spring is coming and if you are in a need of a
bicycle lock VMInnovations has a great deal. For $4.5 you basically get a
some type of lock that Amazon sells for $11.50. Use the coupon "VMSAVE10" to
save 10%, works on everything else too.
Comparable lock on Amazon is $11.50 Link:
http://www.amazon.com/Mongoose-Cable-Combo-Bicycle-5-Feet/dp/B0
Master Lock 4-Digit Combination Bicycle Lock 5 feet
Steel coil cable for use in high risk areas
Set your own digit combination in ... 阅读全帖 |
|
e***s
发帖数: 799 | 8 Given a collection of candidate numbers (C) and a target number (T), find
all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … ,ak) must be in non-descending order.
(ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5 and target 8,
A solution set i... 阅读全帖 |
|
e***s
发帖数: 799 | 9 Given a collection of candidate numbers (C) and a target number (T), find
all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … ,ak) must be in non-descending order.
(ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5 and target 8,
A solution set i... 阅读全帖 |
|
I********T
发帖数: 22 | 10 题目是leetcode上online judge的combination， 就是n个数(1,2,3,4...n)找k个数的
combination. 一般都用递归做，可是这样就会把有些combination重复算。 比如： C(
n,k) = C(n-1, k-1) + C(n-1, k) = C(n-2, k-2) + C(n-2,k-1) + C(n-2,k-1) + C(n
-2, k). 这样C(n-2,k-1)就重复了。 如果用dp做的话就可以缓存C(n-2,k-1)的结果。
这两种复杂度各是多少呢? 我觉得递归做是C(n,k)，因为复杂度公式和combination计
算公式一样。 dp做好像是N*k （假设我们用table缓存结果）。 可是由于table里每个
格子的存的元素数目大于一，所以复杂度还是C(n,k)。
这样的话是不是说dp在这个问
题上毫无优势? 谢谢 |
|
l**********1
发帖数: 415 | 11 Given two integers n and k, return all possible combinations of k numbers
out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
the given api is
public ArrayList> combine(int n, int k)
the solution I got is as follows which is really slow O(n!) and time out at
10,7. So please provide any idea of higher efficiency algorithm for this
one. Thanks in advance
public void combination(ArrayList> r... 阅读全帖 |
|
d******n
发帖数: 189 | 12 我不仅收到EAD combination card, 而且也收到单独两张带照片的AP approved notice
, 但是奇怪的是老婆只有combination card， 但是老婆的没有单独AP approved
notice， 而且 I131 form status online still initial review。
问律师说移民局把我的弄错了还说网上的状态没关系， 说我收到combination card 不
应该再收到单独的AP 批准。
大家是不是都是这样只有combination card呢？心理总觉得有点不靠谱啊，谢谢大家! |
|
s**********8
发帖数: 25265 | 13 Combination Product Definition
Combination products are defined in 21 CFR 3.2(e). The term combination
product includes:
(1) A product comprised of two or more regulated components, i.e., drug/
device, biologic/device, drug/biologic, or drug/device/biologic, that are
physically, chemically, or otherwise combined or mixed and produced as a
single entity;
(2) Two or more separate products packaged together in a single package or
as a unit and comprised of drug and device products, device and biol... 阅读全帖 |
|
I*******g
发帖数: 7600 | 14 In the game drawing, the balls are removed one at a time. Once a ball is
drawn, that number cannot be repeated. For the five white balls, there are 5
,006,386 combinations that may be drawn. Because there are 35 red balls, the
total number of combinations for the white balls is multiplied by 35.
Therefore, the total number of possible combinations is 175,223,510. There
are eight other ways to win a prize other than matching all five white balls
and the one red ball. |
|
l****z
发帖数: 29846 | 15 Obama has held more re-election fundraisers than previous five Presidents
combined as he visits key swing states on 'permanent campaign'
By Toby Harnden
PUBLISHED: 07:41 EST, 29 April 2012 | UPDATED: 14:16 EST, 29 April 2012
Barack Obama has already held more re-election fundraising events than every
elected president since Richard Nixon combined, according to figures to be
published in a new book.
Obama is also the only president in the past 35 years to visit every
electoral battleground sta... 阅读全帖 |
|
S**e
发帖数: 1597 | 16 二手交易风险自负！请自行验证是否合法和一手卡！:
y
我想卖的物品:
$386.25 combined sears/kmart/landend gc
单张面值:
386.25
可接受价格(必须明码标价！):
0.91
物品新旧要求:
new
邮寄方式要求:
code
买卖双方谁承担邮寄损失(Required if not code only):
n/a
付款方式说明:
boa or pp
其他补充说明:
i got a few combined cards
广告的有效期:
物品来源(Required for All Cards!):
combined in the local store
我的联系方式:
n*****[email protected] or mitbbs.com
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
y |
|
d*******a
发帖数: 113 | 17 我想卖的物品:
Dell GC
单张面值:
Combinable GC 400＊3
promo：75＊2
可接受价格(必须明码标价！):
combinable GC 400*3 @ 0.95
75 promo GC @ 50 each
物品新旧要求:全新，75 promo GC 3个月有效，不能combine
邮寄方式要求:
email code
付款方式说明:
淘宝支付宝人民币中间价，或 non－cc paypal
请发gmail联系：d********[email protected] |
|
k*******r
发帖数: 2271 | 18 二手交易风险自负！请自行验证是否合法和一手卡！:
Y
我想卖的物品:
Dell GC $400 @ 0.93 *10 Combineable
单张面值:
Dell GC $400 @ 0.93 *10 Combineable
可接受价格(必须明码标价！):
Dell GC $400 @ 0.93 *10 Combineable
物品新旧要求:
邮寄方式要求:
code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
boa citi chase online transfer only
其他补充说明:
广告的有效期:
物品来源(Required for All Cards!):
我的联系方式:
pm
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
i********5
发帖数: 65 | 19 所提何事::
请提前combine你的toysrus gc
重要程度(星级):
rp
网址(如太长,请用http://tinyurl.com转换一下):
细节:
toysrus 已经被gc 搞烦了， 不要增加不必要的麻烦。 babysrus 也可以combine
为防止盗卡， 最后提前一天combine。 |
|
z9
发帖数: 648 | 20 我想卖的物品:
target GC combined $1200
单张面值:
$1200
可接受的价格 (required):
0.97
物品新旧要求:
newly combined in local store
邮寄方式要求:
email or YCYP
买卖双方谁承担邮寄损失(required if not code only):
n/a
付款方式说明:
boa,non-cc paypal (prefer BOA,如果可以BOA还可以再提供一些combined target)
其他补充说明:
serious buyer only! 因为面值比较大，加上最近不太平，所以老ID,名ID only,谢谢
理解
广告的有效期:
till gone
物品来源 (required for ALL cards!):
local store
我的联系方式:
bbs
warranty期限: |
|
m****r
发帖数: 363 | 21 我想卖的物品:
Lord and Taylor GC Combined $500
单张面值:
500
可接受的价格 (required):
0.90+shipping
物品新旧要求:
邮寄方式要求:
you choose you pay
买卖双方谁承担邮寄损失(required if not code only):
default
付款方式说明:
boa
paypal
其他补充说明:
广告的有效期:
till gone
物品来源 (required for ALL cards!):
DP-> combined at local store
我的联系方式:
bbs
warranty期限:
是否有Receipt? (Required for All cards!):
The receipt for combining at local store is available. |
|
S**e
发帖数: 1597 | 22 二手交易风险自负！请自行验证是否合法和一手卡！:
y
我想卖的物品:
$386.25 combined sears/kmart/landend gc
单张面值:
386.25
可接受价格(必须明码标价！):
0.91
物品新旧要求:
new
邮寄方式要求:
code
买卖双方谁承担邮寄损失(Required if not code only):
n/a
付款方式说明:
boa or pp
其他补充说明:
i got a few combined cards
广告的有效期:
物品来源(Required for All Cards!):
combined in the local store
我的联系方式:
n*****[email protected] or mitbbs.com
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
y |
|
d*******a
发帖数: 113 | 23 我想卖的物品:
Dell GC
单张面值:
Combinable GC 400＊3
promo：75＊2
可接受价格(必须明码标价！):
combinable GC 400*3 @ 0.95
75 promo GC @ 50 each
物品新旧要求:全新，75 promo GC 3个月有效，不能combine
邮寄方式要求:
email code
付款方式说明:
淘宝支付宝人民币中间价，或 non－cc paypal
请发gmail联系：d********[email protected] |
|
k*******r
发帖数: 2271 | 24 二手交易风险自负！请自行验证是否合法和一手卡！:
Y
我想卖的物品:
Dell GC $400 @ 0.93 *10 Combineable
单张面值:
Dell GC $400 @ 0.93 *10 Combineable
可接受价格(必须明码标价！):
Dell GC $400 @ 0.93 *10 Combineable
物品新旧要求:
邮寄方式要求:
code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
boa citi chase online transfer only
其他补充说明:
广告的有效期:
物品来源(Required for All Cards!):
我的联系方式:
pm
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
w******i
发帖数: 1476 | 25 cannot use gc to buy gc either here.
you can combine the gcs in either kmart or sears in the stores.
i usually combine the cards into $200 each in sears-- because it requires
the manager's approval if combination is beyond 200. kmart has not this
problem. |
|
s********d
发帖数: 2216 | 26 刚开始搞 GC， 小面额太难出手了。
TRU/BRU 可以去店里 combine 吗？ 是用 gc 买 gc 还是去 customer service 弄？
BN呢
DELL 是不是只能打 customer service 电话才能 combine？
先谢谢了 |
|
s********d
发帖数: 2216 | 27 刚开始搞 GC， 小面额太难出手了。
TRU/BRU 可以去店里 combine 吗？ 是用 gc 买 gc 还是去 customer service 弄？
BN呢
DELL 是不是只能打 customer service 电话才能 combine？
先谢谢了 |
|
e*******o
发帖数: 1287 | 28 才知道有第三方网站可以combine. 不知道she+买来的dell gc能不能combine? 另外这
样到第三方去combine可靠不可靠？
谢谢！ |
|
x*****m
发帖数: 29 | 29 p.s. 看来之前那个题目说错话了, 就是觉得这个框架挺容易理解记忆的,既不是最优也不是最简单也不是最**最&&的,大
家轻拍..轻拍...
刚刚研究出来的~ 觉得还挺直观挺好记忆的~
Combination(s, start, k) : 从串s的位置start开始选k个元素
从位置1开始,分成选位置1和不选位置1的
然后递归调用,位置2,继续分成选位置2和不选位置2的...依次类推
如果剩下的和k相等,或者k==0了,就选择完毕了可以输出一个combination了
my code:
void Combination(std::string s, int start, int k) {
std::string temp;
int remaining = s.size() - start;
if (remaining == k) {
std::cout << s << std::endl;
return;
}
if (k == 0) {
std::cout << s.erase(start, |
|
m******9
发帖数: 968 | 30 我再贴个另外的写法吧，思路还是沿用你自己的思路，就是每个index 分成选择，或者
不选择。 你可以加上一个辅助数组，用来标记那些index被选择了，哪些没有被选择。
void combination(char* s, int start, bool* c, int n)
{
if(s[start]=='\0'){
print_combination(s, c, n);
return;
}
c[start] = true;
combination(s, start+1,c,n);
c[start] = false;
combination(s, start+1, c,n);
}
void print_combination(char* s, bool* c, int n)
{
for(int i=0; i
if(c[i]==true)
cout<
}
cout<
} |
|
S******1
发帖数: 269 | 31 Basically the same solution with repeatable candidates. Recursion, time
complexity should be O(n!)?
import java.util.*;
public class Solution {
public ArrayList> combinationSum2(int[] num, int
target) {
ArrayList> result= new ArrayList
Integer>> ();
ArrayList item=new ArrayList ();
Arrays.sort(num);
if(num!=null || num.length>0)
combinations(num, target, result, item, 0);
... 阅读全帖 |
|
a**********0
发帖数: 422 | 32 在我自己写map reduce的时候有时候写combiner 但是很少有机会写partiioner
具体用的顺序如何 map -> combiner -> partioner -> reducer
也就是说 combiner必须在partioner之前呢 |
|
l******9
发帖数: 579 | 33 【 以下文字转载自 Database 讨论区 】
发信人: light009 (light009), 信区: Database
标 题: SQL combine two tables into one table and add a new column
发信站: BBS 未名空间站 (Thu May 8 14:54:50 2014, 美东)
I need to combine two tables into one. Ans also, add a column (assign an int
value) to the new table on SQL. So that the rows from table1 and ones from
table2 are assigned with different values.
Example,
table1
ID1 ID2 ID3 VALUE
table2
ID1 ID2 ID3 VALUE
table3
ID1 ID2 ID3 VALUE
i need to combine ... 阅读全帖 |
|
s**********9
发帖数: 51 | 34 准备从油加热换气加热，（现在的油加热太老，洗澡水只有3分钟是热的），问了几家
contractor，有一家推荐combination的（就是heater和boiler在一起，像国内的热水
器，热水是on-demand), 其他3家推荐separate的，就是heater和boiler分开的。
combination和separate的high efficiency都不能从烟囱vent,要另外从地下室的墙上
打孔vent。combination的产品warranty是12年，separate的一般是6年。
实在是不懂深层次的差别，又想快点做决定才能定炉子和联系gas company.请懂这个的
高手指导一下，在波士顿，装这两种加热器的利弊。非常感谢！ |
|
l****z
发帖数: 29846 | 35 WASHINGTON—Combining aerobic exercise and resistance training lowered blood
-sugar levels in people with Type 2 diabetes, a new study has found.
The same improvement in glycemic levels wasn't seen among patients who
performed aerobic exercise or resistance training alone, according to the
study, which will be published in this week's Journal of the American
Medical Association.
Patients who walked and lifted weights also lost more fat and trimmed their
waistlines more than people who did just on... 阅读全帖 |
|
h****s
发帖数: 16779 | 36 信用报告上是不能combine的。
combine是指在有些信用分数模型里算分数的时候会combine。 不过我认为这些多数是
车贷房贷模型，不是信用卡模型。
所以你什么也不用做，什么也做不了。
[在 qguo (qguo) 的大作中提到：]
：是需要给什么机构打电话吗？
：
：........... |
|
w****r
发帖数: 15252 | 37 To combine gift cards, go here: https://m-secure.target.com/giftcards/sign-
in
1. Create an account with your phone number and make up a pin.
2. Input all your cards separately
3. Go into any of your gift cards and hit the combine button
4. select all cards to combine
5. you will end up with one gift card with all the $ on it
6. Use that barcode when checking out at target.
(thanks vinylmp3s) |
|
s**********9
发帖数: 51 | 38 准备从油加热换气加热，（现在的油加热太老，洗澡水只有3分钟是热的），问了几家
contractor，有一家推荐combination的（就是heater和boiler在一起，像国内的热水
器，热水是on-demand), 其他3家推荐separate的，就是heater和boiler分开的。
combination和separate的high efficiency都不能从烟囱vent,要另外从地下室的墙上
打孔vent。combination的产品warranty是12年，separate的一般是6年。
实在是不懂深层次的差别，又想快点做决定才能定炉子和联系gas company.请懂这个的
高手指导一下，在波士顿，装这两种加热器的利弊。非常感谢！ |
|
w***w
发帖数: 6301 | 39 http://valleyofthesuns.com/2016/05/23/zhou-qi-ridiculous-vertic
Zhou Qi’s Ridiculous Vertical
by Scott Hanna-Riggs 3 hours ago Follow @letnumberstalk
Zhou Qi is physically one of the most interesting prospects in the entire
2016 NBA Draft prospect pool.
He is physically gifted, coming in at over 7′ 1″ without shoes, and has a
7′ 7.75″ wingspan. Those are some of the best measurements in NBA Combine
history, with Rudy Gobert a notable player to beat those measurements,
coming in at 7′ 0.5″ with a... 阅读全帖 |
|
b*****r
发帖数: 321 | 40 Over the last few weeks I’ve noticed a great deal of
correspondence in the ALS groups asking how to combine mpeg
clips.
Generally Camel's mpeg joiner program has been the
recommended utility. For interest here’s a useful link to
both this and many other movie joiner programs: -
" target="_blank" class="a2">http://moviemartfaq.tripod.com/extfaq/joiners.html
It is important to realise that combining mpeg’s can raise
several problems: -
1. The very large / unwieldy combined mpeg file can create
sto |
|
S*****0
发帖数: 15 | 41 Overlapped data need to be combined to one.
For example:
X Y
----------
1 5
2 6
3 6
7 9
8 10
11 12
Should be converted to:
X Y
----------
1 6
7 10
11 12
[1 5],[2 6] and [3 6] should be combined to [1 6].
[7 9] and [8 10] should be combined to [7 10].
Thanks a lot! |
|
|
f******6
发帖数: 143 | 43 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Borders $250 combined card @0.83
单张面值:
$250
可接受价格(必须明码标价！):
0.83+shipping
物品新旧要求:
new
邮寄方式要求:
you choose you pay
买卖双方谁承担邮寄损失(Required if not code only):
default
付款方式说明:
non-cc paypal
其他补充说明:
广告的有效期:
till gone
物品来源(Required for All Cards!):
DP 然后LOCAL店COMBINE
我的联系方式:
站内信
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
yes |
|
f******6
发帖数: 143 | 44 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Borders $250 combined card @0.83
单张面值:
$250
可接受价格(必须明码标价！):
0.83+shipping
物品新旧要求:
new
邮寄方式要求:
you choose you pay
买卖双方谁承担邮寄损失(Required if not code only):
default
付款方式说明:
non-cc paypal
BOA
其他补充说明:
广告的有效期:
till gone
物品来源(Required for All Cards!):
DP 然后LOCAL店COMBINE
我的联系方式:
站内信
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
yes |
|
m**d
发帖数: 170 | 45 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Dell gift card gc 450 @.90
单张面值:
1*$300
6*25
can be combined to one card
可接受价格(必须明码标价！):
.90
also I have one $25 promotion gc. can\'t be combined. sell at $20
物品新旧要求:
new
邮寄方式要求:
code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
boa
其他补充说明:
广告的有效期:
物品来源(Required for All Cards!):
epg
我的联系方式:
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
yes.
state and zip: |
|
d*******h
发帖数: 5065 | 46 我想要的物品:
Combined Dell GC 大于$200 @ 0.924
单张面值:
25刀
可接受的价格(必须明码标价！):
需要combine之后的Dell GC，面值大于$200，不知道怎么并卡的邮件联系我
物品新旧要求:
Dell GC >$200 @ 0.924
邮寄方式要求:
code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
paypal(0.924)量大的话可以masspay，手续费我掏, BOA/Chase/ING/bill pay(0.92)
其他补充说明:
广告的有效期:
长期不限量
物品来源:
EPG，DP
我的联系方式:
站内
二手交易风险自负！请自行验证是否合法和一手卡！: |
|
x*****i
发帖数: 5035 | 47 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
DELL combined $100 @0.92
单张面值:
$100
可接受价格(必须明码标价！):
0.92
物品新旧要求:
new
邮寄方式要求:
YCYP
买卖双方谁承担邮寄损失(Required if not code only):
default
付款方式说明:
BOA(preferred) or non-cc paypal
其他补充说明:
广告的有效期:
till gone
物品来源(Required for All Cards!):
from epg, combined in dell.com
我的联系方式:
mitbbs
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
yes
state and zip: |
|
b*******n
发帖数: 698 | 48 我想卖的物品:
Combined Sears/Kmart/Land's End Gift Card 600 @ 0.89
单张面值:
300 x 2
可接受价格(必须明码标价！):
X0.89
物品新旧要求:
new
邮寄方式要求:
free code/u choose u pay
买卖双方谁承担邮寄损失(Required if not code only):
default
付款方式说明:
boa
其他补充说明:
广告的有效期:
物品来源(Required for All Cards!):
From DP and combined in store with receipts
我的联系方式:
mitbbs PM
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
y
state and zip:
CA, 94xxx |
|
c*******y
发帖数: 1038 | 49 二手交易风险自负！请自行验证是否合法和一手卡！:
Y
我想卖的物品:
Home Depot GC $740
单张面值:
300 1 300
100 1 100
90 1 90
25 10 250
$90 is the combined GC from OO. others are from DP/EPG
可接受价格(必须明码标价！):
x0.89
物品新旧要求:
New
邮寄方式要求:
priority mail $5.
买卖双方谁承担邮寄损失(Required if not code only):
Before Me, after you
付款方式说明:
Paypal or BOA
其他补充说明:
I have been selling GC here for 3 years.
I use brand new bubble mailer.
广告的有效期:
Till gone
物品来源(Required for All Cards!):
GC program, combined at the store.
我的联系方式:
bbsmail
... 阅读全帖 |
|
h***i
发帖数: 427 | 50 二手交易风险自负！请自行验证是否合法和一手卡！:
y
我想卖的物品:
homedepot combined $1500
单张面值:
500+500+300+100+50x2
可接受价格(必须明码标价！):
0.91+shipping.
物品新旧要求:
邮寄方式要求:
ycyp
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
boa
其他补充说明:
广告的有效期:
物品来源(Required for All Cards!):
combined in local store with receipts
我的联系方式:
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
y
state and zip: |
|
