程序设计代码共享
一个好的专栏一般不需要太多介绍。
「已注销」
这个作者很懒,什么都没留下…
展开
-
UVA748 Exponentiation进阶解法
#include<cstdio>#include<cstring>const int LENGTH = 701;char F[10];int n, base_number[LENGTH], power_number[LENGTH], temp_power_number[LENGTH], bit, length;void transfer(void)//It's a function to refine input to get the non-demical part原创 2021-05-25 21:25:42 · 113 阅读 · 0 评论 -
洛谷P5744 【深基7.习9】培训进阶解法
#include<iostream>#include<stdlib.h>using namespace std;int n;struct Student{ char name[100]; int age; int grade;};void study(struct Student* p) { int i; for (i = 0; i < n; i++) { ((p + i)->age)++; if (((p + i)->grade) *原创 2021-03-01 12:31:32 · 667 阅读 · 0 评论 -
洛谷P5743 【深基7.习8】猴子吃桃进阶解法
#include<iostream>using namespace std;int day(int n) { if (n == 1) return(1); else return((day(n - 1) + 1) * 2);}int main() { int n; cin >> n; cout << day(n) << endl; return(0);}原创 2021-03-01 12:31:00 · 439 阅读 · 0 评论 -
洛谷P5742 【深基7.例11】评等级经典解法
#include<stdio.h>#include<stdlib.h>struct Student { int studycode; int subjectgrade; int advancedgrade; int totalgrade; double generalgrade;};void examine(struct Student*p) { if (p->generalgrade > 80 && p->totalgrade原创 2021-03-01 12:26:57 · 1295 阅读 · 0 评论 -
洛谷P5741 【深基7.例10】旗鼓相当的对手 - 加强版经典解法
#include<stdio.h>#include<stdlib.h>#include<string.h>struct Student{ char name[9]; int chinese; int math; int english; int total;};int main(void) { int N, i, j; scanf("%d", &N); struct Student temp, * p = (struct Student*原创 2021-03-01 12:26:27 · 2368 阅读 · 1 评论 -
洛谷P5740 【深基7.例9】最厉害的学生经典解法
#include<stdio.h>#include<stdlib.h>struct Student{ char name[9]; int chinese; int math; int english; int total;};int main() { int N, i; scanf("%d", &N); struct Student temp,* p = (struct Student*)calloc(N, sizeof(struct Student原创 2021-03-01 12:25:56 · 800 阅读 · 0 评论 -
洛谷P5739 【深基7.例7】计算阶乘经典解法
#include<stdio.h>long long f(long long n) { long long s; if (n == 0) return(1); else { s = n * f(n - 1); return(s); }}int main(void) { long long n,s; scanf("%lld", &n); s = f(n); printf("%lld", s); return(0);}原创 2021-02-28 21:15:36 · 438 阅读 · 0 评论 -
洛谷P5738 【深基7.例4】歌唱比赛经典解法
#include<stdio.h>int a[101][21], n, m;double b[101];double Min(int* p) { int i, s; for (i = 0, s = *p; i < m; i++) if (*(p + i) < s) s = *(p + i); return((double)s);}double Max(int* p) { int i; int s; for (i = 0, s = *p; i <原创 2021-02-28 21:15:06 · 810 阅读 · 0 评论 -
洛谷P5737 【深基7.例3】闰年展示经典解法
#include<stdio.h>int a[2000];int year(int n) { if (n % 400 == 0 || (n % 4 == 0 && n % 100 != 0)) return(1); else return(0);}int main() { int x, y, i, j; scanf("%d%d", &x, &y); for(i=x,j=0;i<=y;i++) if (year(i) == 1)原创 2021-02-28 21:14:19 · 384 阅读 · 0 评论 -
洛谷P5736 【深基7.例2】质数筛经典解法
#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>int a[10000];int prime(void) { int i, j, k, p; a[0] = 2; for (i = 3,j=1; i < 100000;i+=2 ) { p = (int)pow(i, 0.5); for (k = 3; k <=p; k += 2)原创 2021-02-28 21:13:49 · 450 阅读 · 0 评论 -
洛谷P5735 【深基7.例1】距离函数经典解法
#include<stdio.h>#include<math.h>double d(double x1, double y1,double x2,double y2) { return(pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 0.5));}int main(void) { double dis, x1, x2, x3, y1, y2, y3; scanf("%lf%lf%lf%lf%lf%lf", &x1, &y1,原创 2021-02-28 21:13:18 · 761 阅读 · 0 评论 -
洛谷P5734 【深基6.例6】文字处理软件经典解法
#include<stdio.h>#include<string.h>int main(void){ int n, i, x, y, j, z; char a[101], temp[100],temp2[100]; scanf("%d", &n); scanf("%s", a); for (i = 0; i < n; i++) { scanf("%d", &z); if (1 == z) { scanf("%s", temp)原创 2021-02-27 07:02:57 · 373 阅读 · 0 评论 -
洛谷P5733 【深基6.例1】自动修正经典解法
#include<stdio.h>#include<string.h>char a[101];int main(void){ int i; scanf("%s", a); for (i = 0; i < strlen(a); i++) if (a[i] >= 97 && a[i] <= 122) a[i] -= 32; printf("%s", a); return(0);}原创 2021-02-27 06:58:19 · 1254 阅读 · 0 评论 -
洛谷P5732 【深基5.习7】杨辉三角经典解法
#include<stdio.h>int a[21][21];int main(void){ int i, n, j; scanf("%d", &n); for (i = 1; i <= n; i++) { a[i][1] = a[i][i] = 1; } for (i = 1; i <= n; i++) { for (j = 2; j < i;j++) { a[i][j] = a[i - 1][j - 1] + a[i - 1][原创 2021-03-04 14:45:15 · 369 阅读 · 1 评论 -
洛谷P5731 【深基5.习6】蛇形方阵经典解法
#include<stdio.h>int main(void){ int n; scanf("%d", &n); switch (n) { case(1):printf(" 1"); break; case(2):printf(" 1 2\n"); printf(" 4 3\n"); break; case(3):printf(" 1 2 3\n"); printf(" 8 9 4\n"); printf(" 7 6 5\n原创 2021-03-04 14:44:21 · 777 阅读 · 1 评论 -
洛谷P5730 【深基5.例10】显示屏经典解法
#include<stdio.h>int main(void){ int n, i; char a[10][4] = { {"XXX"}, { "..X"},{"XXX"}, {"XXX"},{"X.X"},{"XXX"},{"XXX"},{"XXX"},{"XXX"},{"XXX"}}; char b[10][4] = { {"X.X"}, { "..X"},{"..X"}, {"..X"},{"X.X"},{"X.."},{"X.."},{"..X"},{"X.X"},{"X.X"原创 2021-02-26 08:29:16 · 850 阅读 · 4 评论 -
洛谷P5729 【深基5.例7】工艺品制作经典解法
#include<stdio.h>#include<stdlib.h>int main(void){ int w, x, h, q, i, j, k, x1, x2, y1, y2, z1, z2, a, b=0; scanf("%d%d%d", &w, &x, &h); int * p = (int*)calloc(w * x * h, sizeof( int)); scanf("%d", &q); for (a = 0; a <原创 2021-02-26 08:27:41 · 817 阅读 · 0 评论 -
洛谷P5728 【深基5.例5】旗鼓相当的对手经典解法
#include<stdio.h>#include<stdlib.h>struct Student{ int chinese; int math; int english; int total;};int main(void){ int N, i, m=0, j; scanf("%d", &N); struct Student* p = (struct Student*)calloc(N,sizeof( struct Student)); for原创 2021-02-26 08:27:18 · 1155 阅读 · 0 评论 -
洛谷P5727 【深基5.例3】冰雹猜想经典解法
#include<stdio.h>int a[1000000];int main(void){ int n, i; scanf("%d", &n); for (i=0; n != 1;i++) { if (n % 2 == 0) { a[i] = n; n /= 2; } else { a[i] = n; n = 3 * n + 1; } } a[i] = 1; for (; i >= 0; i--) { p原创 2021-02-26 08:24:42 · 329 阅读 · 0 评论 -
洛谷P5726 【深基4.习9】打分经典解法
#include<stdio.h>#include<stdlib.h>int Max(int* p, int n){ int i, m; for (i = 0, m = *p; i < n; i++) { if (m < *(p + i)) { m = *(p + i); } } return(m);}int Min(int* p, int n){ int i, m; for (i = 0, m = *p; i < n;原创 2021-02-25 07:24:36 · 637 阅读 · 0 评论 -
洛谷P5725 【深基4.习8】求三角形经典解法
#include<stdio.h>int main(void){ int n, i, j, k; scanf("%d", &n); for (i = 1,k=1; i <= n; i++) { for (j = 1; j <= n; j++,k++) { printf("%02d", k); } printf("\n"); } printf("\n"); for (i = 1, k = 1; i <= n; i++) { f原创 2021-02-25 07:24:02 · 787 阅读 · 0 评论 -
洛谷P5724 【深基4.习5】求极差经典解法
#include<stdio.h>#include<stdlib.h>int Max(int* p, int n){ int m = *p, i; for (i = 0; i < n; i ++) { if (*(p + i) > m) { m = *(p + i); } } return(m);}int Min(int* p, int n){ int m = *p, i; for (i = 0; i < n; i ++)原创 2021-02-25 07:21:01 · 915 阅读 · 1 评论 -
洛谷P5723 【深基4.例13】质数口袋经典解法
#include<stdio.h>#include<math.h>int a[1000];int main(void){ int find(int); void sort(void); sort(); int L, i,j=0, s=0; scanf("%d", &L); for (i=2;;i++) { if (s+i > L) { break; } if (find(i)==1) { s+=i; j++;原创 2021-02-24 08:14:47 · 747 阅读 · 0 评论 -
洛谷P5722 【深基4.例11】数列求和经典解法
#include<stdio.h>int main(void){ int n, i, s=0; scanf("%d", &n); for (i = 1; i <= n; i++) { s += i; } printf("%d", s);}原创 2021-02-24 08:14:16 · 337 阅读 · 0 评论 -
洛谷P5721 【深基4.例6】数字直角三角形经典解法
#include<stdio.h>int main(void){ int n, i, j, k; scanf("%d", &n); for (i = 1,k=1; i <= n; i++) { for (j = 1; j <= n - i+1; j++,k++) { if (k < 10) { printf("0"); printf("%d", k); } else { printf("%d",原创 2021-02-24 08:10:57 · 331 阅读 · 0 评论 -
洛谷P5720 【深基4.例4】一尺之棰经典解法
#include<stdio.h>int main(void){ int a, d; scanf("%d", &a); for (d = 0; a != 1; d++) { a /= 2; } printf("%d", d+1); return(0);}原创 2021-02-24 08:07:52 · 647 阅读 · 0 评论 -
洛谷P5719 【深基4.例3】分类平均经典解法
#include<stdio.h>int main(void){ int n, k, i, s, t,x,y; scanf("%d%d", &n, &k); for (i = 1, s = 0, t = 0,x=0,y=0; i <= n; i++) { if (i % k == 0) { s += i; x++; } else { t += i; y++; } } printf("%.1f %.1f", ((原创 2021-02-24 08:07:37 · 541 阅读 · 0 评论 -
洛谷P5718 【深基4.例2】找最小值经典解法
#include<stdio.h>#include<stdlib.h>#define min(a,b) (a<b? a:b)int main(void){ int n, i, s=10000; scanf("%d", &n); int* p = (int*)malloc(n * sizeof(int)); for (i = 0; i < n; i++) { scanf("%d", p + i); s = min(s, *(p + i));原创 2021-02-23 09:04:32 · 885 阅读 · 0 评论 -
洛谷P5717 【深基3.习8】三角形分类经典解法
#include<stdio.h>#define max(a,b) (a>b? a:b)#define min(a,b) (a<b? a:b)int main(void){ int a, b, c, x, y, z; scanf("%d%d%d", &a, &b, &c); x = max(max(a, b), c); z = min(min(a, b), c); y = a + b + c - x - z; if (y + z <原创 2021-02-23 08:41:57 · 676 阅读 · 0 评论 -
洛谷P5716 【深基3.例9】月份天数经典解法
#include<stdio.h>int main(void){ int year, month; scanf("%d%d", &year, &month); if ((year % 400 == 0) || ((year % 100 != 0) && (year % 4 == 0))) { switch (month) { case(1):printf("31"); break; case(2):printf("29"); break原创 2021-02-22 08:13:19 · 452 阅读 · 0 评论 -
洛谷P5715 【深基3.例8】三位数排序经典解法
#include<stdio.h>int main(void){ int a, b, c, d; scanf("%d%d%d", &a, &b, &c); if (a > b) { d = a; a = b; b = d; } if (a > c) { d = a; a = c; c = d; } if (b > c) { d = b; b = c; c = d; } printf("%d原创 2021-02-22 08:12:45 · 493 阅读 · 0 评论 -
洛谷P5714 【深基3.例7】肥胖问题经典解法
#include<stdio.h>#include<math.h>int main(void){ double m, h, BMI; void sudoprint(double); scanf("%lf%lf", &m, &h); BMI = m / pow(h, 2); if (BMI < 18.5) { printf("Underweight"); } else { if (BMI >= 18.5 &&原创 2021-02-22 08:12:11 · 830 阅读 · 1 评论 -
洛谷P5713 【深基3.例5】洛谷团队系统经典解法
#include<stdio.h>int main(void){ int n; scanf("%d", &n); if (5 * n < 11 + 3 * n) { printf("Local"); } else { printf("Luogu"); } return(0);}原创 2021-02-22 08:09:40 · 388 阅读 · 0 评论 -
洛谷P5712 【深基3.例4】Apples经典解法
#include<stdio.h>int main(void){ int n; scanf("%d", &n); if (n > 1) { printf("Today, I ate %d apples.", n); } else { printf("Today, I ate %d apple.", n); } return(0);}原创 2021-02-22 08:09:04 · 545 阅读 · 0 评论 -
洛谷P5711 【深基3.例3】闰年判断经典解法
#include<stdio.h>int main(void){ int n; scanf("%d", &n); if ((n % 400 == 0) || ((n % 4 == 0) && (n % 100 != 0))) { printf("1"); } else { printf("0"); } return(0);}原创 2021-02-22 08:08:33 · 589 阅读 · 0 评论 -
洛谷P5710 【深基3.例2】数的性质经典解法
#include<stdio.h>int main(void){ int n; scanf("%d", &n); printf("%d ", ((n % 2 == 0) && (n > 4) && (n <= 12)) ? 1: 0); printf("%d ", ((n % 2 == 0) || (n > 4) && (n <= 12)) ? 1: 0); printf("%d ", ((n % 2原创 2021-02-22 08:08:00 · 290 阅读 · 0 评论 -
洛谷P5709 【深基2.习6】Apples Prologue经典解法
#include<stdio.h>int main(void){ int m, s, t; scanf("%d%d%d", &m, &t, &s); if (t == 0) { printf("0"); } else { if (m - s / t >= 0) { if (s % t == 0) { printf("%d", m - s / t); } else { printf("%d",原创 2021-02-22 08:05:13 · 291 阅读 · 0 评论 -
洛谷P5708 【深基2.习2】三角形面积经典解法
#include<stdio.h>#include<math.h>int main(void){ double a, b, c, p, s; scanf("%lf%lf%lf",&a, &b, &c); p = (a + b + c) / 2; printf("%.1lf", pow((p * (p - a) * (p - b) * (p - c)), 0.5)); return(0);}原创 2021-02-21 20:05:05 · 245 阅读 · 0 评论 -
洛谷P5707 【深基2.例12】上学迟到进阶解法
#include<cstdio>#include<cmath>using namespace std;int s, v;int main(){ int min, hour; scanf("%d%d", &s, &v); min = ceilf(double(s) / v + 10); hour = 7 - min / 60; if (hour < 0) hour += 24; min %= 60; min = 60 - min;原创 2021-04-18 17:15:04 · 1416 阅读 · 1 评论 -
洛谷P5706 【深基2.例8】再分肥宅水经典解法
#include<stdio.h>int main(void){ int n; float t; scanf("%f%d", &t, &n); printf("%.3f\n%d", t / n, 2 * n); return(0);}原创 2021-02-21 20:02:09 · 521 阅读 · 0 评论