安装 Steam
登录
|
语言
繁體中文(繁体中文)
日本語(日语)
한국어(韩语)
ไทย(泰语)
български(保加利亚语)
Čeština(捷克语)
Dansk(丹麦语)
Deutsch(德语)
English(英语)
Español-España(西班牙语 - 西班牙)
Español - Latinoamérica(西班牙语 - 拉丁美洲)
Ελληνικά(希腊语)
Français(法语)
Italiano(意大利语)
Bahasa Indonesia(印度尼西亚语)
Magyar(匈牙利语)
Nederlands(荷兰语)
Norsk(挪威语)
Polski(波兰语)
Português(葡萄牙语 - 葡萄牙)
Português-Brasil(葡萄牙语 - 巴西)
Română(罗马尼亚语)
Русский(俄语)
Suomi(芬兰语)
Svenska(瑞典语)
Türkçe(土耳其语)
Tiếng Việt(越南语)
Українська(乌克兰语)
报告翻译问题
many thanks for the explanations !
The only question remaining for me is related to the checksum and this part works depending on what I want to input th amout of '1' can't always be brought to 32 just with the help of only 3 bits.
How is the sum calculated and which values are attended for it?
Thanking you by advance for your feedback
111 111 111 111 111 11_0 01_1 111 111 111 110 000 110
You change it to, say, 010:
111 111 111 111 111 11_0 10_1 111 111 111 110 000 110
So you should input:
5 infinity symbols, X, =, 3 infinity symbols, X, circle and X in the center.
And the checksum remains the same, because the amount of 1's did not change. It would change for the third class, though - just increase the checksum by 1 for that case).