Answer:
The solution code is written in Python 3.
- def convertDate(date_string):
-
- date_list = date_string.split("/")
-
- for i in range(0, len(date_list)):
- date_list[i] = int(date_list[i])
-
- return date_list
-
-
- print(convertDate('06/11/1930'))
Explanation:
Firstly, create a function convertDate() with one parameter, <em>date_string</em>. (Line 1).
Next, use the Python string <em>split()</em> method to split the date string into a list of date components (month, day & year) and assign it to variable <em>date_list</em>. (Line 3) In this case, we use "/" as the separator.
However, all the separated date components in the <em>date_list</em> are still a string. We can use for-loop to traverse through each of the element within the list and convert each of them to integer using Python<em> int() </em>function. (Line 5 - 6)
At last return the final date_list as the output (Line 8)
We can test our function as in Line 11. We shall see the output is as follow:
[6, 11, 1930]
It makes the possibility of an unwanted user to break into your account much smaller.
Answer:
The description for the given question is described in the explanation section below.
Explanation:
I would like to reinforce in advanced or complex concepts such as documents as well as channels, internet programming, multi-threading, after that last lesson.
- I am interested in learning web development to develop applications or software. I would also like to explore those concepts by using open source tools.
- Course concepts will have to develop models for handling.
- No there is no subject matter or definition you provide further clarity for.
- I'm interested in studying java as well as web development in comparison to C++ so I can use it in my contract work.
Answer:
Code is given below and output is attached as an image.
Explanation:
#include <iostream>
#include <fstream>
using namespace std;
bool isPalindrome(int n)
{
// Find reverse of n
int rev = 0;
for (int i = n; i > 0; i /= 10)
rev = rev * 10 + i % 10;
// If n and rev are same,then n is a palindrome
return (n == rev);
}
int main()
{
int min = 1; // Lower Bound
int max = 200; // Upper Bound
ofstream myfile;
myfile.open("palindrome.txt");
for (int i = min + 1; i < max; i++)
if (isPalindrome(i))
myfile << i << endl;
myfile.close();
return 0;
}
