\n In recent years, algorithm and problem-solving skills have become important evaluation factors in the IT industry. As an extension of this trend, many companies are assessing candidates’ abilities through coding tests.
\n In this article, we aim to enhance basic algorithm problem-solving skills using C++ by solving the ‘Calculate ATM Withdrawal Time’ problem.\n<\/p>\n
\n In the ATM, the time taken to process a withdrawal request varies for each user.
\n For example, if one user requests a withdrawal after 1 minute, that time is fully processed, and the user can withdraw after 1 minute.
\n If multiple users request withdrawals simultaneously, the requests are processed in FIFO (First-In-First-Out) order, meaning that the first requested user is served first.\n<\/p>\n
\n Given the order of user requests and the time required for each request, write a program that calculates and outputs the total time needed for all users to complete their withdrawals.\n<\/p>\n
\n5\n3 1 4 3 2\n<\/pre>\nExample Output<\/h4>\n
\n32\n<\/pre>\nProblem Solving Process<\/h2>\n
\n The key to solving the problem is to sum up the times needed for each user to complete their withdrawal.
\n In this process, we must consider the order in which the requests are processed. Since requests are handled in FIFO order, the first requested user passes first.
\n We follow the steps below to solve this problem.\n<\/p>\nStep 1: Read Input Values<\/h3>\n
\n First, we need to read the number of requests and the request times from the user. In C++, data can be read through standard input.\n<\/p>\n
\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n\n vector<int> times(N);\n for (int i = 0; i < N; i++) {\n cin >> times[i];\n }\n\n return 0;\n}\n<\/code><\/pre>\nStep 2: Calculate Total Time<\/h3>\n
\n Each user’s request time incurs a waiting time due to the requests being processed before them.
\n Therefore, the time taken for each user to complete their request must be the sum of their request time and the request times of previous users.
\n This way, from the second user onward, the waiting time will be equal to the first user’s request time.\n<\/p>\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n\n vector<int> times(N);\n for (int i = 0; i < N; i++) {\n cin >> times[i];\n }\n\n int totalTime = 0;\n int currentTime = 0;\n\n for (int i = 0; i < N; i++) {\n currentTime += times[i]; \/\/ Add the request time to the current time\n totalTime += currentTime; \/\/ Add the current time to the total time\n }\n\n cout << totalTime << endl; \/\/ Output the final total time\n\n return 0;\n}\n<\/code><\/pre>\nStep 3: Code Explanation<\/h3>\n
\n The first part of the code is for reading data from standard input.
\nvector<int> times(N);<\/code> creates a dynamic array to store the request times.
\n Secondly, a variable calledcurrentTime<\/code> accumulates the time up to the current point.
\n Each time a user’s request comes in, the request time for that request is added tocurrentTime<\/code>, and this is accumulated in the total timetotalTime<\/code>.\n<\/p>\nComplete Code<\/h2>\n
\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N; \/\/ Input the number of requests\n\n vector<int> times(N); \/\/ Declare a vector to hold the request times\n for (int i = 0; i < N; i++) {\n cin >> times[i]; \/\/ Input the time for each request\n }\n\n int totalTime = 0; \/\/ Accumulate the total request times\n int currentTime = 0; \/\/ Accumulate the current processing time\n\n for (int i = 0; i < N; i++) {\n currentTime += times[i]; \/\/ Add the request time\n totalTime += currentTime; \/\/ Add to the total time so far\n }\n\n cout << totalTime << endl; \/\/ Output the final total time\n\n return 0;\n}\n<\/code><\/pre>\nConclusion<\/h2>\n
\n By solving problems like this, we can enhance our understanding of algorithms and the C++ programming language.
\n It will help cultivate basic problem-solving skills that can be useful in coding tests or algorithm competitions.
\n It is important to build skills through various problems and prepare for interviews, and we hope this course has helped develop that foundation.\n<\/p>\n<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"