「已注销」-CSDN博客

原创洛谷P1498 南蛮图腾进阶解法

#include<iostream>#include<cmath>using namespace std;int n;string g[1025], str0 = " /\\ ", str1 = "/__\\";int main(){ g[0] = str0; g[1] = str1; cin >> n; for (int i = 1; i < n; i++) { int k = pow(2, i); for (int j = k;

2021-04-25 16:28:50 119

原创洛谷P1044 [NOIP2003 普及组] 栈进阶解法

#include<iostream>using namespace std;unsigned long long a = 2;int n;int main(){ cin >> n; for (int i = 2 * n - 1, j = n - 1;;) { if (0 == j && n == i) { cout << a / (n + 1); break; } else if (j > 0 &amp

2021-04-25 13:06:08 179

原创洛谷P1255 数楼梯进阶解法

#include<iostream>#include<cstring>using namespace std;int N;int f[5005][2000];void accu_add(int a, int b, int c){ int temp; for (int i = 0; i < 2000; i++) { temp = f[b][i] + f[c][i] + f[a][i]; f[a][i] = temp % 10; f[a][i +

2021-04-24 21:24:21 133

原创洛谷P1478 陶陶摘苹果（升级版）进阶解法

#include<iostream>#include<algorithm>using namespace std;int n, s, a, b;struct Apple{ int x, y;}apple[5005];bool compare(const Apple& a, const Apple& b){ return a.y < b.y;}int main(){ int i, j; Apple temp; cin >

2021-04-24 12:52:33 258

原创洛谷P3817 小A的糖果进阶解法

#include<iostream>using namespace std;long long a[100005], x, s;int n;int main(){ cin >> n >> x; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { if (a[i] + a[i - 1] > x) if (x - a[i

2021-04-24 09:43:20 166

原创洛谷P1143 进制转换进阶解法

#include<iostream>#include<cmath>using namespace std;int n, m;long long num;string str, str2;void change_n_to_10(long long& num, string& str){ int len = str.length(); for (int i = 0; i < len; i++) switch (str[i]) { c

2021-04-22 16:52:58 272

原创洛谷P4715 【深基16.例1】淘汰赛进阶解法

#include<iostream>using namespace std;int n;struct Team{ int sequence; int capability;}a[8][130];int main(){ cin >> n; int m = 1 << n; for (int i = 0; i < m; i++) { cin >> a[0][i].capability; a[0][i].sequence =

2021-04-21 19:41:05 210

原创洛谷P1457 [USACO2.1]城堡 The Castle进阶解法

#include<iostream>#include<algorithm>using std::cout;using std::cin;using std::endl;struct Room{ bool west, north, east, south; int number;} room[52][52];struct Break{ int size, row, column; char location;}breakwall[10005];int

2021-04-21 16:23:26 509

原创洛谷P1010 [NOIP1998 普及组] 幂次方进阶解法

#include<iostream>#include<string>#include<cmath>using namespace std;int n;string trans(int n){ string s; int m = n; for (; m != 0;) { int i; for (i = 0; pow(2, i) <= m; i++) {} if (1 == i) s += "+2(0)"; else if

2021-04-20 08:54:57 319

原创洛谷P3612 [USACO17JAN]Secret Cow Code S进阶解法

#include<iostream>using namespace std;long long N;string s;char find(string& s, long long& N){ long long l = s.length(); for (; l < N; l *= 2) { } for (;;) if (N <= s.length()) return s[N - 1]; else { if (N >

2021-04-19 19:22:51 198

原创洛谷P3954 [NOIP2017 普及组] 成绩进阶解法

#include<iostream>using namespace std;int A, B, C;int main(){ cin >> A >> B >> C; cout << 0.2 * A + 0.3 * B + 0.5 * C; return 0;}

2021-04-18 17:22:12 348

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

原创洛谷P1551 亲戚经典解法

#include<stdio.h>#include<stdlib.h>int main(void){ int N, M, i, j, k = 1, s, t, P; scanf("%d%d%d", &N, &M, &P); int* p = (int*)calloc(N + 1, sizeof(int)); for (i = 0; i < M; i++) { scanf("%d%d", &s, &t); if (*

2021-04-15 10:17:40 182

原创洛谷P1223 排队接水进阶解法

#include<iostream>#include<algorithm>#include<iomanip>using namespace std;int n;struct people{ int num; int time;}a[1000];bool compare(const people& a, const people& b){ return a.time < b.time;}int main(){ un

2021-04-14 19:56:32 125

原创洛谷P1002 [NOIP2002 普及组] 过河卒进阶解法

#include<iostream>using namespace std;int xb, yb, xh, yh;unsigned long long a[21][21];void supercount(int xa, int ya){ if (xb == xa && yb == ya) a[xa][ya] = 1; else if (xa == xh && ya == yh || xa == xh - 2 && ya =

2021-04-14 12:59:08 191

原创洛谷P1102 A-B 数对进阶解法

#include<cstdio>#include<algorithm>const int MAX = 200001;int N, C;int arr[MAX];inline int quickread() { int x = 0, sign = 0; char c = getchar(); while (c < '0' || c > '9') { if ('-' == c) { sign = 1; } c = getchar();

2021-04-12 20:05:34 125

原创洛谷P3156 【深基15.例1】询问学号高级解法

import java.util.*;import java.io.*;//Warning!If you use Java to submit, you will get an MLE!public class Main { static int[] a=new int[2000000]; static int[] b=new int[100000]; static int n,m; public static void main(String[] args)

2021-04-11 21:06:10 589 3

原创洛谷P2249 【深基13.例1】查找进阶解法

#include<iostream>#include<vector>using namespace std;int n, m;vector<long long>a(1000000, 0);long long q;int binarysearch(int begin, int end){ if (begin > end) return EOF; int mid = (begin + end) / 2; if (q == a[mid] &am

2021-04-11 18:49:08 231

原创洛谷P2089 烤鸡进阶解法

#include<iostream>using namespace std;int n, a[10] = { 1,1,1,1,1,1,1,1,1,1 };void season(int n, int m, int l){ if (9 == l && 1 == m && n >= 1 && n <= 3) { a[9] += n - m; for (int i = 0; i < 10; i++) cou

2021-04-09 20:02:51 269

原创洛谷P2241 统计方形（数据加强版）进阶解法

#include<iostream>using namespace std;long long n, m, s, r;int main(){ cin >> n >> m; for (int i = 0; i < min(n, m); i++) s += (n - i) * (m - i); r = (m + 1) * (n + 1) * m * n / 4 - s; cout << s << ' ' <&lt

2021-04-09 19:03:05 112

原创洛谷P1045 [NOIP2003 普及组] 麦森数进阶解法

#include<iostream>#include<cstdio>#include<cmath>using namespace std;int p, a[101], temp;void accupower_2(int n){ int j; for (int i = 0; i < n; i++) { for (j = 0; j < 100; j++) { a[j] = 2 * a[j] + temp; temp = a

2021-04-09 10:28:22 139

原创洛谷P1923 【深基9.例4】求第 k 小的数进阶解法

#include<cstdio>int n, k;long long a[5000001];long long quickfind(int low, int high, int number){ if (low == high) return a[low]; int i = low, j = high + 1; long long key = a[low], temp; for (;;) { for (; a[++i] < key;) if (i ==

2021-04-08 21:15:51 213

原创洛谷P5143 攀爬者进阶解法

#include<iostream>#include<algorithm>#include<cmath>#include<iomanip>using namespace std;int N;struct Coordinate{ int x; int y; int z;}coordinate[50000];bool compare(const Coordinate& a, const Coordinate& b){

2021-04-08 17:40:19 492

原创洛谷P1093 [NOIP2007 普及组] 奖学金进阶解法

#include<iostream>#include<algorithm>using namespace std;int n;struct Student{ int studycode; int Chinese; int total;}student[300];bool compare(const Student& a, const Student& b){ if (a.total > b.total) return true;

2021-04-08 16:34:32 314

原创洛谷P1012 [NOIP1998 提高组] 拼数进阶解法

#include<iostream>#include<algorithm>#include<string>using namespace std;int n;string a[20];bool compare(const string& a, const string& b){ int s_a = a.length(), s_b = b.length(); for (int i = 0; i < min(s_a, s_b); i

2021-04-08 16:23:01 83

原创洛谷P1104 生日进阶解法

#include<iostream>#include<algorithm>#include<string>using namespace std;struct Person{ int code; string name; string birthday;}person[100];int n;bool compare(const Person& a, const Person& b){ if (a.birthday < b

2021-04-07 20:34:09 222

原创洛谷P1781 宇宙总统进阶解法

#include<iostream>#include<algorithm>#include<cstring>using namespace std;int n;struct Ticket{ int code; char vituralnumber[102]; char number[102];}ticket[20];bool compare(const Ticket& a, const Ticket& b){ if (strc

2021-04-07 20:15:06 126

原创洛谷P1068 [NOIP2009 普及组] 分数线划定进阶解法

#include<iostream>#include<algorithm>#include<cmath>using namespace std;int n, m;pair<int, int> candidate[5000];bool compare(const pair<int, int>& a, const pair<int, int>& b){ if (a.second > b.second

2021-04-06 12:52:04 170

原创洛谷P1152 欢乐的跳进阶解法

#include<iostream>#include<algorithm>using namespace std;int n;long long a[1000], b[1000];int main(){ cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n - 1; i++) { b[i] = a[i + 1] - a[i];

2021-04-06 09:57:00 206

原创洛谷P1116 车厢重组进阶解法

#include<iostream>using namespace std;int N, a[10000], s;int main(){ cin >> N; for (int i = 0; i < N; i++) cin >> a[i]; for (int i = 0; i < N; i++) for (int j = i + 1; j < N; j++) if (a[i] > a[j]) s++; cou

2021-04-06 08:46:16 183

原创洛谷P2676 [USACO07DEC]Bookshelf B进阶解法

#include<iostream>#include<algorithm>using namespace std;int N, H[20000];long long S, B;int main(){ int j = 0; cin >> N >> B; for (int i = 0; i < N; i++) cin >> H[i]; sort(H, H + N); for (int i = N - 1; i &gt

2021-04-06 08:35:57 360

原创洛谷P1059 [NOIP2006 普及组] 明明的随机数进阶解法

#include<iostream>#include<algorithm>using namespace std;int N, M, a[100];int main(){ int i, j, k; cin >> N; for (i = 0; i < N; i++) cin >> a[i]; sort(a, a + N); for (i = 1, j = 1, k = a[0]; i < N; i++) if (a[i

2021-04-05 19:53:21 175

原创洛谷P1177 【模板】快速排序进阶解法

#include<iostream>using namespace std;int N;long long a[100001];void pseudoquicksort(long long a[], int low, int high){ long i = low, j = high + 1, temp, standard = a[low]; if (high <= low) return; for (;;) { for (; a[++i] < stan

2021-04-05 19:52:54 116

原创洛谷P1271 【深基9.例1】选举学生会进阶解法

#include<iostream>#include<algorithm>const int MAX = 2000000;using namespace std;int n, m,ticket[MAX];int main(){ cin >> n >> m; for (int i = 0; i < m; i++) cin >> ticket[i]; sort(ticket, ticket + m); for(int

2021-04-05 19:50:25 298

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

原创洛谷P1786 帮贡排序进阶解法

#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 273

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

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

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

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

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

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

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

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

空空如也