一只咖啡君
一只咖啡君
全部文章
分类
归档
标签
去牛客网
登录
/
注册
一只咖啡君的博客
全部文章
(共121篇)
【C】#牛牛的替换#
#include <stdio.h> int main() { int n; char a1, a2, a3, a4; scanf("%d %c %c %c %c", &n, &a1, &a2, &a3, &a4); ...
2022-11-15
1
3471
【C】#获得月份天数#
#include <stdio.h> int main() { int year = 0; int month = 0; int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; wh...
2022-11-12
1
2318
【C】#[NOIP2015]金币#
#include <stdio.h> int main() { int k, sum = 0, day = 0; scanf("%d", &k); for (int i = 1; i <= k; i++) { for (int j ...
2022-10-21
5
1601
【C】#井字棋#
#include <stdio.h> char isWin(char board[3][3]) { int i, j, flag = 1; //判断行 for (i = 0; i < 3; i++) { flag = 1; ...
2022-10-20
1
2433
【C】#牛牛的10类人#
#include <stdio.h> int sort(int num) { int num0 = 0, num1 = 0; while (num) { if (num % 2) num1++; else num0++; ...
2022-10-20
1
1477
【C】#矩阵转置#
#include <stdio.h> int main() { int n, m; scanf("%d %d", &n, &m); int arr[n][m]; for (int i = 0; i < n; i++) { ...
2022-10-20
2
2291
【C】#杨辉三角#
#include <stdio.h> int main() { int n; scanf("%d", &n); int arr[n][n]; for (int i = 0; i < n; i++) { for (int j ...
2022-10-20
3
3727
【C】#矩阵计算#
#include <stdio.h> int main() { int n, m, sum = 0; scanf("%d %d", &n, &m); int arr[n][m]; for (int i = 0; i < n; i++...
2022-10-20
1
1508
【C】#矩阵相等判定#
#include <stdio.h> int main() { int n, m, flag = 1; scanf("%d %d", &n, &m); int arr1[n][m], arr2[n][m]; for (int i = 0;...
2022-10-20
2
1535
【C】#矩阵元素定位#
#include <stdio.h> int main() { int n, m, x, y; scanf("%d %d", &n, &m); int arr[n][m]; for (int i = 0; i < n; i++) {...
2022-10-20
1
1492
首页
上一页
4
5
6
7
8
9
10
11
12
13
下一页
末页