ZOJ-3914-Semantic Version【模拟】

---

3914-Semantic Version

---

                    Time Limit: 2 Seconds      Memory Limit: 65536 KB

In the world of software management there exists a dread place called “dependency hell.” The bigger your system grows and the more packages you integrate into your software, the more likely you are to find yourself, one day, in this pit of despair.

In systems with many dependencies, releasing new package versions can quickly become a nightmare. If the dependency specifications are too tight, you are in danger of version lock (the inability to upgrade a package without having to release new versions of every dependent package). If dependencies are specified too loosely, you will inevitably be bitten by version promiscuity (assuming compatibility with more future versions than is reasonable). Dependency hell is where you are when version lock and/or version promiscuity prevent you from easily and safely moving your project forward.

As a solution to this problem, Tom Preston-Werner proposed a simple set of rules and requirements that dictate how version numbers are assigned and incremented. These rules are based on but not necessarily limited to pre-existing widespread common practices in use in both closed and open-source software. For this system to work, you first need to declare a public API. This may consist of documentation or be enforced by the code itself. Regardless, it is important that this API be clear and precise. Once you identify your public API, you communicate changes to it with specific increments to your version number. Consider a version format of X.Y.Z (Major.Minor.Patch). Bug fixes not affecting the API increment the patch version, backwards compatible API additions/changes increment the minor version, and backwards incompatible API changes increment the major version.

Software using Semantic Versioning MUST declare a public API. This API could be declared in the code itself or exist strictly in documentation. However it is done, it should be precise and comprehensive.

A normal version number MUST take the form X.Y.Z where X, Y, and Z are non-negative integers, and MUST NOT contain leading zeroes. X is the major version, Y is the minor version, and Z is the patch version. Each element MUST increase numerically. For instance: 1.9.0 -> 1.10.0 -> 1.11.0.

Once a versioned package has been released, the contents of that version MUST NOT be modified. Any modifications MUST be released as a new version.

Major version zero (0.y.z) is for initial development. Anything may change at any time. The public API should not be considered stable.

Version 1.0.0 defines the public API. The way in which the version number is incremented after this release is dependent on this public API and how it changes.

Patch version Z (x.y.Z | x >= 0, y >= 0, Z >= 0) MUST be incremented if only backwards compatible bug fixes are introduced. A bug fix is defined as an internal change that fixes incorrect behavior.

Minor version Y (x.Y.z | x >= 0, Y >= 0, z >= 0) MUST be incremented if new, backwards compatible functionality is introduced to the public API. It MUST be incremented if any public API functionality is marked as deprecated. It MAY be incremented if substantial new functionality or improvements are introduced within the private code. It MAY include patch level changes. Patch version MUST be reset to 0 when minor version is incremented.

Major version X (X.y.z | X >= 0, y >= 0, z >= 0) MUST be incremented if any backwards incompatible changes are introduced to the public API. It MAY include minor and patch level changes. Patch and minor version MUST be reset to 0 when major version is incremented.

A pre-release version MAY be denoted by appending a hyphen and a series of dot separated identifiers immediately following the patch version. Identifiers MUST comprise only ASCII alphanumerics and hyphen [0-9A-Za-z-]. Identifiers MUST NOT be empty. Numeric identifiers MUST NOT include leading zeroes. Pre-release versions have a lower precedence than the associated normal version. A pre-release version indicates that the version is unstable and might not satisfy the intended compatibility requirements as denoted by its associated normal version. Examples: 1.0.0-alpha, 1.0.0-alpha.1, 1.0.0-0.3.7, 1.0.0-x.7.z.92.

Build metadata MAY be denoted by appending a plus sign and a series of dot separated identifiers immediately following the patch or pre-release version. Identifiers MUST comprise only ASCII alphanumerics and hyphen [0-9A-Za-z-]. Identifiers MUST NOT be empty. Build metadata SHOULD be ignored when determining version precedence. Thus two versions that differ only in the build metadata, have the same precedence. Examples: 1.0.0-alpha+001, 1.0.0+20130313144700, 1.0.0-beta+exp.sha.5114f85.

Precedence refers to how versions are compared to each other when ordered. Precedence MUST be calculated by separating the version into major, minor, patch and pre-release identifiers in that order (Build metadata does not figure into precedence). Precedence is determined by the first difference when comparing each of these identifiers from left to right as follows: Major, minor, and patch versions are always compared numerically. Example: 1.0.0 < 2.0.0 < 2.1.0 < 2.1.1. When major, minor, and patch are equal, a pre-release version has lower precedence than a normal version. Example: 1.0.0-alpha < 1.0.0. Precedence for two pre-release versions with the same major, minor, and patch version MUST be determined by comparing each dot separated identifier from left to right until a difference is found as follows: identifiers consisting of only digits are compared numerically and identifiers with letters or hyphens are compared lexically in ASCII sort order. Numeric identifiers always have lower precedence than non-numeric identifiers. A larger set of pre-release fields has a higher precedence than a smaller set, if all of the preceding identifiers are equal. Example: 1.0.0-alpha < 1.0.0-alpha.1 < 1.0.0-alpha.beta < 1.0.0-beta < 1.0.0-beta.2 < 1.0.0-beta.11 < 1.0.0-rc.1 < 1.0.0.

Now you have installed a software which is managed by strict semantic version without build metadata. Knowing its current version and latest version, determine whether you need to update the software. It’s guaranteed the length of version string is no more than 30, and major version, minor version, patch version are all integers which are not less than 0.

Input

The input may consist multiple test cases.

For each test case, two legal semantic versions without build metadata are given in one line, seperated by a single space, describing the installed version and the latest version respectively.

Output

If a new version is ready, print a line “Wow! Such feature! Very smart! I’m excited!”. If not, print a line “I’m angry!”.

Sample Input
1.0.0 1.1.0-beta
1.0.0-beta 1.0.0
1.0.0-beta.2 1.0.0-beta
1.0.0-rc.1 1.0.0-rc.1

Sample Output
Wow! Such feature! Very smart! I’m excited!
Wow! Such feature! Very smart! I’m excited!
I’m angry!
I’m angry!

题目链接：ZOJ-3914

题目思路：模拟，orz

以下是代码：

#include <vector>#include <map>#include <set>#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>using namespace std;int cmp(string a,string b){    if(isdigit(a[0]) && isdigit(b[0]))    {        if (a.size() != b.size())            return a.size() < b.size();        else        {            return a < b;        }    }    else        return a < b;}int main(){    string s,t;    while(cin >> s >> t)    {        int n = 2;        int flag = 0;        while(n--)        {            int s_poi = s.find('.');            int t_poi = t.find('.');            string ret_s = s.substr(0,s_poi);            string ret_t = t.substr(0,t_poi);            if (ret_s != ret_t)            {                if (cmp(ret_s,ret_t))   cout << "Wow! Such feature! Very smart! I'm excited!\n";                else cout << "I'm angry!\n";                flag = 1;                break;            }               s.erase(0,s_poi + 1);            t.erase(0,t_poi + 1);           }        if (!flag)        {            string ret_s,ret_t;            if (s.find('-') != string :: npos)  ret_s = s.substr(0,s.find('-'));            else ret_s = s;            if (t.find('-') != string :: npos)  ret_t = t.substr(0,t.find('-'));            else ret_t = t;            if (ret_t != ret_s)            {                if (cmp(ret_s,ret_t))   cout << "Wow! Such feature! Very smart! I'm excited!\n";                else cout << "I'm angry!\n";                        }            else            {                int s_poi = s.find('-');                int t_poi = t.find('-');                if (s_poi != string :: npos && t_poi != string :: npos)                {                    s.erase(0,s_poi+1);                    t.erase(0,t_poi+1);                    while(s.find('.') != string :: npos && t.find('.') != string :: npos)                    {                        s_poi = s.find('.');                        t_poi = t.find('.');                        string ret_s = s.substr(0,s_poi);                        string ret_t = s.substr(0,t_poi);                        if (ret_s != ret_t)                        {                            if (cmp(ret_s,ret_t))   cout << "Wow! Such feature! Very smart! I'm excited!\n";                            else cout << "I'm angry!\n";                            flag = 1;                            break;                        }                           s.erase(0,s_poi + 1);                        t.erase(0,t_poi + 1);                    }                    if (!flag)                    {                        string ret_s,ret_t;                        if (s.find('.')) ret_s = s.substr(0,s.find('.'));                        else ret_s = s;                        if (t.find('.')) ret_t = t.substr(0,t.find('.'));                        else ret_t = t;                        if (cmp(ret_s,ret_t)) cout << "Wow! Such feature! Very smart! I'm excited!\n";                        else                        {                            if (ret_s == ret_t)                            {                                if (t.size() > s.size()) cout << "Wow! Such feature! Very smart! I'm excited!\n";                                else cout << "I'm angry!\n";                            }                            else                            {                                cout << "I'm angry!\n";                            }                        }                     }                       }                else                {                    if (t_poi == string :: npos && s_poi != string :: npos) cout << "Wow! Such feature! Very smart! I'm excited!\n";                    else cout << "I'm angry!\n";                }            }        }    }     return 0;}