杭电OJ
Justodiante
这个作者很懒,什么都没留下…
展开
-
杭电2090 算菜价
C#include <stdio.h>int main() { char veg[20]; double k, p; double total = 0; while (scanf("%s %lf %lf", veg, &k, &p) != EOF) { total += k*p; } printf("%.1lf\n", total); return 0;}原创 2021-09-28 15:16:24 · 129 阅读 · 0 评论 -
杭电2091 空心三角形
C#include <stdio.h>int main() { int num; char alp; int count = 0; while ((alp = getchar()) != '@') { scanf("%d", &num); if (count) { printf("\n"); } count++; for (int i = 0; i原创 2021-09-28 12:29:27 · 115 阅读 · 0 评论 -
杭电2043 密码
C#include <stdio.h>#include <string.h>int main() { int M; scanf("%d", &M); getchar(); while (M--) { char str[50]; int a, b, c, d; a = b = c = d = 0; scanf("%s", str); if (strlen(st原创 2021-03-13 22:09:41 · 156 阅读 · 0 评论 -
杭电2035 人见人爱A^B
C#include <stdio.h>int main() { int n, m; while (scanf("%d %d", &n, &m) && (n || m)) { int accumulate = n; for (int i = 1; i < m; ++i) { accumulate = accumulate * n; accumulate %=原创 2021-02-17 17:25:47 · 84 阅读 · 0 评论 -
杭电2034 人见人爱A-B
C#include <stdio.h>#include <limits.h>int main() { int n, m; while (scanf("%d %d", &n, &m) && (n || m)) { int a[n], b[m], c[100]; for (int i = 0; i < n; ++i) { scanf("%d", &a[i]);原创 2021-02-17 17:02:33 · 85 阅读 · 0 评论 -
杭电2032 杨辉三角
C#include "stdio.h"int main() { int num; while (scanf("%d", &num) != EOF) { int a[num][num]; for (int i = 0; i < num; ++i) { for (int j = 0; j <= i; ++j) { if (i == j || j == 0) {原创 2021-02-16 21:40:12 · 103 阅读 · 0 评论 -
杭电2033 人见人爱A+B
C#include <stdio.h>int main(){ int n; scanf("%d", &n); while (n--) { int h1, m1, s1, h2, m2, s2; scanf("%d %d %d %d %d %d", &h1, &m1, &s1, &h2, &m2, &s2); int s; int m_ = 0;原创 2021-02-05 18:00:05 · 62 阅读 · 0 评论 -
杭电2025 查找最大元素
C#include <stdio.h>#include <string.h>int main(){ char s[105]; while (gets(s)) { char flag = s[0]; for (int i = 0; i < strlen(s); ++i) { if (s[i] > flag) flag = s[i]; } for (int i =原创 2021-02-04 20:16:34 · 54 阅读 · 0 评论 -
杭电2099 整除的尾数
C#include <stdio.h>int main(){ int n, m; while (scanf("%d %d", &n, &m) && (n || m)) { int flag = -1; for (int i = 0; i < 10; ++i) { if ((n * 100 + i) % m == 0) { flag += 1;原创 2021-02-03 17:20:27 · 92 阅读 · 0 评论 -
杭电2026 首字母变大写
C#include <stdio.h>#include <string.h>int main(){ char s[100]; while (gets(s) != NULL) { s[0] -= 32; for (int i = 0; i < strlen(s); ++i) { if (s[i] == ' ') s[i + 1] -= 32; } puts(s);原创 2021-02-03 16:56:03 · 67 阅读 · 0 评论 -
杭电2023 求平均成绩
C#include <stdio.h>int main(){ int n, m; while (scanf("%d %d", &n, &m) != EOF) { double s[n][m]; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { scanf("%lf", &s[i][原创 2021-02-02 21:58:54 · 82 阅读 · 0 评论 -
杭电2022 海选女主角
C#include <stdio.h>#include <stdlib.h>int main(){ int n, m; while (scanf("%d %d", &n, &m) != EOF) { int p[n][m]; int a, b; int score; int max = 0; for (int i = 0; i < n; ++i) {原创 2021-02-02 18:52:21 · 108 阅读 · 0 评论 -
杭电2021 发工资咯:)
C#include <stdio.h>int main(){ int n; while (scanf("%d", &n) && n) { int g[n]; int sum = 0; for (int i = 0; i < n; ++i) { scanf("%d", &g[i]); int a = g[i] / 100;原创 2021-02-02 17:16:16 · 69 阅读 · 0 评论 -
杭电2020 绝对值排序
C#include <stdio.h>#include <stdlib.h>int main(){ int n; while (scanf("%d", &n) && n) { int a[n]; for (int i = 0; i < n; ++i) { scanf("%d", &a[i]); } for (int i = 0; i原创 2021-02-02 17:03:49 · 84 阅读 · 0 评论 -
杭电2018 母牛的故事
C#include <stdio.h>int main(){ int n; while (scanf("%d", &n) && n) { int year_1, year_2, year_3, year_4; year_1 = year_2 = year_3 = 0; year_4 = 1; for (int i = 0; i < n; ++i) {原创 2021-02-02 13:54:20 · 63 阅读 · 0 评论 -
杭电2017 字符串统计
C#include <stdio.h>#include <string.h>int main(){ int n; char a[10000]; scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%s", a); int sum = 0; for (int j = 0; j < strlen(a); ++j) {原创 2021-02-02 12:10:10 · 105 阅读 · 0 评论 -
杭电2016 数据的交换输出
C#include <stdio.h>int main(){ int n; while (scanf("%d", &n) && n) { int a[n]; int min = 2147483647; int flag; for (int i = 0; i < n; ++i) { scanf("%d", &a[i]);原创 2021-02-02 11:15:38 · 78 阅读 · 0 评论 -
杭电2015 偶数求和
C#include <stdio.h>int main(){ int n, m; while (scanf("%d %d", &n, &m) != EOF) { int a[n]; for (int i = 0; i < n / m; ++i) { int sum = 0; for (int j = i * m; j < (i + 1) *原创 2021-02-02 11:00:54 · 64 阅读 · 0 评论 -
杭电2014 青年歌手大奖赛_评委会打分
C#include <stdio.h>int main(){ int p; while (scanf("%d", &p) != EOF) { double s[p]; double sum = 0; for (int i = 0; i < p; ++i) { scanf("%lf", &s[i]); sum += s[i]; }原创 2021-02-01 21:39:56 · 82 阅读 · 0 评论 -
杭电2013 蟠桃记
C#include <stdio.h>int main(){ int day; while (scanf("%d", &day) != EOF) { int num = 1; for (int i = 1; i < day; ++i) { num = (num + 1) * 2; } printf("%d\n", num); } return 0;原创 2021-02-01 21:27:17 · 86 阅读 · 0 评论 -
杭电2011 多项式求和
C#include <stdio.h>int main(){ int m; while (scanf("%d", &m) != EOF) { int num; for (int i = 0; i < m; i++) { double sum = 0; scanf("%d", &num); for (int j = 1; j <=原创 2021-02-01 19:07:33 · 62 阅读 · 0 评论 -
杭电2012 素数判定
C#include <stdio.h>int main(){ int x, y; while (scanf("%d %d", &x, &y) && (x || y)) { int flag = 0; for (int i = x; i <= y; i++) { int f = i * i + i + 41; for (int j =原创 2021-02-01 19:37:26 · 52 阅读 · 0 评论