HDU 4018 Parsing URL

/*水题模拟*/

Problem : 4018 ( Parsing URL )     Judge Status : Accepted
RunId : 7622177    Language : C++    Author : CherryChou
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta

#include<functional>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<list>
#include<set>
#include<map>

using namespace std;


char s[5000];

char tt[5000];


int main()
{
    int T,i;
    int cnt=1;
    bool flag;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",&s);
        flag=false;
        int len=strlen(s);
        int t=0;
        for(i=2;i<len;i++){
          if(flag==false&&s[i-2]==':'&&s[i-1]=='/'&&s[i]=='/'){
            flag=true;
            continue;
          }
          if(flag&&(s[i]=='/'||s[i]==':')) break;
          if(flag)  tt[t++]=s[i];
        }   
        tt[t]='\0';
        printf("Case #%d: %s\n",cnt++,tt);     
    }  
    return 0;
}