2021年02月_GoldenLegendary

原创洛谷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 434

原创洛谷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 803

原创洛谷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 376

原创洛谷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 440

原创洛谷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 750

原创洛谷P1598 垂直柱状图经典解法

#include<stdio.h>#include<string.h>char a[404], a2[101], a3[101], a4[101];int c[27];int Maxc(void) { int i, temp; for (i = 0, temp = c[0]; i < 27; i++) if (c[i] > temp) temp = c[i]; return(temp);}int len(int n) { int i, m;

2021-02-28 21:11:19 281

原创洛谷P1597 语句解析经典解法

#include<stdio.h>#include<string.h>char s[256];int main(void) { int a=0, b=0, c=0, i; scanf("%s", s); for (i = 1; i < strlen(s); i+=5) if(s[i]==':') switch (s[i - 1]) { case('a'): switch (s[i + 2]) { case('a'):break;

2021-02-28 21:10:51 511

原创洛谷P1200 [USACO1.1]你的飞碟在这儿Your Ride Is Here经典解法

#include<stdio.h>#include<string.h>char a[7], b[7];int main(void) { int i, x, y; scanf("%s%s", a, b); for (i = 1, x = a[0]-64; i < strlen(a); i++) x = (x * (a[i]-64)) % 47; for (i = 1, y = b[0]-64; i < strlen(b); i++) y = (y *

2021-02-28 21:10:17 507 2

原创洛谷P1603 斯诺登的密码经典解法

#include<stdio.h>#include<string.h>char a[6][20];int b[6];int main(void) { int i, j, temp; scanf("%s %s %s %s %s %s", a[0], a[1], a[2], a[3], a[4], a[5]); for (i = 0; i < 6; i++) if (strcmp(a[i], "one")==0|| strcmp(a[i], "a")==0||

2021-02-28 21:09:03 917 1

原创洛谷P1553 数字反转（升级版）经典解法

#include<stdio.h>#include<string.h>char s[25];int l;void swap1(void) { int i; if (strcmp(s, "0") == 0) printf("0"); else { for (i = l - 1; i >= 0; i--) if (s[i] != '0') break; for (; i >= 0; i--) printf("%c", s[i]);

2021-02-28 21:07:09 430

原创洛谷P1321 单词覆盖还原经典解法

#include<stdio.h>#include<string.h>char a[256];int main(void){ int i,s, boy, girl; scanf("%s", a); s = strlen(a); for (i = 0, boy = 0; i < s;) { if (a[i] == 'b') { if (a[i + 1] == 'o') if (a[i + 2] == 'y') i += 3; el

2021-02-27 07:05:27 365 1

原创洛谷P3741 honoka的键盘经典解法

#include<stdio.h>#include<stdlib.h>#include<string.h>int find(char* p){ int i, s=0; for (i = 0; i <101; i++) if (p[ i] == 'V' && p [i + 1] == 'K') s++; return(s);}int Max(int* q){ int i, s; for (i = 0,s=q[0]; i &

2021-02-27 07:04:56 582

原创洛谷P1765 手机经典解法

#include<stdio.h>#include<string.h>int main(void){ int i, s = 0; char a[201]; gets(a); for (i = 0; i < strlen(a); i++) switch (a[i]) { case('a'): case('d'): case('g'): case('j'): case('m'): case('p'): case('t'): ca

2021-02-27 07:04:10 799 1

原创洛谷P1308 [NOIP2011 普及组] 统计单词数经典解法

#include<stdio.h>#include<string.h>char a[11], b[1000001], c[13], d[1000003];void capital(char* p){ int i, n = strlen(p); for (i = 0; i < n; i++) { if (*(p + i) >= 'a' && *(p + i) <= 'z') { (*(p + i)) -= 32; }

2021-02-27 07:03:43 381

原创洛谷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 357

原创洛谷P5015 [NOIP2018 普及组] 标题统计经典解法

#include<stdio.h>#include<string.h>int main(void){ int i, n=0; char s[16]; gets(s); for (i = 0; i < strlen(s); i++) if (s[i] != ' ' && s[i] != '\r' && s[i] != '\n') n++; printf("%d", n); return(0);}

2021-02-27 07:02:13 809

原创洛谷P1957 口算练习题经典解法

#include<stdio.h>#include<math.h>#include<string.h>char x[6], y[6], z[6];int lengthof(int n){ int s; if (n == 0) return(1); else if (n<0) { n = -n; for (s = 0; n != 0; s++) n /= 10; return(s + 1); } else { for

2021-02-27 06:59:54 438

原创洛谷P1125 [NOIP2008 提高组] 笨小猴经典解法

#include<stdio.h>#include<math.h>#include<string.h>int main(void){ int i, j, k, max, min, b[101] = { 0 }; char a[101]; scanf("%s", a); for (i = 0; i < strlen(a); i++) for (j = 0; j <= i; j++) if (a[j] == a[i]) {

2021-02-27 06:59:22 640

原创洛谷P1914 小书童——凯撒密码经典解法

#include<stdio.h>#include<string.h>int main(void){ int n, i; char a[51]; scanf("%d", &n); scanf("%s", a); for (i = 0; i < strlen(a); i++) a[i] = 97+(a[i]-97+n) % 26; printf("%s", a); return(0);}

2021-02-27 06:58:54 1225

原创洛谷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 1243

原创洛谷P1554 梦中的统计经典解法

#include<stdio.h>int main(void){ int M, N, i, a[10] = { 0 }, j, temp, k; scanf("%d%d", & M, & N); for (i = M; i <= N; i++) { k = i; for (;k!=0;) { temp = k % 10; switch (temp) { case(0):a[0]++; break; case(1):a[1

2021-02-26 08:29:47 581

原创洛谷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 842 4

原创洛谷P2615 [NOIP2015 提高组] 神奇的幻方经典解法

#include<stdio.h>#include<math.h>int a[39][39];int main(){ int t, m, i, j, k = 1, n; scanf("%d", &n); m = (n - 1) / 2; a[0][m] = 1; for (i = 0, j = m, k = 1; k <= pow(n, 2); k++) { if ((i != 0 && j != n - 1)) { i

2021-02-26 08:28:45 394

原创洛谷P2550 [AHOI2001]彩票摇奖经典解法

#include<stdio.h>#include<stdlib.h>int main(void){ int n, i, j, k, a[7] = { 0 }, b[7] = { 0 }, c[8] = { 0 }, p; scanf("%d", &n); scanf("%d%d%d%d%d%d%d", a, a + 1, a + 2, a + 3, a + 4, a + 5,a+6); for (i = 0; i < n; i++) { p = 0

2021-02-26 08:28:14 521

原创洛谷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 &lt

2021-02-26 08:27:41 808

原创洛谷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 1139

原创洛谷P1047 [NOIP2005 普及组] 校门外的树经典解法

#include<stdio.h>#include<stdlib.h>int main(void){ int l, m, i, x, y, j; scanf("%d%d", &l, &m); int* p = (int*)malloc((l+1) * sizeof(int)); for (i = 0; i <= l; i++) { *(p + i) = 1; } for (i = 0; i < m; i++) { scanf(

2021-02-26 08:25:12 541

原创洛谷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 317

原创洛谷P1427 小鱼的数字游戏经典解法

#include<stdio.h>int main(void){ int i, a[100]; for (i=0;;i++) { scanf("%d", &a[i]); if (a[i] == 0) { break; } } for (i--; i >= 0; i--) { printf("%d ", a[i]); } return(0);}

2021-02-26 08:24:10 316

原创洛谷P1428 小鱼比可爱经典解法

#include<stdio.h>#include<stdlib.h>int main(void){ int n, i, j; scanf("%d", &n); int* p = (int*)malloc(n * sizeof(int)); int* q = (int*)malloc(n * sizeof(int)); for (i = 0; i < n; i++) { scanf("%d", p + i); } for (i = 0; i &

2021-02-26 08:23:37 444

原创洛谷P1089 [NOIP2004 提高组] 津津的储蓄计划经典解法

#include<stdio.h>int main(void){ int i, deposit=0, cash=0; int a[12]; for (i = 0; i < 12; i++) { scanf("%d", &a[i]); } for (i = 0; i < 12; i++) { if (300 + cash - a[i] >= 100) { deposit += (300 + cash - a[i]) / 100 *100

2021-02-25 07:26:38 211

原创洛谷P4956 [COCI2017-2018#6] Davor经典解法

#include<stdio.h>int main(void){ int n, x, k, i, j, m; scanf("%d",&n); for (x = 100; x > 0; x--) { for (k = 1; k <= n; k++) { m = n; for (i = 0; i < 52; i++) { for (j = 0; j < 7; j++) { m -= (x + k * j)

2021-02-25 07:25:08 371

原创洛谷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 621

原创洛谷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 756

原创洛谷P1075 [NOIP2012 普及组] 质因数分解经典解法

#include<stdio.h>int main(void){ int n, i; scanf("%d", &n); if (n % 2 == 0) { printf("%d", n / 2); return(0); } else { for (i = 3;; i += 2) { if (n % i == 0) { printf("%d", n/i); return(0); } } }}

2021-02-25 07:23:31 226

原创洛谷P1420 最长连号经典解法

#include<stdio.h>#include<stdlib.h>int continuous(int* p){ int k=*p,i; for (i = 0;k==*(p+i); i++,k++) { } return(i);}int Max(int* p, int n){ int i, m=*p; for (i = 0; i < n; i++) { if (*(p + i) > m) { m = *(p + i); }

2021-02-25 07:21:31 226

原创洛谷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 910 1

原创洛谷P1720 月落乌啼算钱（斐波那契数列）经典解法

#include<stdio.h>long long a[49];long long f(int n){ if (n == 0) { return(0); } else if (n == 1) { return(1); } else { return(a[n - 1] + a[n - 2]); }}int main(void){ int i, n; for (i = 0; i < 49; i++) { a[i] = f(i); } s

2021-02-25 07:20:34 626

原创洛谷P1307 [NOIP2011 普及组] 数字反转经典解法

#include<stdio.h>int main(void){ char a[11] = { 0 }; int i, flag = 0; scanf("%s", a); if (a[0] == '-') { printf("-"); for (i = 10;i>0; i--) { if ((a[i] != '0')&&(a[i]!=0)&&(flag==0)) { flag = 1; } if (f

2021-02-25 07:19:59 354

原创洛谷P1423 小玉在游泳经典解法

#include<stdio.h>int main(void){ int i; double n, m=0, p=2; scanf("%lf", &n); for (i = 0;m<n; i++) { m += p; p *= 0.98; } printf("%d", i); return(0);}

2021-02-25 07:19:30 634

热学半开卷考试携带资料2.jpg

热学半开卷考试携带材料1.jpg

力学半开卷考试携带资料1.jpg

力学半开卷考试携带资料2.jpg

空空如也