HDU4018 Parsing URL【水题】

Parsing URL

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 1837    Accepted Submission(s): 920

Problem Description

In computing, a Uniform Resource Locator or Universal Resource Locator (URL) is a character string that specifies where a known resource is available on the Internet and the mechanism for retrieving it.
The syntax of a typical URL is:
scheme://domain:port/path?query_string#fragment_id
In this problem, the scheme, domain is required by all URL and other components are optional. That is, for example, the following are all correct urls:
http://dict.bing.com.cn/#%E5%B0%8F%E6%95%B0%E7%82%B9
http://www.mariowiki.com/Mushroom
https://mail.google.com/mail/?shva=1#inbox
http://en.wikipedia.org/wiki/Bowser_(character)
ftp://fs.fudan.edu.cn/
telnet://bbs.fudan.edu.cn/
http://mail.bashu.cn:8080/BsOnline/
Your task is to find the domain for all given URLs.

 

Input

There are multiple test cases in this problem. The first line of input contains a single integer denoting the number of test cases.
For each of test case, there is only one line contains a valid URL.

 

Output

For each test case, you should output the domain of the given URL.

 

Sample Input

  
  

   
   3
http://dict.bing.com.cn/#%E5%B0%8F%E6%95%B0%E7%82%B9
http://www.mariowiki.com/Mushroom
https://mail.google.com/mail/?shva=1#inbox
  
  

 

Sample Output

  
  

   
   Case #1: dict.bing.com.cn
Case #2: www.mariowiki.com
Case #3: mail.google.com
  
  
  
  

   
   

  
  
  
  

   
   注意结果是在//和 :or/ 之间.
  
  
  
  

   
   
   
   
#include<stdio.h>
#include<string.h>
char url[1010];
int main()
{
	int t;
	int i,k=1,m;
	scanf("%d",&t);
	while(t--)
	{
		m=0;
		scanf("%s",url);
		for(i=0;url[i]!='\0';i++)
		{
			if(m==0&&url[i]=='/')
			{
				m=i+2;
				i++;
				continue;
			}
			if(m!=0&&url[i]==':'||url[i]=='/')
			{
				url[i]='\0';
				break;
			}
		}
		printf("Case #%d: ",k);
		k++;
		printf("%s\n",url+m);
	}
	return 0;
}