//Challenge - Staircase Number Checker //Input - A Number, which you need to check. // Link_to_challenge - https://www.sololearn.com/discuss/885383/?ref=app //Created by - Kinshuk V. 27/11/2017 //Number of Lines - 52 (Excluding Docstrings) #include #include #include #include using namespace std; void Staircase(string num) { bool pass = false; string no; string rpt; //To hold isolated elements for(char i : num) if(isdigit(i)) no+=i; // Loop to throw the alphabets // from the input for(int i=0;i<9;i++) // Loop to check for atleast 2 or more // occurences of the numbers present - (1) { char c = 48+i; int ct = count(no.begin(), no.end(),c); if(ct!=1) pass = true; else {pass = false; break;} string::iterator it; it = find(no.begin(),no.end(),c); if(it==no.end()&&it==no.end()-1&&ct>1) {pass = false; break;} else if(*(it+1)!=c&&(ct>1)) {pass=false; break;} } for(int i=0;i 1236 { if(not count(rpt.begin(), rpt.end(), no[i])) rpt+=no[i]; } if(pass&&rpt.length()>1) //If our number satisfies (1) and it //atleast has 2 steps. { bool up = rpt[0]rpt[1]; // Checks if the initial step is // downward oriented for(int i=1;irpt[i])&&up) // Cond. 1 - Step goes up // when we expected up. {up=true; down=false;} else if((rpt[i+1]rpt[i])&&down) // Cond. 4 - Step goes up when // we expected down. {up=false; down=false; break;} } if(up) cout<<"Upward Staircase Number"; else if(down) cout<<"Downward Staircase Number"; else cout<<"A Weird Staircase Number"; } else cout<<"Not a Staircase Number"; } int main() { string s; getline(cin,s); Staircase(s); }