Answer:
file1 = []
file2 = []
fileone = "lyric1.txt"
filetwo = "lyric2.txt"
def linereader( myfile, mylist):
for line in open(myfile, "r") as file:
line_read = readlines( line)
mylist.append( line_read)
file.close()
linereader( fileone, file1)
linereader( filetwo, file2)
# Assuming both files have same number of lines.
for index, item in enumerate(zip(file1, file2)):
if item[0] != item[1]:
print( index + 1, item)
Explanation:
The python code compares two files and returns the number and the lines from both files that do not match. The source code opens the files lyric1.txt and lyric2.txt reading each lines to different lists which are iterated to compare its items returning the number of the line and the unequal lines.
Yes, horizontal rows are periods. “All of the elements in a
period have a similar number of atomic orbitals. Each element in the top row
(the principal time frame) has one orbital for its electrons. The greater part
of the components in the second column (the second time frame) has two orbitals
for their electrons. It goes down the occasional table that way. As of now, the
most extreme number of electron orbitals or electron shells for any element is
seven."<span>
<span>The vertical columns are groups. "The elements in a
group have the same number of electrons in their outer orbital [and thus the
same charge]. Every element in the first column (bunch one) has one electron in
its external shell. Each element on the second segment (assemble two) has two
electrons in the external shell. As you continue tallying the segments, you'll
know what numbers of electrons are in the external shell.</span></span>
Answer:
1000
Explanation I SEARCHED IT Up
Answer:
// C++ program to find k largest elements in the array
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variable
int n,k;
cout<<"Enter the number of elements of array:";
// read the value of n
cin>>n;
// declare the array of size n
int arr[n];
cout<<"Enter the elements of array:";
// read the elements of array
for(int a=0;a<n;a++)
{
cin>>arr[a];
}
cout<<"Enter the value of K:";
cin>>k;
// call the function to perform selection Sort
sort(arr, arr+n);
cout << k<<" largest elements of the array are: ";
// print k largest elements of the array
for (int i=n-1; i>n-k-1; i--)
cout << arr[i] << " ";
return 0;
}
Explanation:
Read the number of elements in the array.Then create an array of size "n" and read n elements of the array.Sort the array in ascending array.Then Read the value of k from user.Find the k Elements from the end of the array.This will be the k largest elements of the array.
Output:
Enter the number of elements of array:8
Enter the elements of array:34 8 75 99 12 7 5 55
Enter the value of K:3
3 largest elements of the array are: 99 75 55
The answer you were looking for and see it because you must be able to have a flexible and creative mind
