《挑战程序设计竞赛1》题解合集
英文题面的题解
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef local_debug
freopen("words.in", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
《挑战程序设计竞赛1》
2.1 poj 1979 Red and Black
挑战程序设计竞赛 2.1章习题 AOJ 0118 Property Distribution dfs bfs
挑战程序设计竞赛 2.1章习题 POJ 3009 Curling 2.0
挑战程序设计竞赛 2.1章习题 Aizu - 0558 Cheese BFS
2.1 Meteor Shower
挑战程序设计竞赛 2.1章习题 AOJ 0121 Seven Puzzle bfs
挑战程序设计竞赛 2.1章习题 poj 2718 Smallest Difference dfs
挑战程序设计竞赛 2.1章习题 POJ 3187 Backward Digit Sums dfs
挑战程序设计竞赛 2.1章习题 poj 3050 Hopscotch dfs
挑战程序设计竞赛 2.1章习题 Aizu - 0525 Osenbei BFS
挑战程序设计竞赛 2.1章习题 POJ 2386 Lake Counting
挑战程序设计竞赛 2.2章习题 poj 2376 Cleaning Shifts
挑战程序设计竞赛 2.2 poj 1328 Radarinstallation
挑战程序设计竞赛 2.2章习题 poj 3190 Stall Reservations(贪心+优先队列)
挑战程序设计竞赛 2.2 poj 2393 Yogurt factory
挑战程序设计竞赛 2.2章习题 poj 1017 Packets 贪心模拟
挑战程序设计竞赛 2.2章习题 POJ - 3617 Best Cow Line 贪心
挑战程序设计竞赛 2.2章习题 poj 1862 Stripies 贪心
挑战程序设计竞赛 2.2章习题 poj 3262 Protecting the Flowers 比率贪心
挑战程序设计竞赛 2.2 poj 3040 Allowance 贪心
挑战程序设计竞赛 2.3章习题 poj 3176 Cow Bowling dp
挑战程序设计竞赛 2.3章习题 poj 2229 Sumsets dp
挑战程序设计竞赛 2.3章习题 poj 3046 Ant Counting
挑战程序设计竞赛 2.6章习题 poj 3421 X-factor Chains
挑战程序设计竞赛 2.6章习题 UVA - 10006 Carmichael Numbers
挑战程序设计竞赛 2.6章习题 POJ 1930 Dead Fraction
题单目录
第2章 初出茅庐——初级篇
2.1 最基础的“穷竭搜索” 深度优先搜索: 1 POJ-1979 Red and Black 26040 Japan 2004 Domestic 2 Aizu-0118 Property Distribution 5447 3rd PC Koshien, Final 3 Aizu-0033 Ball 6871 2nd PC Koshien, Preliminary Round 4 POJ-3009 Curling 2.0 10966 Japan 2006 Domestic 广度优先搜索: 1 Aizu-0558 Cheese 4600 10th Japanese Olympiad in Informatics, Preliminary Round 2 POJ-3669 Meteor Shower 6398 USACO 2008 February Silver 3 Aizu-0121 Seven Puzzle 3015 3rd PC Koshien, Final 穷竭搜索: 1 POJ-2718 Smallest Difference 4666 Rocky Mountain 2005 2 POJ-3187 Backward Digit Sums 5656 USACO 2006 February Gold & Silver 3 POJ-3050 Hopscotch 4468 USACO 2005 November Bronze 4 Aizu-0525 Osenbei 2594
2.2 一直往前!贪心法 区间法: 1 POJ-2376 Cleaning Shifts 9485 USACO 2004 December Silver 2 POJ-1328 Radar Installation 24737 Beijing 2002 3 POJ-3190 Stall Reservations 5990 USACO 2006 February Silver 其他: 1 POJ-2393 Yogurt factory 8325 USACO 2005 March Gold 2 POJ-1017 Packets 19509 Central Europe 1996 3 POJ-3040 Allowance 3641 USACO 2005 October Silver 4 POJ-1862 Stripies 9545 Northeastern Europe 2001, Northern Subregion 5 POJ-3262 Protecting the Flowers 5998 USACO 2007 January Silver
2.3 记录结果再利用的“动态规划” 基础的动态规划算法: 1 POJ-3176 Cow Bowling 14872 USACO 2005 December Bronze 2 POJ-2229 Sumsets 8998 USACO 2005 January Silver 3 POJ-2385 Apple Catching 7317 USACO 2004 November 4 POJ-3616 Milking Time 8766 USACO 2007 November Silver 5 POJ-3280 Cheapest Palindrome 6649 USACO 2007 Open Gold 优化递推关系式: 1 POJ-1742 Coins 10415 LouTiancheng@POJ 2 POJ-3046 Ant Counting 2806 USACO 2005 November Silver 3 POJ-3181 Dollar Dayz 3778 USACO 2006 January Silver 需要稍加思考的题目: 1 POJ-1065 Wooden Sticks 10161 Taejon 2001 2 POJ-1631 Bridging signals 7056 Northwestern Europe 2003 3 POJ-3666 Making the Grade 5072 USACO 2008 February Gold 4 POJ-2392 Space Elevator 5594 USACO 2005 March Gold 5 POJ-2184 Cow Exhibition 5312 USACO 2003 Fall
2.4 加工并存储数据的数据结构 优先队列: 1 POJ-3614 Sunscreen 4790 USACO 2007 November Gold 2 POJ-2010 Moo University - Financial Aid 3034 USACO 2004 March Green 并查集: 1 POJ-2236 Wireless Network 16792 POJ Monthly,HQM 2 POJ-1703 Find them, Catch them 13408 POJ Monthly--2004.07.18 3 Aizu-2170 Marked Ancestor 2368 ACM-ICPC Japan Alumni Group Summer Camp 2009 Day 3
2.5 它们其实都是“图” 最短路: 1 Aizu-0189 Convenient Location 2960 6th PC Koshien, Final 2 POJ-2139 Six Degrees of Cowvin Bacon 4237 USACO 2003 March Orange 3 POJ-3259 Wormholes 19392 USACO 2006 December Gold 4 POJ-3268 Silver Cow Party 14942 USACO 2007 February Silver 5 Aizu-2249 Road Construction 2142 ACM-ICPC Japan Alumni Group Practice Contest for Asia Regionals 2010 6 Aizu-2200 Mr. Rito Post Office 1304 ACM-ICPC Japan Alumni Group Practice Contest for Japan Domestic 2010
最小生成树: 1 POJ-1258 Agri-Net 24220 USACO 102 2 POJ-2377 Bad Cowtractors 6155 USACO 2004 December Silver 3 Aizu-2224 Save your cats 1876 ACM-ICPC Japan Alumni Group Summer Camp 2010 Day 4 4 POJ-2395 Out of Hay 6534 USACO 2005 March Silver
2.6 数学问题的解题窍门 辗转相除法: 1 Aizu-0005 GCD and LCM 12050 1st PC Koshien, Final 2 POJ-2429 GCD & LCM Inverse 1866 POJ Achilles 3 POJ-1930 Dead Fraction 1713 Waterloo local 2003.09.27
素数: 1 Aizu-0009 Prime Number 10762 1st PC Koshien, Final 2 POJ-3126 Prime Path 19590 Northwestern Europe 2006 3 POJ-3421 X-factor Chains 2796 POJ Monthly--2007.10.06, ailyanlu@zsu 4 POJ-3292 Semi-prime H-numbers 4497 Waterloo Local Contest, 2006.9.30
快速幂运算: 1 POJ-3641 Pseudoprime numbers 5600 Waterloo Local Contest, 2007.9.23 2 POJ-1995 Raising Modulo Numbers 11748 CTU Open 1999
第3章 出类拔萃——中级篇 3.1 不光是查找值!“二分搜索” 最大化最小值: 1 POJ-3258 River Hopscotch 9559 USACO 2006 December Silver 2 POJ-3273 Monthly Expense 11971 USACO 2007 March Silver 3 POJ-3104 Drying 6884 Northeastern Europe 2005, Northern Subregion 4 POJ-3045 Cow Acrobats 3241 USACO 2005 November Silver
最大化平均值: 1 POJ-2976 Dropping tests 6673 Stanford Local 2005 2 POJ-3111 K Best 2733 Northeastern Europe 2005, Northern Subregion
查找第k大的值: 1 POJ-2010 Moo University - Financial Aid 3034 USACO 2004 March Green 2 POJ-3662 Telephone Lines 3364 USACO 2008 January Silver
其他: 1 POJ-1759 Garland 1462 Northeastern Europe 2000 2 POJ-3484 Showstopper 801 Southeastern Europe 2007
3.2 常用技巧精选(一) 尺取法: 1 POJ-2566 Bound Found 2911 Ulm Local 2001 2 POJ-2739 Sum of Consecutive Prime Numbers 15336 Japan 2005 3 POJ-2100 Graveyard Design 2778 Northeastern Europe 2004, Northern Subregion
反转: 1 POJ-3185 The Water Bowls 2683 USACO 2006 January Bronze 2 POJ-1222 EXTENDED LIGHTS OUT 7757 Greater New York 2002
弹性碰撞: 1 POJ-2674 Linear world 929 Southeastern Europe 2005
折半枚举: 1 POJ-3977 Subset 1311 Seventh ACM Egyptian National Programming Contest 2 POJ-2549 Sumsets 2645 Waterloo local 2001.06.02
坐标离散化: 1 Aizu-0531 Paint Color 1455 7th Japanese Olympiad in Informatics
3.3 活用各种数据结构 Binary Indexed Tree: 1 POJ-1990 MooFest 4244 USACO 2004 U S Open 2 POJ-3109 Inner Vertices 670 Northeastern Europe 2005, Northern Subregion 3 POJ-2155 Matrix 8931 POJ Monthly,Lou Tiancheng 4 POJ-2886 Who Gets the Most Candies? 3443 POJ Monthly--2006.07.30, Sempr
线段树和平方分割: 1 POJ-3264 Balanced Lineup 23707 USACO 2007 January Silver 2 POJ-3368 Frequent values 6807 Ulm Local 2007 3 POJ-3470 Walls 283 POJ Monthly--2007.11.25, Zhou Dong 4 POJ-1201 Intervals 8922 Southwestern Europe 2002 5 UVA-11990 ``Dynamic'' Inversion
3.4 熟练掌握动态规划 状态压缩DP: 1 POJ-2441 Arrange the Bulls 1697 POJ Monthly,TN 2 POJ-3254 Corn Fields 9804 USACO 2006 November Gold 3 POJ-2836 Rectangular Covering 790 PKU Local 2006, kicc 4 POJ-1795 DNA Laboratory 495 TUD Programming Contest 2004, Darmstadt, Germany 5 POJ-3411 Paid Roads 2423 Northeastern Europe 2002, Western Subregion
矩阵的幂: 1 POJ-3420 Quad Tiling 1938 POJ Monthly--2007.10.06, Dagger 2 POJ-3735 Training little cats 2542 PKU Campus 2009 (POJ Monthly Contest – 2009.05.17), Facer
利用数据结构高效求解: 1 POJ-3171 Cleaning Shifts 1402 USACO 2005 December Silver
3.5 借助水流解决问题的网络流 最大流与最小割: 1 POJ-3713 Transferring Sylla 598 POJ Founder Monthly Contest – 2008.12.28, Dagger 2 POJ-2987 Firing 2189 POJ Monthly--2006.08.27, frkstyc 3 POJ-2914 Minimum Cut 2734 Baidu Star 2006 Semifinal Wang, Ying (Originator) Chen, Shixi (Test cases) 4 POJ-3155 Hard Life 1518 Northeastern Europe 2006
二分图匹配: 1 POJ-1274 The Perfect Stall 9936 USACO 40 2 POJ-2112 Optimal Milking 4533 USACO 2003 U S Open 3 POJ-1486 Sorting Slides 1769 Southwestern European Regional Contest 1998 4 POJ-1466 Girls and Boys 4500 Southeastern Europe 2000 5 POJ-3692 Kindergarten 3418 2008 Asia Hefei Regional Contest Online by USTC 6 POJ-2724 Purifying Machine 1353 Beijing 2005 7 POJ-2226 Muddy Fields 4093 USACO 2005 January Gold 8 Aizu-2251 Merry Christmas 575 ACM-ICPC Japan Alumni Group Practice Contest for Asia Regionals 2010
最小费用流: 1 POJ-3068 "Shortest" pair of paths 880 Southeastern Europe 2006 2 POJ-2195 Going Home 8704 Pacific Northwest 2004 3 POJ-3422 Kaka's Matrix Travels 2811 POJ Monthly--2007.10.06, Huang, Jinsong 4 Aizu-2266 Cache Strategy 156 University of Tokyo Programming Contest 2011 5 Aizu-2230 How to Create a Good Game 259 ACM-ICPC Japan Alumni Group Summer Camp 2010 Day 4
3.6 与平面和空间打交道的计算几何 极限情况: 1 POJ-1981 Circle and Points 1753 Japan 2004 Domestic 2 POJ-1418 Viva Confetti 356 Japan 2002 Kanazawa 3 Aizu-2201 Immortal Jewels 377 ACM-ICPC Japan Alumni Group Practice Contest for Japan Domestic 2010
平面扫描: 1 POJ-3168 Barn Expansion 573 USACO 2005 December Gold 2 POJ-3293 Rectilinear polygon 236 Waterloo Local Contest, 2006.9.30 3 POJ-2482 Stars in Your Window 2527 POJ Contest,Author:kinfkong@ZSU
凸包: 1 POJ-1113 Wall 9243 Northeastern Europe 2001 2 POJ-1912 A highway and the seven dwarfs 428 CEOI 2002 3 POJ-3608 Bridge Across Islands 1549 POJ Founder Monthly Contest – 2008.06.29, Lei Tao 4 POJ-2079 Triangle 1917 Shanghai 2004 Preliminary 5 POJ-3246 Game 321 POJ Monthly--2007.07.08, Wang, Dong 6 POJ-3689 Equations 78 POJ Founder Monthly Contest – 2008.08.31, Lei, Tao
数值积分: 1 Aizu-2256 Divide the Cake 141 ACM-ICPC Japan Alumni Group Practice Contest for Japan Domestic 2011 2 Aizu-2215 Three Silhouettes 4 University of Tokyo Programming Contest 2010
第4章 登峰造极——高级篇 4.1 更加复杂的数学问题 模运算的世界: 1 POJ-1150 The Last Non-zero Digit 1460 uva 10212 2 POJ-1284 Primitive Roots 3138 贾怡@pku 3 POJ-2115 C Looooops 8035 CTU Open 2004 4 POJ-3708 Recurrent Function 255 POJ Founder Monthly Contest – 2008.12.28, Yaojinyu 5 POJ-2720 Last Digits 317 Rocky Mountain 2005
矩阵: 1 POJ-2345 Central heating 374 Ural State University Internal Contest October'2000 Students Session 2 POJ-3532 Resistance 291 POJ Founder Monthly Contest – 2008.03.16, g201513 3 POJ-3526 The Teacher’s Side of Math 163 Japan 2007
计数: 1 POJ-2407 Relatives 8035 Waterloo local 2002.07.01 2 POJ-1286 Necklace of Beads 3825 Xi'an 2002 3 POJ-2409 Let it Bead 4146 Ulm Local 2000 4 Aizu-2164 Revenge of the Round Table 66 ACM-ICPC Japan Alumni Group Summer Camp 2009 Day 2 5 Aizu-2214 Warp Hall 34 University of Tokyo Programming Contest 2010
4.2 找出游戏的必胜策略 推理与动态规划算法: 1 POJ-1082 Calendar Game 2908 Taejon 2001 2 POJ-2068 Nim 1238 Japan 2001 3 POJ-3688 Cheat in the Game 407 POJ Founder Monthly Contest – 2008.08.31, facer 4 POJ-1740 A New Stone Game 3535 LouTiancheng@POJ
Nim与Grundy数: 1 POJ-2975 Nim 3340 Stanford Local 2005 2 POJ-3537 Crosses and Crosses 1536 Northeastern Europe 2007, Northern Subregion 3 CodeForces-138D World of Darkraft 564 Codeforces Beta Round 99 (Div. 1) 4 POJ-2315 Football Game 260 POJ Monthly,uni
4.3 成为图论大师之路 强连通分量分解: 1 POJ-3180 The Cow Prom 1759 USACO 2006 January Silver 2 POJ-1236 Network of Schools 8470 IOI 1996
2-SAT: 1 POJ-3678 Katu Puzzle 3413 POJ Founder Monthly Contest – 2008.07.27, Dagger 2 POJ-2723 Get Luffy Out 2384 Beijing 2005 3 POJ-2749 Building roads 1677 POJ Monthly--2006.01.22,zhucheng
LCA: 1 POJ-1986 Distance Queries 4401 USACO 2004 February 2 POJ-3728 The merchant 1558 POJ Monthly Contest – 2009.04.05, GaoYihan 4.4 常用技巧精选(二) 栈: 1 POJ-3250 Bad Hair Day 8748 USACO 2006 November Silver 2 POJ-2082 Terrible Sets 2361 Shanghai 2004 Preliminary 3 POJ-3494 Largest Submatrix of All 1’s 2742 POJ Founder Monthly Contest – 2008.01.31, xfxyjwf
双端队列: 1 POJ-2823 Sliding Window 15432 POJ Monthly--2006.04.28, Ikki 2 POJ-3260 The Fewest Coins 2003 USACO 2006 December Gold 3 POJ-1180 Batch Scheduling 1817 IOI 2002 4 Aizu-1070 FIMO sequence 41 University of Aizu Programming Contest 2011 1
4.5 开动脑筋智慧搜索 剪枝: 1 POJ-1011 Sticks 22393 Central Europe 1995 2 POJ-2046 Gap 520 Japan 2003,Aizu 3 POJ-3134 Power Calculus 1507 Japan 2006 A*与IDA*: 1 POJ-3523 The Morning after Halloween 450 Japan 2007 2 POJ-2032 Square Carpets 214 Japan 2003 Domestic 3 UVA-10181 15-Puzzle Problem 2098
4.6 划分、解决、合并:分治法 数列上的分治法: 1 POJ-1854 Evil Straw Warts Live 709 Waterloo local 2004.09.19
平面上的分治法: 1 Gym-100240K Min Perimeter 60 2013-2014 CT S01E05: 2007 Nordic Collegiate Programming Contest (NCPC 2007) + Selected Problems from 2009 Google Code Jam World Finals (GCJ WF 2009) 2 CodeForces-97B Superset 1036 Yandex.Algorithm 2011: Finals
树上的分治法: 1 POJ-2114 Boatherds 925 CTU Open 2004 2 UVA-12161 Ironman Race in Treeland 187 3 SPOJ-QTREE5 Query on a tree V 2170 XunYunbo, modified from ZJOI07
4.7 华丽地处理字符串 动态规划算法: 1 Aizu-2212 Stolen Jewel 194 University of Tokyo Programming Contest 2010 2 CodeForces-86C Genetic engineering 821 Yandex.Algorithm 2011: Round 2
字符串匹配: 1 CodeForces-25E Test 2683 Codeforces Beta Round 25 (Div. 2 Only) 2 Aizu-1312 Where's Wally 287 ACM International Collegiate Programming Contest, Asia Regional 2010, Japan
后缀数组: 1 POJ-1509 Glass Beads 2541 Central Europe 1998 2 POJ-3415 Common Substrings 3051 POJ Monthly--2007.10.06, wintokk 3 POJ-3729 Facer’s string 409 POJ Monthly Contest – 2009.04.05, Facer 4 Aizu-2292 Common Palindromes 237 ACM-ICPC Japan Alumni Group Summer Camp 2011 Day 2 5 CodeForces-123D String 1339 Codeforces Beta Round 92 (Div. 1 Only)
--------------------------------------------------------------------------------------------------------------------------------------------------------
《挑战程序设计竞赛1》 v2 (papamelon 中文题面)
由于网站关闭 不再提供中文部分题解
第 1 章:蓄势待发——准备篇
papamelon 194. 抽签 dfs(挑战程序设计竞赛)
papamelon 200. 抽签 II(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 2.1 穷竭搜索
papamelon 201. 部分和问题(挑战程序设计竞赛)
papamelon 202. 水洼计数 Lake Counting(挑战程序设计竞赛)
papamelon 203. 迷宫的最短路径(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 2.2 贪心算法
papamelon 206. 硬币问题 II(挑战程序设计竞赛)
papamelon 212. 区间调度问题(挑战程序设计竞赛)
papamelon 213. 字典序最小问题 Best Cow Line(挑战程序设计竞赛)
papmelon 214. 萨鲁曼的军队 Saruman's Army(挑战程序设计竞赛)
papamelon 217. 栅栏修理 Fence Repair(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 2.3 动态规划
papamelon 218. 01背包问题(挑战程序设计竞赛)
papamelon 220. 最长公共子序列问题(挑战程序设计竞赛)
papamelon 219. 完全背包问题(挑战程序设计竞赛)
papamelon 222. 多重部分和问题(挑战程序设计竞赛)
papamelon 223. 最长上升子序列问题(挑战程序设计竞赛)
papamelon 224. 划分数(挑战程序设计竞赛)
papamelon 225. 多重集组合数(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 2.4 数据结构
papamelon 226. 远征 Expedition(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 2.5 图论
papamelon 242. 二分图判定(挑战程序设计竞赛)
papamelon 245. 征募 Conscription(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 2.6 数学与数论
第 2 章:初出茅庐——初级篇 - 2.7 挑战 GCJ 的题目
papamelon 255. 贿赂囚犯 Bribe the Prisoners
第 2 章:初出茅庐——初级篇 - 课后习题 - 深度优先搜索
第 2 章:初出茅庐——初级篇 - 课后习题 - 广度优先搜索
第 2 章:初出茅庐——初级篇 - 课后习题 - 穷竭搜索
第 2 章:初出茅庐——初级篇 - 课后习题 - 贪心(区间)
papamelon 302. 碰撞游戏 Stripies(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 课后习题 - 贪心(其他)
第 2 章:初出茅庐——初级篇 - 课后习题 - 动态规划(基础)
papamelon 305. 求和方案 Sumsetspapamelon 306. 捡苹果 Apple Catching(挑战程序设计竞赛)
papamelon 307. 挤奶时间 Milking Time(挑战程序设计竞赛)
papamelon 308. 最廉价的回文串 Cheapest Palindrome(挑战程序设计竞赛)
第 2 章:初出茅庐——初级篇 - 课后习题 - 动态规划(优化递推关系式)
第 2 章:初出茅庐——初级篇 - 课后习题 - 动态规划(更困难的)
papamelon 327. 木棒 Wooden Sticks(挑战程序设计竞赛)
papamelon 328. 电路板 Bridging signals(挑战程序设计竞赛)
papamelon 344. 奶牛展览 Cow Exhibition(挑战程序设计竞赛) dp
第 2 章:初出茅庐——初级篇 - 课后习题 - 优先队列
第 2 章:初出茅庐——初级篇 - 课后习题 - 并查集
papamelon 348. 修复网络 Wireless Network(挑战程序设计竞赛)
papamelon 349. 城市帮派 Find them, Catch them(挑战程序设计竞赛)
第 3 章:出类拔萃——中级篇 - 3.1 二分搜索
papamelon 257. 下界 lower_bound(挑战程序设计竞赛)
papamelon 260. 最大化平均值(挑战程序设计竞赛)
第 3 章:出类拔萃——中级篇 - 3.2 常用技巧精选(一)
第 3 章:出类拔萃——中级篇 - 3.3 数据结构
第 3 章:出类拔萃——中级篇 - 3.4 动态规划
papamelon 318. 斐波那契数列(挑战程序设计竞赛)
第 3 章:出类拔萃——中级篇 - 3.6 平面空间的计算几何
第 3 章: 3.1 课后习题
已经关闭的oj 记录一下
欢迎转帖 请保持文本完整并注明出处
技术博客 http://www.cnblogs.com/itdef/
B站算法视频题解
https://space.bilibili.com/18508846
qq 151435887
gitee https://gitee.com/def/
欢迎c c++ 算法爱好者 windows驱动爱好者 服务器程序员沟通交流
如果觉得不错,欢迎点赞,你的鼓励就是我的动力
![阿里打赏](https://files.cnblogs.com/files/itdef/ali2.bmp)
![微信打赏](https://files.cnblogs.com/files/itdef/weixin2.bmp)