runxinzhi.com
首页
百度搜索
Python3 在sublime text 的 console输出中文
通过PackageControl安装PackageResourceViewer.
通过PackageResourceViewer打开python/Python.sublime-build
添加下面一行
"env": { "PYTHONIOENCODING": "utf8" },
参考文档
https://forum.sublimetext.com/t/windows-st3-python-3-unicode-output/15261
https://github.com/SublimeTextIssues/Core/issues/1031
相关阅读:
POJ 1269 Intersecting Lines(判断两条线段关系)
POJ 3304 Segments(判断直线和线段相交)
poj 1383 Labyrinth【迷宫bfs+树的直径】
poj 2631 Roads in the North【树的直径裸题】
poj 1985 Cow Marathon【树的直径裸题】
hdoj 1596 find the safest road【最短路变形,求最大安全系数】
hdoj 1260 Tickets【dp】
poj 1564 Sum It Up【dfs+去重】
2014 牡丹江现场赛 i题 (zoj 3827 Information Entropy)
hdoj 2473 Junk-Mail Filter【并查集节点的删除】
原文地址:https://www.cnblogs.com/laomanong/p/5515638.html
最新文章
线程同步
线程互斥,mutex
2019 年百度之星·程序设计大赛
Codeforces Round #581 (Div. 2) C. Anna, Svyatoslav and Maps (Floyd 算法,最短路)
D2. Kirk and a Binary String (hard version) D1 Kirk and a Binary String (easy version) Codeforces Round #581 (Div. 2) (实现,构造)
Codeforces Round #581 (Div. 2) B. Mislove Has Lost an Array (贪心)
Codeforces Round #581 (Div. 2)A BowWow and the Timetable (思维)
Glass Carving CodeForces
Kay and Snowflake CodeForces
HCW 19 Team Round (ICPC format) B. Beggin' For A Node(树的重心,交互题)
热门文章
Balancing Act POJ
2019 年百度之星·程序设计大赛
Cyclic Nacklace(KMP求循环节)
POJ 1039 Pipe(直线相交)
极角排序
POJ 1696 Space Ant(极角排序)
POJ 1410 Intersection(判断线段交 点在多边形内)
POJ 1066 Treasure Hunt(转化线段相交)
Pick-up sticks(线段相交判断)
POJ 1556 The Doors(点到线段的距离+最短路)
Copyright © 2020-2023
润新知