Tomrock D'souza tomrockdsouza

## find_prime_numbers_upto.py
'''
 Most efficient algorithm in python
 Get prime numbers upto a given number.
 By Tomrock D'souza
'''
from numba import jit
from time import time


@jit(nopython=True)

## DisableAutomaticRestartSignOn.reg
Windows Registry Editor Version 5.00

[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\System]
"DisableAutomaticRestartSignOn"=dword:00000001

## DisableAutoLoginWindows11.txt
HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\System

On the above key create
DWORD32: DisableAutomaticRestartSignOn
with value: 1

## expose_local_server.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                tomrockdsouza
                / expose_local_server.md
            
            
              Last active
              December 30, 2023 19:10
            
              
                Commands and Instruction to expose your local server unlimited on the web with any domain or subdomain
              
          
    Youtube Tutorial

##local-pc
ssh-keygen -t ed25519 -C "user@example.com" -f demo
ssh -i demo ubuntu@IPX

##server
sudo su
iptables -F


## kmeans-alpaca.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                tomrockdsouza
                / kmeans-alpaca.ipynb
            
            
              Last active
              June 25, 2023 18:04
            
          
      Loading

      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## main.py
# Hennge Senior Software Engineer (Python Challenge)
#######################################################################
# Mission Description
#
# We want to calculate a sum of squares of some integers, excepting negatives
# * The first line of the input will be an integer N (1 <= N <= 100)
# * Each of the following N test cases consists of one line containing an integer X (0 < X <= 100),
#   followed by X integers (Yn, -100 <= Yn <= 100) space-separated on the next line
# * For each test case, calculate the sum of squares of the integers excepting negatives,
#   and print the calculated sum to the output. No blank line between test cases

## sqlite_worker.py
import sqlalchemy
import sqlite3

def get_engine_conn(dbx):
    return sqlalchemy.create_engine(f'sqlite:///{dbx}')

def get_conn(dbx):
    return sqlite3.connect(dbx)


## create_sqlite3_db.py
import sqlite3
import re

if __name__ == '__main__':
    database_name=input('Enter Database Name: ')
    database_name=re.sub(r'\W+', '', database_name)
    conn = sqlite3.connect('./'+database_name+'.db')
    conn.close()


## dc.html
<!DOCTYPE html>
<html>
<head>

<script type="text/javascript" src="https://cdn.rawgit.com/ricmoo/aes-js/e27b99df/index.js"></script>
<script>

function decryptAES(encryptedHex){
// An example 128-bit key
var key = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ];

## tommy.py
row=int(input())
col=int(input())
xpoint=int(input())
ypoint=int(input())
mult = row * col
p=[]

def isPrime(num):
    for x in reversed(range(2,num)):
        if num%x==0 and num>1 :
	'''
	Most efficient algorithm in python
	Get prime numbers upto a given number.
	By Tomrock D'souza
	'''
	from numba import jit
	from time import time


	@jit(nopython=True)
	Windows Registry Editor Version 5.00

	[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\System]
	"DisableAutomaticRestartSignOn"=dword:00000001
	HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\System

	On the above key create
	DWORD32: DisableAutomaticRestartSignOn
	with value: 1
	# Hennge Senior Software Engineer (Python Challenge)
	#######################################################################
	# Mission Description
	#
	# We want to calculate a sum of squares of some integers, excepting negatives
	# * The first line of the input will be an integer N (1 <= N <= 100)
	# * Each of the following N test cases consists of one line containing an integer X (0 < X <= 100),
	# followed by X integers (Yn, -100 <= Yn <= 100) space-separated on the next line
	# * For each test case, calculate the sum of squares of the integers excepting negatives,
	# and print the calculated sum to the output. No blank line between test cases
	import sqlalchemy
	import sqlite3

	def get_engine_conn(dbx):
	return sqlalchemy.create_engine(f'sqlite:///{dbx}')

	def get_conn(dbx):
	return sqlite3.connect(dbx)
	import sqlite3
	import re

	if __name__ == '__main__':
	database_name=input('Enter Database Name: ')
	database_name=re.sub(r'\W+', '', database_name)
	conn = sqlite3.connect('./'+database_name+'.db')
	conn.close()
	<!DOCTYPE html>
	<html>
	<head>

	<script type="text/javascript" src="https://cdn.rawgit.com/ricmoo/aes-js/e27b99df/index.js"></script>
	<script>

	function decryptAES(encryptedHex){
	// An example 128-bit key
	var key = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ];
	row=int(input())
	col=int(input())
	xpoint=int(input())
	ypoint=int(input())
	mult = row * col
	p=[]

	def isPrime(num):
	for x in reversed(range(2,num)):
	if num%x==0 and num>1 :