qq_51050526的博客

蓝桥杯复习总结1.最大公约数int gcd(int a,int b){ if(b==0) return a; else return gcd(b,a%b);}int gcd(int a,int b){ return a%b==0?b:gcd(b,a%b);}2.最小公倍数最小公倍数=两数的乘积/最大公约（因）数3.闰年的判断首先明确 什么是闰年？1、能被4整除，但不能被100整除；2、能被400整除； bool isLeapYear(int year){

#数字的翻转#include<iostream>using namespace std;int judge(int data){int i=0;int t=data;while(t){ i=10*i+(t%10);//10*i是为了让个位为0，t%10得到末位,10*i+(t%10)添加末尾 t=t/10; //舍弃最后一位 }if(data==i) return 1;elsereturn 0;/*---------end------------*/}int

#—*—coding:utf-8-*-#Author:yizipu#Time:2021/7/7 21:16#file:懒人听书pc端.pyimport pyttsx3import tkinter as tkimport tkinter.filedialog as tkffrom tkinter import messageboxwindow=tk.Tk()window.title('听力软件')window.geometry('700x480')window['backgroun

import itertools as itsword=input("其输入可能是密码的字符：")word_len=int(input("密码长度："))r=its.product(word,repeat=word_len)dict=open(".\pyhton密码本.txt",'a')for i in r: dict.write("".join(i)) dict.write("".join('\n')) dict.close()print("生成成功！")...

import requestsimport timefrom lxml import etreefrom bs4 import BeautifulSoupimport redef get_html(url): headers={'user-agent':' Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.77 Safari/537.36 E.