So Hey whatsup guys today at engraver beats we are gonna talk about that how to create android apps without codding
yes, android apps can be created without codding but with some limitations but then also you can create an awesome app and also can do most of the things and even through that you can earn money from ads same like a website.So first of all there are these websites through which you can android apps
1.https://thunkable.com/#/ (Ads allowed medium)
2. https://www.kodular.io/ (Ads allowed all types Best)
3. http://appinventor.mit.edu/explore/ (Ads not allowed low)
4.https://appybuilder.com/ (Ads allowed Higher than medium)
These all are best app creating platform without codding and if you want to know how to create apps by using above sites you can go on youtube and watch just searching any above and what you want to make The apps created from above platform can also be published on playstore now some channels which can help you for learning building apps are on youtube
1.walya express (search on youtube)
2.7 star media (search on youtube)
3. The developer 2.0 (Search on youtube)
Best channels for learning developing apps using website
Now lets tell you about all platform seperately and what are there advantages and disadvantages
Lets go
Thunkable
Appinventor
Appy Builder
yes, android apps can be created without codding but with some limitations but then also you can create an awesome app and also can do most of the things and even through that you can earn money from ads same like a website.So first of all there are these websites through which you can android apps
1.https://thunkable.com/#/ (Ads allowed medium)
2. https://www.kodular.io/ (Ads allowed all types Best)
3. http://appinventor.mit.edu/explore/ (Ads not allowed low)
4.https://appybuilder.com/ (Ads allowed Higher than medium)
These all are best app creating platform without codding and if you want to know how to create apps by using above sites you can go on youtube and watch just searching any above and what you want to make The apps created from above platform can also be published on playstore now some channels which can help you for learning building apps are on youtube
1.walya express (search on youtube)
2.7 star media (search on youtube)
3. The developer 2.0 (Search on youtube)
Best channels for learning developing apps using website
Now lets tell you about all platform seperately and what are there advantages and disadvantages
Lets go
Thunkable
Thunkable is one of the oldest and best app creators without codding they provide a good customer support through there own thunkable community where you can ask any problem facing in thunkable or any new thing you want to know and also they have admob banner,intestional ads feature but not any other if you want to add other ads you can use extension there is also one more version of thunkable which is thunkable modern above which i tell you about was thunkable classic with new modern thu
KodularAppinventor
Appy Builder
nice
ReplyDeleteCertainly! Let's go through the program step by step:
ReplyDelete1. The `is_prime` function is defined to check if a number is prime or not. It takes an integer `n` as input and returns `True` if `n` is prime, and `False` otherwise. The function first checks if `n` is less than 2, in which case it returns `False` since prime numbers are greater than 1. Then, it iterates from 2 to the square root of `n` (using the `range` function) and checks if `n` is divisible by any number in this range. If `n` is divisible by any number, it means that `n` is not prime and the function returns `False`. If the loop completes without finding any divisors, it means that `n` is prime and the function returns `True`.
2. The `is_sphenic_number` function is defined to check if a given number has exactly three distinct prime factors. It takes an integer `num` as input and returns `True` if `num` is a sphenic number, and `False` otherwise. The function initializes an empty list `prime_factors` to store the prime factors of `num`. It then iterates from 2 to `num-1` (using the `range` function) and checks if `num` is divisible by `i` and if `i` is a prime number (using the `is_prime` function). If both conditions are satisfied, it means that `i` is a prime factor of `num` and it is added to the `prime_factors` list. The function also checks if the length of `prime_factors` is greater than 3, which means that `num` has more than three prime factors and is not a sphenic number. If the loop completes without finding more than three prime factors, the function checks if the length of `prime_factors` is exactly 3. If it is, it means that `num` has exactly three distinct prime factors and it is a sphenic number, so the function returns `True`. If neither condition is satisfied, it means that `num` is not a sphenic number and the function returns `False`.
3. We then test the `is_sphenic_number` function by taking input from the user using the `input` function. The input is converted to an integer using the `int` function and stored in the variable `number`. We then call the `is_sphenic_number` function with `number` as the argument. If the function returns `True`, we print that `number` is a sphenic number. Otherwise, we print that `number` is not a sphenic number.
I hope this explanation helps! Let me know if you have any further questions.
python
ReplyDeletedef is_prime(n):
if n < 2:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
def is_sphenic_number(num):
prime_factors = []
for i in range(2, num):
if num % i == 0 and is_prime(i):
prime_factors.append(i)
if len(prime_factors) > 3:
return False
if len(prime_factors) == 3:
return True
return False
# Test the function
number = int(input("Enter a number: "))
if is_sphenic_number(number):
print(number, "is a sphenic number")
else:
print(number, "is not a sphenic number")