hmm, let's summarize the discussion: @GingerIndustries package contains a machine, that uses electricity by being plugged into a wall, but does not have a digital display. The machine has moderately sharp parts moving really quickly and is used for food purposes
@PyGamer0 Technically, yes, however when I'm working on something in python, js, html, c, etc. it automatically converts tabs to spaces. It might have been a setting that I changed, but I don't remember doing it, and the default vimrc seems to be unmodified
@pxeger The tabs vs spaces debate is one of the main reasons why Cursed (once I get around to actually implementing it) will use ZWSP for indentation instead
@RadvylfPrograms you shouldn't change it, because it's provided by the distribution so it may be overwritten by the package manager next time vim is updated
How many matchstick moves to change a number
Using the matchstick numbers here: Count the Matchsticks
_ _ _ _ _ _ _ _
| | | _| _| |_| |_ |_ | |_| |_|
|_| | |_ _| | _| |_| | |_| _|
How many matchsticks must be moved or removed to chang...
Your task in this challenge is to analyize a given "Matchstick Equation" like this one...
... and to find out whether it can be turned into a valid equation by rearranging the matches. If so, you are to output the least number of moves to do so and the resulting equation.
Input
The input is ...
I have a million strings in set A and a thousand in set B. But each one in set B and I want to know which stings in set A it is a substring Iif
I have a million strings in set A and a thousand in set B. But each one in set B and I want to know which stings in set A it is a substring of. Is there a python way to do we
sample input:
i like this. program very much 123 What is thiS $
output:
I lIke thIs. prOgrAm vEry mUch 123 whAt Is thIs $
S = input()
vowels = 'aeiouAEIOU'
for letter in S:
if letter in vowels:
letter.upper()
else:
letter.lower()
print(letter,end="")
I have a million strings in set A and a thousand in set B. But each one in set B and I want to know which strings in set A it is a substring of. Is there a python way to do this quickly using a clever module?
You are given a matrix A consisting of N rows and M columns. Each field of
the matrix contains a positive integer.
You want to find a path consisting of neighboring fields. Two fields are
neighboring if they share a common side. The path can start and end on any
field and can turn left or right a...
CMC If I have a list of strings, say L = ['apple', 'pair', 'please'] and I give you some indices, say [2,11], using binary search find the indices of the strings these indices refer to. Assume that index 0 is the start of the first string, index 6 is the start of the second and index 10 is the start of the third.
How many matchstick moves to change a number
Using the matchstick numbers here: Count the Matchsticks
_ _ _ _ _ _ _ _
| | | _| _| |_| |_ |_ | |_| |_|
|_| | |_ _| | _| |_| | |_| _|
How many matchsticks must be moved or removed to chang...
Your task in this challenge is to analyize a given "Matchstick Equation" like this one...
... and to find out whether it can be turned into a valid equation by rearranging the matches. If so, you are to output the least number of moves to do so and the resulting equation.
Input
The input is ...
sample input:
i like this. program very much 123 What is thiS $
output:
I lIke thIs. prOgrAm vEry mUch 123 whAt Is thIs $
S = input()
vowels = 'aeiouAEIOU'
for letter in S:
if letter in vowels:
letter.upper()
else:
letter.lower()
print(letter,end="")
