View Code of Problem 99

#include <string.h>

#include <algorithm>
#include <iostream>
using namespace std;
int main() {
    string input;
    while (getline(cin, input)) {
        int n = 0, m = 0, s = 0, i;
        int firstSpace = input.find_first_of(' ');
        int lastSpace = input.find_last_of(' ');
        if (firstSpace == input.npos) {
            n = atoi(input.c_str());
            if (!n)
                break;
            for (i = 1; i < n; i++) {
                cout << i << ' ';
            }
            if(!n)
                cout << n << endl;
        } else if (firstSpace == lastSpace) {
            n = atoi(input.substr(0, firstSpace).c_str());
            m = atoi(input.substr(firstSpace + 1, input.length()).c_str());
            if (n > m) {
                for (i = n; i > m && i >= 1; i--) {
                    if(i == 1){
                        cout << i << endl;
                        break;
                    }
                    cout << i << ' ';
                }
            } else {
                for (i = n; i < m; i++) {
                    if(i < 1)
                        i = 1;
                    cout << i << ' ';
                }
            }
            if(m >= 1)
                cout << m << endl;
        } else if (firstSpace < lastSpace) {
            n = atoi(input.substr(0, firstSpace).c_str());
            m = atoi(input.substr(firstSpace + 1, lastSpace).c_str());
            s = atoi(input.substr(lastSpace + 1, input.length()).c_str());
            s += 1;
            if (n > m) {
                for (i = n; i >= m; i -= s) {
                    if((i-s) >= m)
                        cout << i << ' ';
                    else if((i-s) < m || i == m){
                        cout << i << endl;
                    }
                }
            } else {
                for (i = n; i <= m; i += s) {
                    if((i-s) <= m)
                        cout << i << ' ';
                    else if((i-s) > m || i == m){
                        cout << i << endl;
                    }
                }
            }
        }
    }
    return 0;
}