TB上2000多人刀的sony z ultra敢买么？ - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>PDA - 掌中宝

TB上2000多人刀的sony z ultra敢买么？

TB上2000多人刀的sony z ultra敢买么？# PDA - 掌中宝

c*g2013-12-04 08:12

1 楼

你们收到的是60还是120？我买了个HP 35A，没用任何coupon，也没用reward check，
用GC checkout的，不过recycle的是20个ink，不是toner，他们系统应该分不出ink和
toner的。
看来得打电话问候他们了。

t*a2013-12-04 08:12

2 楼

I have a graph matching problem that I want to solve. This problem involves
a weighted undirected graph and is very similar to the maximum weighted
graph matching problem http://jorisvr.nl/maximummatching.html
With respect to a weighted graph, a maximum weight matching is a matching
for which the sum of the weights of the matched edges is as large as
possible. I can find some software for solving this problem.
However, my problem is a little bit different from the standard one in that
I wish the number of selected edges in the matching is smaller than or equal
to some predetermined constant K. I want to know how to solve this problem
or if there is any approximate solution to this problem.

s*o2013-12-04 08:12

3 楼

如题
列了一堆型号:
XL39h C6833 Xperia Z Ultra l39h

d*o2013-12-04 08:12

4 楼

同收到60
同recycle的是ink
同认为他们系统应该分不出ink和toner

【在 c********g 的大作中提到】

: 你们收到的是60还是120？我买了个HP 35A，没用任何coupon，也没用reward check，
: 用GC checkout的，不过recycle的是20个ink，不是toner，他们系统应该分不出ink和
: toner的。
: 看来得打电话问候他们了。

f*e2013-12-04 08:12

5 楼

try greedy，pick the edges with the largest weights.
A little DP seems work as well.

involves
that
equal
problem

【在 t****a 的大作中提到】

: I have a graph matching problem that I want to solve. This problem involves
: a weighted undirected graph and is very similar to the maximum weighted
: graph matching problem http://jorisvr.nl/maximummatching.html
: With respect to a weighted graph, a maximum weight matching is a matching
: for which the sum of the weights of the matched edges is as large as
: possible. I can find some software for solving this problem.
: However, my problem is a little bit different from the standard one in that
: I wish the number of selected edges in the matching is smaller than or equal
: to some predetermined constant K. I want to know how to solve this problem
: or if there is any approximate solution to this problem.

c*y2013-12-04 08:12

6 楼

也许专门有个promotion bar code for toner？

【在 d*******o 的大作中提到】

: 同收到60
: 同recycle的是ink
: 同认为他们系统应该分不出ink和toner

f*e2013-12-04 08:12

7 楼

不是NP的问题应该有polynomial的最优解。

【在 f*****e 的大作中提到】

: try greedy，pick the edges with the largest weights.
: A little DP seems work as well.
:
: involves
: that
: equal
: problem

b*e2013-12-04 08:12

8 楼

recycle的是ink没问题,他们系统分不出ink和toner.
俺的悲剧是买的是ink,不是toner.这个他们能分别.NND,当时没仔细看小字.

【在 c********g 的大作中提到】

r*c2013-12-04 08:12

9 楼

they cannot tell toner or ink
call them, you will get the other 60 back.
i did it last week.

c*g2013-12-04 08:12

10 楼

FW ppl said so too.

【在 r**c 的大作中提到】

: they cannot tell toner or ink
: call them, you will get the other 60 back.
: i did it last week.

m*o2013-12-04 08:12

11 楼

成功了？
再发个60的reward？
email还是寄过来啊？

【在 r**c 的大作中提到】

: they cannot tell toner or ink
: call them, you will get the other 60 back.
: i did it last week.

b*p2013-12-04 08:12

12 楼

HP 35A costs $68.

c*g2013-12-04 08:12

13 楼

一月份的staples toner/ink：
顶一下，不用打电话，直接online chat就行了。
过几天邮寄来$60，不是email。已经收到一个了。
EPG staples GC $25变$50，现在又变回去了，本来就是天上掉的馅饼，没吃着也没啥
可惜的。

【在 c********g 的大作中提到】