gudnm

#include <iostream>
#include <cmath>
using namespace std;

struct placedRect
{
	int x,
		y,
		width,
		height;

gudnm

"""
Write a program that plays Tic-tac-toe with you and tries its best to lose
"""

def printBoard(b):
	for i in range(3):
		print(b[3*i], b[3*i+1], b[3*i+2])

def getNext(b):
	move = int(input("Your move, sir (must be a number from 1 to 9): ")) - 1

gudnm

class Gomoku:
	def __init__(self, size):
		self.size = size
		self.board = ['-'] * size * size
		self.inarow = 5
		self.players = ['x', 'o']
		self.curplayer = 1

	def printboard(self):
		s = self.size

gudnm

class Twitter(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.followers = {}
        self.tweets = {}

    def postTweet(self, userId, tweetId):

gudnm

n = int(input())
for _ in range(n):
    a, b = map(int, input().split())
    while b > a:
        b &= (b-1)
    print(b)

gudnm

n = 1000000
primes = [False, False] + [True]*(n-2)
for i in range(2, int(n**0.5)+1):
    if primes[i]:
        primes[i*i::i] = [False] * len(primes[i*i::i])

def check_rotations(num):
	s = str(num)
	return all(primes[int((s+s)[i:i+len(s)])] for i in range(len(s)))

gudnm

# Definition for a  binary tree node
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    # @param A : root node of tree
    # @return an integer

gudnm

import collections
class TrieNode(object):
    def __init__(self, letter=None):
        self.letter = letter
        self.freq = 1
        self.suffixes = collections.OrderedDict()

    def add(self, word):
        node = self
        for letter in word:

gudnm

HAI 1.1
I HAS A t ITZ A YARN
GIMMEH t
MAEK t A NUMBR
VISIBLE t
BTW I HAS A count ITZ 0
IM IN YR mainloop UPPIN YR count TIL BOTH SAEM count AN t
    I HAS A n ITZ A NUMBR
    GIMMEH n
    VISIBLE n

gudnm