叶花永不相见
叶花永不相见
全部文章
分类
题解(183)
归档
标签
去牛客网
登录
/
注册
叶花永不相见的博客
全部文章
(共155篇)
题解 | #查找两个字符串a,b中的最长公共子串#
#include<stdio.h> #include<string.h> int main() { char s1[1000], s2[1000], arr[1000]; scanf("%s %s", s1, s2); if(strlen(s1) &g...
C
2022-04-16
1
306
题解 | #牛牛的水杯#
h, r = map(int, input().split(" ")) v = 3.14 * h * r * r if 10000 % v == 0: print(10000 / v) else: print(int(10000 // v) + 1 )
Python3
2022-04-16
0
268
题解 | #KiKi和酸奶#
n, h, m = map(int, input().split()) while h: if m <= h: n -= 1 break else: m -= h n -= 1 print(n)
Python3
2022-04-16
0
294
题解 | #计算三角形的周长和面积#
import math a, b, c = map(int, input().split(" ")) circumference = a+b+c p = circumference / 2 area = math.sqrt(p*(p-a)*(p-b)*(p-c)) print("circumfere...
Python3
2022-04-16
0
316
题解 | #统计成绩#
n = int(input()) score = list(map(float, input().split(" "))) a = max(score) b = min(score) c = sum(score)/n print("%.2f %.2f %.2f" % (a, b, c))
Python3
2022-04-16
0
394
题解 | #名字的漂亮度#
#include<stdio.h> #include<string.h> int cmp(int *a, int *b) { return *b - *a; } int main() { int n; char str[10001]; sc...
C
2022-04-15
0
248
题解 | #称砝码#
#include<stdio.h> #include<stdlib.h> int main() { int n; int cnt = 1; scanf("%d", &n); int *weight = (int *)malloc(siz...
C
2022-04-15
2
449
题解 | #求小球落地5次后所经历的路程和第5次反弹的高度#
#include<stdio.h> int main() { int h = 0; double sum = 0; int n = 5; scanf("%d", &h); double m = (double)h; while(n)...
C
2022-04-13
0
338
题解 | #字符串加密#
#include<stdio.h> #include<string.h> int main() { char key[101]={0}; char str[101]={0}; char keys[101]={0}; char word[26]...
C
2022-04-13
0
331
题解 | #整数与IP地址间的转换#
#include<stdio.h> int main() { int a, b, c, d; unsigned int n1, n2; scanf("%d.%d.%d.%d", &a, &b, &c, &d); scanf(...
C
2022-04-11
0
331
首页
上一页
2
3
4
5
6
7
8
9
10
11
下一页
末页