- 博客(11)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 POJ-1318（list.sort()输出不为字典序，map才是按字典序排列）
#include#include#include#includeusing namespace std;list outputList;void ergodic(string prefix, string str){ if(str==""){ //cout<<prefix<<endl; outputList.push_back(prefix); }else{ for
2015-07-26 00:58:13
1044
原创 POJ-1250
#include#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int bedNum; string customer; while(cin>>bedNum,bedNum){ int departCustomer=0; list mList; cin>>cust
2015-07-25 17:30:14
656
原创 POJ-1248
#include#include#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int target; string letters; int v,w,x,y,z; while(cin>>target>>letters,target){ char *cp= new
2015-07-25 16:26:15
614
原创 POJ-1247
#include#includeusing namespace std;/** * return: * -1:can not find; * positive:find the first position; */int findPosition(vector v,int size, int requestHalfSum){ int sum=0; for(int i=
2015-07-19 18:43:58
659
原创 POJ-1247
#includeusing namespace std;bool isOod(int num){ if(num%2==0){ return false; }else{ return true; }}int calCycleLength(int n){ int len=0; if(n==1){ return 1; }else{ if(isOod(n)){
2015-07-19 16:48:52
622
原创 POJ-1118（超时，但未找到原因）
#include#include#includeusing namespace std;//y=kx+ztypedef struct{ double k; double z; int count;}Skzc;int main(int argc, char *argv[]){ //(x,y) multimap place; vector kzcVector; map
2015-07-13 01:16:13
1126
原创 POJ-1046
#include#include#includeusing namespace std;typedef struct coordinate{ int x; int y; int z;}SCoordinate;typedef struct input{ SCoordinate cTarget; SCoordinate cInput;}SInput;int main(i
2015-07-12 00:36:48
1081
原创 POJ-1007
#include#include#includeusing namespace std;int inversionCompute(string str){ int inversionSum=0; char *cp=(char*)str.data(); for(int i=0;i<str.length()-1;i++){ for(int j=i;j<str.length()-1;
2015-07-11 11:48:16
911
原创 POJ-1004
#includeusing namespace std;int main(int argc, char *argv[]){ double sum=0; float monthConsume; for(int i=0;i<12;i++){ cin>>monthConsume; sum+=monthConsume; } cout<<"$"<<sum/12<<endl;
2015-07-11 09:59:41
616
原创 POJ-1005
#include#include//#includeusing namespace std;#define PI 3.1415926/*return: years*/int recursionFunc(float rCurrent, float xYMin){ float r; if(rCurrent==0){ r=sqrt(100.0/PI); }else{
2015-07-11 00:52:13
864
原创 POJ-1003
#includeusing namespace std;int recursionFunc(int cardNum, float len){ if(1.0/(cardNum+1)>=len){ return cardNum; }else{ return recursionFunc(cardNum+1, len-(1.0/(cardNum+1))); }}int main(
2015-07-10 23:03:12
750
tpipv6.h（头文件）
2013-01-09
Putty资源合集
2012-11-30
windows界面下的网络编程
2011-12-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人