HDU 3125 slash

Slash

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)

Total Submission(s): 825    Accepted Submission(s): 466

Problem Description

The American English slash (/) is a punctuation mark. In the early modern period, in the Fraktur script, which was widespread through Europe in the Middle Ages, one slash(/) represented a comma, while two slashes (//) represented
a dash.

With the wide use of computers, slash appeared far more than at any previous time in history. On Unix-like systems and in URLs, the slash is to separate directory and file components of a path:

/home/whuacm/chaeyeon/Sherlockpp.jpg

http://acm.whu.edu.cn/

But in Windows systems, it uses (\) to separate directory and file components of a path:

C:\Users\v-yungao\Music\Shake

That really confuses me. Could you help me to judge if the string I wrote is right.

Please notice that I would only make a mistake by changing (\) to (/) or (/) to (\). All the strings were constituted by a-z, A-Z, 0-9, (.) , (\) and (/), no other characters would appear in the strings.

A string of URL always begins with “[a-zA-Z]+://” (Notice (/) maybe changed to (\) ), in which “[a-zA-Z]+” represents any non-empty string of letters.

Windows path begins with “[a-zA-Z]:\” (Notice (\) maybe changed to (/)), in which “[a-zA-Z]” means an English letter. (e.g. “C:\\windows” is a URL not a Windows path)

The path of Unix-like system begins with (/) or (\).

I’ll give you some strings, can you tell me which type those strings belong to and those correct forms.

Input

The first line consists of an integer T, indicating the number of strings.

The next T lines, each line consists of a single non-empty string. All of those are really data from our daily life.

Output

For each string:

If it belongs to a path in Unix-like systems, output “It’s a path in Unix-like systems!” in a new line and the correct string in the next line.

If it belongs to a path in Windows system, output “It’s a path in Windows system!” in a new line and the correct string in the next line.

If it’s a URL, output “It’s a URL!” in a new line and the correct string in the next line.

The kind of each input string can be uniquely determined.

Constrains

0 < T <= 20

The length of each string will not be longer than 50.

Sample Input

4
http://acm.whu.edu.cn/felioj
http:/\acm.whu.edu.cn/11111011001/
\home\whuacm\Slash\yama
Z:\movie/chaeyeon

Sample Output

It‘s a URL!
http://acm.whu.edu.cn/felioj
It‘s a URL!
http://acm.whu.edu.cn/11111011001/
It‘s a path in Unix-like systems!
/home/whuacm/Slash/yama
It‘s a path in Windows system!
Z:\movie\chaeyeon

告诉T个字符串,判断是三种类型中的哪一种,但是可能由于手抖把 / 和\  打错;

URL就是以/或者\开头

Unix就是一个字符串然后跟两个杠杠

Windows就是一个字符串后面跟一个杠杠

两个杠杠实际上是一样的

只是windows输出全部是 \

其他两种全部是 /

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#define N 100
using namespace std;

char s[N];
int T;

 char b[N];

int main()
{
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            scanf("%s",s);
            int len=strlen(s);

            if( (s[0]>='a'&&s[0]<='z')||(s[0]>='A'&&s[0]<='Z')  )
            {
                int ff=0;
                int i=0;
                for(i=0;i<len;i++)
                {
                    if(s[i]=='/'||s[i]=='\\')
                    {
                        if(s[i+1]=='\\'||s[i+1]=='/')
                            ff=1;//URL

                        break;
                    }
                    else
                    b[i]=s[i];
                }
                if(ff==1)
                {
                    b[i]='/';
                    i++;
                    b[i]='/';
                }
                else
                b[i++]='\\';

                for(int j=i;j<len;j++)
                {
                    if(s[j]=='\\'||s[j]=='/')
                    {
                        if(ff)
                        b[j]='/';
                        else b[j]='\\';
                    }
                    else
                    b[j]=s[j];

                }
                if(ff)
                cout<<"It's a URL!"<<endl;
                else
                cout<<"It's a path in Windows system!"<<endl;

                for(int k=0;k<len;k++)
                cout<<b[k];

            }
            else
            {
                cout<<"It's a path in Unix-like systems!"<<endl;

                for(int i=0;i<len;i++)
                {
                    if(s[i]=='/'||s[i]=='\\')
                    cout<<'/';
                    else  cout<<s[i];
                }
            }
            cout<<endl;

        }
    }
    return 0;
}
时间: 2024-11-25 11:34:12

HDU 3125 slash的相关文章

hdu 3125 Slash(模拟)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3125 Problem Description The American English slash (/) is a punctuation mark. In the early modern period, in the Fraktur script, which was widespread through Europe in the Middle Ages, one slash(/) repr

HDU 1058 Humble Numbers(离线打表)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1058 解题报告:输入一个n,输出第n个质因子只有2,3,5,7的数. 用了离线打表,因为n最大只有5842. 1 #include<stdio.h> 2 #define INT __int64 3 INT ans[5850] = { 4 0,1,2,3,4,5,6,7,8,9,10,12,14,15,16,18,20,21,24,25,27,28,30,32,35,36,40,42,45,48,4

HDU 6203 ping ping ping [LCA,贪心,DFS序,BIT(树状数组)]

题目链接:[http://acm.hdu.edu.cn/showproblem.php?pid=6203] 题意 :给出一棵树,如果(a,b)路径上有坏点,那么(a,b)之间不联通,给出一些不联通的点对,然后判断最少有多少个坏点. 题解 :求每个点对的LCA,然后根据LCA的深度排序.从LCA最深的点对开始,如果a或者b点已经有点被标记了,那么continue,否者标记(a,b)LCA的子树每个顶点加1. #include<Bits/stdc++.h> using namespace std;

HDU 5542 The Battle of Chibi dp+树状数组

题目:http://acm.hdu.edu.cn/showproblem.php?pid=5542 题意:给你n个数,求其中上升子序列长度为m的个数 可以考虑用dp[i][j]表示以a[i]结尾的长度为j的上升子序列有多少 裸的dp是o(n2m) 所以需要优化 我们可以发现dp的第3维是找比它小的数,那么就可以用树状数组来找 这样就可以降低复杂度 #include<iostream> #include<cstdio> #include<cstring> #include

hdu 1207 汉诺塔II (DP+递推)

汉诺塔II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4529    Accepted Submission(s): 2231 Problem Description 经典的汉诺塔问题经常作为一个递归的经典例题存在.可能有人并不知道汉诺塔问题的典故.汉诺塔来源于印度传说的一个故事,上帝创造世界时作了三根金刚石柱子,在一根柱子上从下往

[hdu 2102]bfs+注意INF

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2102 感觉这个题非常水,结果一直WA,最后发现居然是0x3f3f3f3f不够大导致的--把INF改成INF+INF就过了. #include<bits/stdc++.h> using namespace std; bool vis[2][15][15]; char s[2][15][15]; const int INF=0x3f3f3f3f; const int fx[]={0,0,1,-1};

HDU 3555 Bomb (数位DP)

数位dp,主要用来解决统计满足某类特殊关系或有某些特点的区间内的数的个数,它是按位来进行计数统计的,可以保存子状态,速度较快.数位dp做多了后,套路基本上都差不多,关键把要保存的状态给抽象出来,保存下来. 简介: 顾名思义,所谓的数位DP就是按照数字的个,十,百,千--位数进行的DP.数位DP的题目有着非常明显的性质: 询问[l,r]的区间内,有多少的数字满足某个性质 做法根据前缀和的思想,求出[0,l-1]和[0,r]中满足性质的数的个数,然后相减即可. 算法核心: 关于数位DP,貌似写法还是

HDU 5917 Instability ramsey定理

http://acm.hdu.edu.cn/showproblem.php?pid=5917 即世界上任意6个人中,总有3个人相互认识,或互相皆不认识. 所以子集 >= 6的一定是合法的. 然后总的子集数目是2^n,减去不合法的,暴力枚举即可. 选了1个肯定不合法,2个也是,3个的话C(n, 3)枚举判断,C(n, 4), C(n, 5) #include <bits/stdc++.h> #define IOS ios::sync_with_stdio(false) using name

hdu 6166 Senior Pan

地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6166 题目: Senior Pan Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 245    Accepted Submission(s): 71 Problem Description Senior Pan fails i