题解 | #牛牛的时钟#
牛牛的时钟
https://www.nowcoder.com/practice/36fd5f6b6236452f99f0ea59cd3447e0
#include <stdio.h>
#include<malloc.h>
int main() {
int n;
scanf("%d", &n);
int* arr = malloc(sizeof(int) * n);
for (int i = 0; i < n; i++)scanf("%d", &arr[i]);
int sumT = 0;
for (int i = 0; i < n; i++) {
sumT += arr[i];
//tips:24进制的
printf("%d %d %d\n", sumT / 3600 % 24, sumT / 60 % 60, sumT % 60);
}
return 0;
}
#C#0基础学C 文章被收录于专栏
0基础学C,从算法开始

