叶花永不相见

题解

/ 注册

全部文章 / 题解（共146篇）

题解 | #公务员面试#

while 1: try: max = 0 min = 100 sum = 0 n = map(float, input().split()) for i in n: sum += i ...

Python3

2022-06-23

0 280

题解 | #水仙花数#

while 1: try: m, n = map(int, input().split()) flag = 0 for i in range(m, n+1): tmp = i sum = 0 ...

Python3

2022-06-23

0 258

题解 | #小乐乐算多少人被请家长#

n = int(input()) cnt = 0 for i in range(n): a,b,c = map(int, input().split()) if (a+b+c)/3 < 60: cnt += 1 print(cnt)

Python3

2022-06-22

0 304

题解 | #魔法数字变换#

n = int(input()) cnt = 0 while n != 1: if n % 2 == 0: n = n // 2 cnt += 1 else: n = 3*n+1 cnt += 1 print(cnt)

Python3

2022-06-22

0 334

题解 | #牛牛学数列3#

n = int(input()) m = 0 s = 0 for i in range(1, n+1): m += (-1)**(i-1)*(2*i-1) s += 1/m print("%.3f" % s)

Python3

2022-06-18

0 290

题解 | #牛牛学数列#

n = int(input()) ji = 0 ou = 0 for i in range(1, n+1): if i % 2 == 0: ou += i else: ji += i print(ji-ou)

Python3

2022-06-18

0 286

题解 | #KiKi求质数个数#

for i in range(1,10): for j in range(1,i+1): print("%d*%d=%2d" % (j, i, i*j), end=" ") print()

Python3

2022-06-18

0 275

题解 | #计算某字符出现次数#

#include<stdio.h> #include<string.h> int main() { char str[1000]; int count = 0; char ch; scanf("%[^\n]\n",str); scanf...

C

2022-06-17

0 295

题解 | #奇偶统计#

n =int(input()) ji = 0 ou = 0 for i in range(1,n+1): if i % 2 == 0: ou += 1 else: ji += 1 print("%d %d" % (ji,ou))

Python3

2022-06-17

0 267

题解 | #[NOIP2008]ISBN号码#

a,b,c,d =input().split("-") num = ''.join([a,b,c]) sum = 0 j=1 for i in num: sum += int(i)*j j += 1 if sum % 11 == 10: s = "X" else: s...

Python3

2022-06-17

0 255