2021年03月_GoldenLegendary

原创洛谷P1591 阶乘数码进阶解法

#include<iostream>#include<cmath>#include<cstring>using namespace std;int x, a, b, j;void start(void){ cin >> x;}void input(int& a, int& b){ cin >> a >> b;}void hiaccumulti(int& i ,int& c

2021-03-21 14:32:03 143

#include<iostream>#include<string>using namespace std;int n;string a[7] = { "BangZhu","FuBangZhu","HuFa","ZhangLao","TangZhu","JingYing","BangZhong" };struct Member{ string name; string postition; long long int contribution; int leve

2021-03-14 14:00:13 214

原创洛谷P1098 [NOIP2007 提高组] 字符串的展开进阶解法

#include<iostream>#include<cstdlib>using namespace std;char a[101];int p1, p2, p3;void start(void){ cin >> p1 >> p2 >> p3 >> a;}void sudoprint(char p, char q){ if(p<q) switch (p1) { case 1: for

2021-03-13 14:57:28 118

原创洛谷P1067 [NOIP2009 普及组] 多项式输出进阶解法

#include<iostream>using namespace std;int n, a[101];void start(){ cin >> n; for (int i = 0; i <= n; i++) cin >> a[i];}void show(){ if (0 == n) cout << a[0]; else for (int x = 0; x <= n; x++) if (a[x] >

2021-03-12 14:57:07 92

原创洛谷P1518 [USACO2.4]两只塔姆沃斯牛 The Tamworth Two进阶解法

#include<iostream>using namespace std;char a[12][12];int n = 1, m = 0;struct Animal{ char name; int location_x, location_y, direction;}farmer,cows;void initialize(Animal& s,char c,int i,int j){ s.name = c; s.location_x = i; s.loc

2021-03-11 20:46:16 161

原创洛谷P1328 [NOIP2014 提高组] 生活大爆炸版石头剪刀布进阶解法

#include<iostream>using namespace std;int n, a[200], b[200],na,nb,c,d;void initialize(){ int i; cin >> n >> na >> nb; for (i = 0; i < na; i++) cin >> a[i]; for (; i < n; i++) a[i] = a[i - na]; for (i = 0;

2021-03-10 19:34:39 342

原创洛谷P4924 [1007]魔法少女小Scarlet进阶解法

#include<iostream>using namespace std;int a[500][500],b[500][500], n, m;void start(void){ cin >> n >> m;}void initialize(void){ for (int i = 0, k = 1; i < n; i++) for (int j = 0; j < n; j++, k++) a[i][j]= k;}void

2021-03-09 20:15:12 150

原创洛谷P1303 A*B Problem进阶解法

#include<iostream>#include<cstring>char a1[2000], b1[2000];int a[2000], b[2000], c[2000];using namespace std;int main(){ int i, j, len1, len2, len; cin >> a1 >> b1; len1 = strlen(a1); len2 = strlen(b1); len = len1 + le

2021-03-07 15:39:33 81

原创洛谷P1601 A+B Problem（高精）进阶解法

#include<iostream>#include<cstring>using namespace std;char a[501], b[501], c[501];void sudoplus(char* p, char* q)//Add array from pointer q to array from pointer p.{ int i; for (i = 0; i < 501; i++) if (*(p + i) + *(q + i) <

2021-03-05 14:59:59 155

原创洛谷P1563 [NOIP2016 提高组] 玩具谜题进阶解法

#include<cstdio>#include<cstdlib>struct Man{ int f1; int f2; int s; char g[10];};int main(void){ int i,j,k,N, M; Man* p=(Man*)malloc(sizeof(Man)*100000); scanf("%d%d", &N, &M); for (i = 0; i < N; i++) scanf("%d%s", &a

2021-03-05 14:19:24 124

原创洛谷P2670 [NOIP2015 普及组] 扫雷游戏经典解法

#include<stdio.h>char a[101][101];int b[101][101];int main(){ int n, m, i, j; scanf("%d%d", &n, &m); for (i = 1; i < n + 1; i++) for (j = 0; j < m + 1; j++) scanf("%c", &a[i][j]); for (i = 1; i < n + 1; i++) for

2021-03-05 12:21:09 214 1

原创洛谷P1205 [USACO1.2]方块转换 Transformations经典解法

#include<stdio.h>char a[12][12], b[12][12], c[12][12], d[12][12];int n;int compare(void){ int i, j; for (i = 0; i < n; i++) for (j = 0; j < n; j++) if (c[i][j] != b[i][j]) return(0); return(1);}int operate1(void){ int i, j;

2021-03-04 14:47:34 526 2

原创洛谷P1320 压缩技术（续集版）经典解法

#include<stdio.h>#include<string.h>char a[40001] = {'\0'};int main(void){ char b, flag; int N, i, j, temp; gets(a); N = strlen(a)-1; for (i = N; i < N*N;) { b = getchar(); if (b != '\r' && b != '\n') { a[i] = b;

2021-03-04 14:46:55 621 1

原创洛谷P1319 压缩技术经典解法

#include<stdio.h>int main(void){ int N, i, j, k, flag = 0, temp; scanf("%d", &N); for (k = 0; k < N * N;) { scanf("%d", &temp); for (i = 0; i < temp; i++) { printf("%d", flag); k++; if (k % N == 0) { printf("

2021-03-04 14:46:25 654 3

原创洛谷P1789 【Mc生存】插火把经典解法

#include<stdio.h>#include<stdlib.h>#include<math.h>int main(void){ int n, m, k, i, a, b, x, y, s = 0, j; scanf("%d%d%d", &n, &m, &k); int* q = (int*)calloc((n+4) * (n+4), sizeof(int)); q = q + (n + 6); for (i = 0; i &

2021-03-04 14:45:38 596 1

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

原创洛谷P1161 开灯经典解法

#include<stdio.h>short b[2000000];int main(void){ int n, i, j, t; double a; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%lf%d", &a, &t); for (j = 1; j <= t; j++) { if (b[(int)(j * a)] == 0) { b[(int)(j

2021-03-04 14:43:26 460 3

原创洛谷P2911 [USACO08OCT]Bovine Bones G经典解法

#include<stdio.h>#include<stdlib.h>int main(void){ int s1, s2, s3, i, j, k, m, n; scanf("%d%d%d", &s1, &s2, &s3); int* p = (int*)calloc(s1 + s2 + s3+3, sizeof(int)); for (i = 1; i <= s1; i++) { for (j = 1; j <= s2; j

2021-03-04 14:42:39 421 1

原创洛谷P1614 爱与愁的心痛经典解法

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

2021-03-04 14:41:50 503 1

原创洛谷P2141 [NOIP2014 普及组] 珠心算测验经典解法

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

2021-03-04 14:40:55 348 1

原创洛谷P1042 [NOIP2003 普及组] 乒乓球进阶解法

#include<iostream>#include<cmath>#include<cstring>char c[25 * 2500];using namespace std;int main(){ int i,w1=0,l1=0,w2=0,l2=0; for (i = 0; ; i++) { cin >> c[i]; if (c[i] == 'E') break; } for (i = 0; i < strlen(

2021-03-03 08:31:20 240

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

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

原创洛谷P2415 集合求和进阶解法

#include<cstdio>#include<iostream>#include<math.h>using namespace std;int main() { long long s = 0, i = 0, n; while (cin >> n) { s += n; i++; } s *= pow(2, i - 1); cout << s << endl; return(0);}

2021-03-01 12:30:29 226

原创洛谷P1304 哥德巴赫猜想经典解法

#include<stdio.h>#include<math.h>int a[20000],N;void fill(void) { int i, j, k, s, f; a[0] = 2; for (i = 3,k=1; i < 20000; i+=2) { s = pow(i, 0.5); f = 0; for (j = 3; j <= s; j += 2) if (i % j == 0) f=1; if (f == 0) {

2021-03-01 12:29:31 560

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

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

原创洛谷P5461 赦免战俘经典解法

#include<stdio.h>#include<stdlib.h>#include<math.h>int s;void dismiss(int* p, int n) { int i, j, t= (int)pow(2, n - 1); if (n == 1) { *p = 0; *(p + 1) = *(p + s) = *(p + s + 1) = 1; } else { for (i = 0; i < t; i++) for

2021-03-01 12:25:26 233

金色传说的特级博客