/* https://www.sololearn.com/Discuss/756793/?ref=app 🏆 [M💙 Challenge] Roller Coaster Number 🎢 Monday Blue 💙 Challenge Series #3 Let's have some fun! A roller coaster number can be obtained by populating all the numbers between 2 adjacent digits in range [0123456789]. 💼 TASK Write a program to accept an integer and produce the output in the following pattern (e.g. 10250):- [1 ⬇] [0 ⬆] 1 [2 ⬆] 3 4 [5 ⬇] 4 3 2 1 [0] 🔧 TEST CASE ☑ 1 ▶ 1 ☑ 123 ▶ 123 ☑ 11111 ▶ 11111 ☑ 1233 ▶ 1233 ☑ 00123 ▶ 00123 ☑ 191 ▶ 12345678987654321 ☑ 00179 ▶ 00123456789 ☑ 12375 ▶ 123456765 ☑ 15552 ▶ 1234555432 ☑ 17900 ▶ 1234567898765432100 ☑ 030201 ▶ 012321012101 ☑ 152857 ▶ 1234543234567876567 Happy Coding!!! 😁💻 */ #include #include using namespace std; int ipow (int base, int exp) { int result = 1; for(int i = 0; i < exp; i++) result *= base; return result; } int numDig(int n) { if(!n) return 1; if(n<0) return log10(-n) + 1; return log10(n) + 1; } int* getDigits(int n, int numDigits) { int *digits = new int[numDigits]; for(int i = numDigits - 1; i >= 0; i--) digits[numDigits - 1 - i] = n/ipow(10,i)%10; return digits; } void rollerCoaster(int num) { int numDigits = numDig(num); int* digits = getDigits(num,numDigits); for(int i = 0; i < numDigits - 1; i++) { cout << digits[i]; if(digits[i+1]>digits[i]) for(int j = digits[i] + 1; j < digits[i+1]; j++) cout << j; if(digits[i+1] digits[i+1]; j--) cout << j; } cout << digits[numDigits - 1] << endl; } int main() { int num = 0; cin >> num; if(num < 0) num *= -1; rollerCoaster(num); return 0; }