acm problem 763和465 http://acm.uva.es/p/v4/465.html http://acm.uva.es/p/v7/763.html 我把论坛上搜索到的test file都测试了,都是对的,但是死活就是WA 有没有AC的高手指教一下!谢谢了~~~
by flyintwink - C/C++ - 2006-05-09 10:30:32 阅读(769) 回复(1)
Pirates of the burning Sea Video Games Pirates of the burning Sea isn't the World of Warcraft killer some have said it is, but it is by far the most pleasant online distraction from WoW to come along in a while. WoW has too much of a head start, what with about 10 million players after more than three years of availability. Would-be usurpers have come and, mostly, gone. But potbs could...
[CODE]
#include
一个下午终于把前天acm没有做出来的提搞定拉. 大家看看有没有更优的解拉.. 题意:基本就是求缺少的铁路数. There are n cities in A country. The country has already built part of a railway. The both sides of the railway are connecting different cities, and a two-way street. Some cities may not connect (Together means with direct access or indirectly up). In order to cause the transportation to be unimpede...
acm大赛的题目,没有Python语言的编译器,所以在这里写个看看。已经通过了题目要求的实例。 把浮点数转换成了字符串,处理,然后转换成整数,处理,在转会字符串处理,哈哈,有意思。 from string import * """ s = '95.123' length = len(s) - find(s,'.') - 1 point = length * 12 -1 s = replace(s,'.','') integ = pow(int(s),12) integ = str(integ) f = integ[:point] + '.' + integ[point:] print f """ def acm_1001(): ...