一切从Trade开始(转)

taobao.trades.sold.get 取得交易列表

  1. 从店铺取得时间

    taobao.shop.get (nick,field)shop.created
  2. 循环读取从开店时间到当前时间的所有交易
    taobao.trades.sold.get(start_created,end_created,field)每次获取时间不能超过三个月,最大分页记录数100条。
  3. 获取单笔交易的详细信息
    taobao.trade.fullinfo.get (tid,field) 可以更新到用户信息表
    1. 只有在交易成功的状态下才能取到交易佣金,其它状态下取到的都是零或空值
    2. 只有单笔订单的情况下Trade数据结构中才包含商品相关的信息
    3. 获取到的Order中的payment字段在单笔子订单时包含物流费用,多笔子订单时不包含物流费用
  4. 通过交易列表取得buyer_nick 别名 构建用户数据库
    SELECT DISTINCT buyer_nick FROM [USER]

数据结构

CREATE TABLE [Trade] (
	[AdjustFee] VARCHAR(50) NULL,
	[AlipayNo] VARCHAR(50) NULL,
	[AvailableConfirmFee] VARCHAR(50) NULL,
	[BuyerAlipayNo] VARCHAR(50) NULL,
	[BuyerEmail] VARCHAR(50) NULL,
	[BuyerFlag] NUMERIC NULL,
	[BuyerMemo] VARCHAR(50) NULL,
	[BuyerMessage] VARCHAR(50) NULL,
	[BuyerNick] VARCHAR(50) NULL,
	[BuyerObtainPointFee] NUMERIC NULL,
	[BuyerRate] BOOLEAN NULL,
	[CodFee] VARCHAR(50) NULL,
	[CodStatus] VARCHAR(50) NULL,
	[CommissionFee] VARCHAR(50) NULL,
	[ConsignTime] VARCHAR(50) NULL,
	[Created] VARCHAR(50) NULL,
	[DiscountFee] VARCHAR(50) NULL,
	[EndTime] VARCHAR(50) NULL,
	[HasPostFee] BOOLEAN NULL,
	[Iid] VARCHAR(50) NULL,
	[InvoiceName] VARCHAR(50) NULL,
	[Is3D] BOOLEAN NULL,
	[Modified] VARCHAR(50) NULL,
	[Num] NUMERIC NULL,
	[NumIid] NUMERIC NULL,
	[PayTime] VARCHAR(50) NULL,
	[Payment] VARCHAR(50) NULL,
	[PicPath] VARCHAR(50) NULL,
	[PointFee] NUMERIC NULL,
	[PostFee] VARCHAR(50) NULL,
	[Price] VARCHAR(50) NULL,
	[Promotion] VARCHAR(50) NULL,
	[RealPointFee] NUMERIC NULL,
	[ReceivedPayment] VARCHAR(50) NULL,
	[ReceiverAddress] VARCHAR(50) NULL,
	[ReceiverCity] VARCHAR(50) NULL,
	[ReceiverDistrict] VARCHAR(50) NULL,
	[ReceiverMobile] VARCHAR(50) NULL,
	[ReceiverName] VARCHAR(50) NULL,
	[ReceiverPhone] VARCHAR(50) NULL,
	[ReceiverState] VARCHAR(50) NULL,
	[ReceiverZip] VARCHAR(50) NULL,
	[SellerAlipayNo] VARCHAR(50) NULL,
	[SellerEmail] VARCHAR(50) NULL,
	[SellerFlag] NUMERIC NULL,
	[SellerMemo] VARCHAR(50) NULL,
	[SellerMobile] VARCHAR(50) NULL,
	[SellerName] VARCHAR(50) NULL,
	[SellerNick] VARCHAR(50) NULL,
	[SellerPhone] VARCHAR(50) NULL,
	[SellerRate] BOOLEAN NULL,
	[ShippingType] VARCHAR(50) NULL,
	[Sid] VARCHAR(50) NULL,
	[Snapshot] VARCHAR(50) NULL,
	[SnapshotUrl] VARCHAR(50) NULL,
	[Status] VARCHAR(50) NULL,
	[Tid] NUMERIC NULL,
	[TimeoutActionTime] VARCHAR(50) NULL,
	[Title] VARCHAR(50) NULL,
	[TotalFee] VARCHAR(50) NULL,
	[TradeMemo] VARCHAR(50) NULL,
	[Type] VARCHAR(50) NULL
)
时间: 2024-10-10 02:41:21

一切从Trade开始(转)的相关文章

FatMouse' Trade hdu1009

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1009 FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66570    Accepted Submission(s): 22635 Problem Description FatMouse prepared M

HDU 1009 FatMouse' Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59851    Accepted Submission(s): 20095 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats gu

【贪心专题】HDU 1009 FatMouse' Trade (贪心选取)

链接:click here~~ 题意:老鼠准备了M磅猫食,准备拿这些猫食跟猫交换自己喜欢的食物.有N个房间,每个房间里面都有食物.你可以得到J[i]单位的食物,但你需要付出F[i]单位的的猫食. 计算M磅猫食可以获得最多食物的重量. [解题思路]贪心算法,求最优解.将J[i]/F[i]的值从大到小排列,每次取最大的,局部最优,达到全局最优,从而获得最大值. 代码: // 贪心策略,优先选择投资最大的房间,每选择一次,交换次数依次减少,最后的次数用于价值最小的 //注意精度转化:1.0*(int

贪心/hdu 1009 FatMouse' Trade

题意 有n种物品,每一种需要不同的消费,现在手里有m块钱,求问最多可以买多少 分析 贪心 把每一种物品的价格算出来,然后sort一下,按照价格从便宜到贵排序,能买多少买多少,买买买! Accepted Code 1 /* 2 PROBLEM:hdu1009 3 AUTHER:Nicole Lam 4 MEMO:贪心 5 */ 6 7 #include<cstdio> 8 #include<algorithm> 9 using namespace std; 10 11 12 stru

HDU FatMouse&#39; Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20968    Accepted Submission(s): 6501 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats gua

杭电 1009 FatMouse&#39; Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 40975    Accepted Submission(s): 13563 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats g

hdu3401 Trade(单调队列优化dp)

Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4734    Accepted Submission(s): 1587 Problem Description Recently, lxhgww is addicted to stock, he finds some regular patterns after a few d

HDOJ 1009. Fat Mouse&#39; Trade 贪心 结构体排序

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56784    Accepted Submission(s): 19009 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats g

HDU1009 FatMouse&#39; Trade

题目大意: 一直老鼠想吃咖啡豆,这些咖啡豆由一只猫来看守,它需要用它有的猫粮来换. 读入两个整数m,n分别代表老鼠有的猫粮的总数,和放着咖啡豆的房间数.接下来n行,每行两个数j[i],f[i],分别代表这个房间中的总的咖啡豆的数量和需要的猫粮数,求出这时老鼠可获得的最大的猫粮数,知道接收到-1,-1结束处理. 解题思路: 典型的贪心问题中的分数背包问题.由于可以取得房间中的咖啡豆的任意部分,所以转化为分数背包为题,求出每个房间的咖啡豆的单价,我是求出了单位重量的猫粮可以换取的咖啡豆,这样我觉得可

杭电oj 1009 FatMouse&#39; Trade

Tips:本题采用贪心算法,类似于背包问题,关键在于读入数据之后,将数据按 J[i]/F[i] 从大到小排列即可. 1 /**本程序主要采用贪心算法思想,类似于背包问题*/ 2 #include<stdio.h> 3 #include<string.h> 4 int main() 5 { 6 int M,N; 7 while(scanf("%d %d",&M,&N)) 8 { 9 if(M == -1 && N == -1) 10