- 博客(4)
- 收藏
- 关注
RSS订阅原创 poj2000,poj2390,poj2509
poj2000 #include<iostream> using namespace std; int main(void) { int n; while(cin>>n&&n!=0) { int num=0; int i,m; for(i=1;;i++) { ...
2018-03-17 16:51:36
194
原创 poj2017、poj2665
poj2017 #include<iostream> using namespace std; int main(void) { int n; while(cin>>n&&n!=-1) { int miles=0; int a[n],b[n]; cin>>a[0]&...
2018-03-09 14:48:53
177
原创 poj1003
HangooverDescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpen...
2018-03-08 21:15:03
292
原创 poj1519
一开始没考虑到大数，wa了，之后改成字符串输入，再一个个转为整型相加#include<iostream> using namespace std; int main(void) { string s; int sum; while(cin>>s&&((int)s[0]-48!=0)) { int m=0; ...
2018-03-08 21:13:02
227
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人