姚军

输入两个数，倒着输出两个数的乘积。 输入格式: 两个数 输出格式: 一个数 输入样例1: 5 7 输出样例1: 53 输入样例2: 3 1.4 输出样例2: 2.4 输入样例3: 8 5 输出样例3: 4 lst = input().split() a,b = eval(lst[0]), eval(lst[1]) t = a*b u = str(t)[::-1] i = 0 while...

import math x = int(input()) def isPrime(x): if(x <= 1): return False else: sq = int(math.sqrt(x)) for i in range(2,sq+1): if(x%i == 0): ...

import math x = int(input()) sq = int(math.sqrt(x)) if (sq**2 == x): print(sq) else: print("No")

x = int(input()) if(x&1 == 1): print(1) else: print(0)

x = int(input()) lista = [0] for i in range(x): y = int(input()) lista.append(y+lista[i]) print(len(lista) - 1) for j in range(1,len(lista)): print(lista[j])

x = int(input()) print(bin(x)[2:])

x = int(input()) print(bin(x)[::-1][:-2])

x = int(input()) y = input() z = input() print(y.find(z[0]))

x = input().split() a = int(x[0]) b = int(x[1]) for y in range(b, a-1, -1): print(y)

x = int(input()) def f(t): if(t == 1): return 1 else: return f(t-1)*t print(f(x))

x = int(input()) ls = [] maxa = -2147483648 minb = 2147483647 for i in range(x): x = int(input()) if(x > maxa): maxa = x if(x < minb): minb = x print(minb, end=" ") ...

#include <iostream> #include <cstdio> using namespace std; long long F[103]; int main(){ int x; F[1] = 1; F[2] = 1; for(int i = 3; i < 65; i++){ F[i] = F[i-1] + F[i-2]; } scanf...

#include <iostream> #include <cstdio> using namespace std; long long F[103]; int main(){ int x, n, sum = 0; scanf("%d", &n); for(int i = 0; i < n; i++){ scanf("%d", &x); ...

x = int(input()) A = [] for i in range(x): y = int(input()) A.append(y) print(len(A)) for i in range(x-1, -1, -1): print(A[i])

诚聘英才 if ( key0xD && event.srcElement.tagName!=‘TEXTAREA’&&event.srcElement.type!=‘file’) /0xD/ { window.event.keyCode=9; } } function pf_return(form,element) { document.forms[fo...