Reference of python codes

Search this blog

Search This Blog

palindrome parser algorithm

May 04, 2022

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Comments

Bayesian stone paper scissor

'''priority of computer is to draw or win the match''' import time import random import mysql.connector as c con=c.connect(host='localhost',user='root',password='',database='Machine_learning') if con.is_connected(): print('successfully connected') else: print('not connected') curso=con.cursor() sql="Select * from oldgames" curso.execute(sql) data=curso.fetchall() human_score,computer_score=0,0 rul_buk={'/':1,'*':2,'-':3} round=0; stone_pap=['/','*','-'] event2={'/':1.0,'*':1.0,'-':1.0} event={'/':data[0][1],'*':data[1][1],'-':data[2][1]} decision={'/':0.0,'*':0.0,'-':0.0} event_weight=0; weights2={'/':0.333,'*':0.333,'-':0.333}; weights={'/':data[0][2],'*':data[1][2],'-':data[2][2]}; def decs(): denominator=weights['/']*

If no. of Binary digits is greater than the number itself

import java . util . Scanner ; public class Check { public static void main ( String args []){ Scanner sc = new Scanner ( System .in); System .out. print ( "Enter the Number: " ); int n = sc. nextInt (); for ( int i = 2 ; i <= n;i ++ ){ String bin = load_binary (i); if (n == bin. length ()){ System .out. println (bin); } } } public static String load_binary ( int i ){ int n = i ; int bin = 0 ; while (n > 0 ){ bin = (bin * 10 ) + n % 2 ; n /= 2 ; } String bin2 = Integer . toString (bin); return bin2; } }

check if the number is Palindrome or not

Powered by Blogger

palindrome parser algorithm

Comments

Post a Comment