zoj_1243
来源:互联网 发布:metismenu.js 编辑:程序博客网 时间:2024/06/05 06:09
发现写的有点累了,早知道应该先回宿舍洗个澡再写的。。不过现在都木有热水了,继续coding...
/*zoj_1243 字符串处理简单题,木有难度,一步步处理下去就行。。*/#include <iostream>#include <cstdio>#include <string>using namespace std;int main(){ int n,count,i,first; string t,s; count=1; cin>>n; while( n-- ) { cin>>s; cout<<"URL #"<<count<<endl; t=""; i=0; while( s[i]!=':' ) t+=s[i++]; cout<<"Protocol = "<<t<<endl; t=""; i+=3; while( i<s.size() && s[i]!=':' && s[i]!='/' ) t+=s[i++]; cout<<"Host = "<<t<<endl; t=""; if( i==s.size() ) { cout<<"Port = <default>\n"; cout<<"Path = <default>\n"; } else if( s[i]==':' ) { i++; while( i<s.size() && s[i]!='/' ) t+=s[i++]; cout<<"Port = "<<t<<endl; t=""; if( i==s.size() ) cout<<"Path = <default>\n"; else { i++; while( i<s.size() ) t+=s[i++]; cout<<"Path = "<<t<<endl; } } else { cout<<"Port = <default>\n"; i++; while( i<s.size() ) t+=s[i++]; cout<<"Path = "<<t<<endl; } cout<<endl; count++; } return 0;}