yyd_s的博客

#include<iostream> #include<algorithm> #include<vector> #include<string> using namespace std; struct student { string bh;// int sr; int r;// int nr;// int s;// }te; int n, k, sp = 0; vector<student>t, sum;.

#include<iostream> #include<vector> #include<string> #include<algorithm> using namespace std; string n; int k, t = 0; vector<int>a; bool ispalindromic(vector<int>num) { int i; for (i = 0; 2 * i <= num.size() .

#include<iostream> #include<vector> #include<string> using namespace std; int book[10] = { 0 }; bool isdifferent(vector<int>n) { int i, b[10] = { 0 }; for (i = 0; i <= n.size() - 1; i++) b[n[i]]++; for (i = 0.

#include<iostream> #include<algorithm> #include<vector> #include<string> using namespace std; int n, m; vector<vector<string>>b; bool cmp(vector<string>a, vector<string>b) { return a[0] < b[0]; } int .

DFS+BFS: #include<iostream> #include<queue> #include<vector> using namespace std; int n; vector<int>u,v,f,ne; vector<bool>book; vector<int>ml; int c = 0, mle=0; void cbfs(int bh) { c++; int i; queue<int>r; r.

#include<iostream> #include<vector> using namespace std; int n,radix; vector<int>num; bool cheak=true; void toradix(int n,int radix){ int r=n%radix; if(n>=radix) toradix(n/radix,radix); num.push_back(r); return.

#include<iostream> #include<vector> #define inf 0x3fffffff using namespace std; int c, n, sp, m; vector<int>nb; vector<vector<int>> e; vector<int>road; vector<bool>book; vector<int>city; int mt = inf,mnb = i.

#include<iostream> #include<stdio.h> #include<queue> using namespace std; struct people { int needtime; int sumtime; friend bool operator<(people a, people b) { return a.sumtime > b.sumtime; } }t; int main().

#include<stdio.h> #include<vector> #include<string> #include<map> #include<iostream> #include<algorithm> using namespace std; struct node { string name; int month, day, hour, minute, time, status; }; bool cmp(node x, .

#include<stdio.h> #include<vector> using namespace std; vector<int>mid; bool isprime(int x) { int i; if(x<2) return false; for (i = 2; i * i <= x; i++) if (x % i == 0) return false; return true; } int todemical(.

include<stdio.h> #include<vector> #include<queue> #define inf 0x7fffffff using namespace std; struct node { int poptime=0; int endtime=0; queue<int>p; }; int main() { int n, m, k, q, i, j,index=1,min,bh,w; scanf("%d%d%d%d", &a.

部分正确，只适用于全部联通的图： #include<iostream> #include<vector> using namespace std; int main() { int N, M, K,i,a,b,w,e,j=0,r,need; cin >> N >> M >> K; vector<int>u, v,ne,first(N+1, -1); if (N == 1) { cout << "0" &

#include<stdio.h> #include<vector> #include<algorithm> using namespace std; int N, M; vector<int>c, m, e, a, cc, mm, ee, aa, bh;//排序时acme int sear(int cj, vector<int> f) { int left, right, mid; left = 0; right = f.

#include<iostream> #include<stdio.h> using namespace std; int main(){ int i,j; double r=1.0,w,t,l,max; for(i=1;i<=3;i++){ max=0; cin>>w>>t>>l; if(max<w) max=w; if(.

#include<iostream> #include<string> #include<stdio.h> #include<ctype.h> #include<math.h> using namespace std; int tonum(char c) { if (isdigit(c)) return c - '0'; if (isalpha(c)) return c - 'a' + 10; } .

#include<iostream> #include<stdio.h> #include<vector> using namespace std; struct polynomial { int e;//指数 double c;//系数 }t; int main() { int A, B, i, j, k = 0; double r[2010] = { 0.0 }; vector<polynomial>a, b; .

#include<iostream> #include<vector> using namespace std; int time(int x,int y){ if(x>y) return 4*(x-y); if(x==y) return 0; if(x<y) return 6*(y-x); } int main(){ int i,n,t; vector<int>floo.

#include <iostream> #include <vector> #include <cstdio> using namespace std; int main() { int n; cin >> n; vector<int> arr(n); int sum=-1;//最大连续子序列和 int tempsum=0;//临时的连续子序列和 int left=0;//最大子序列左下标 .

#include<stdio.h> #include<algorithm> #include<vector> #include<string.h> using namespace std; struct people { char name[16]; int in; int out; }t; int main() { vector<people>s; int a, b, c, d, e, f, i, j,m.

#include<stdio.h> #include<string.h> #include<math.h> int main() { char num[105], spell[10][6] = { "zero", "one","two","three","four","five","six","seven","eight","nine" }; int sum = 0, i, t = 0, s[4]; scanf("%s", num); for (i = 0; i.

#include<iostream> using namespace std; struct people { int father; bool ch; int level; }s[110]; int main() { int n, m, i, j, k, sp[110] = { 0 }; cin >> n >> m; for (i = 1; i <= n; i++) s[i].ch = false; for (i = 1; i <= m.

Dijkstra： #include<stdio.h> int n, m, e[510][510] = { 0 }, c1, c2, inf = 99999999, p[510]; int main(void) { int i, j,a, b, c; scanf("%d%d%d%d", &n, &m, &c1, &c2); for (i = 0; i <= n - 1; i++) for (j = 0; j <= n - 1; j++).

#include<stdio.h> #include<vector> using namespace std; struct pol { int z; double x; }; struct pol num[30]; void quicksort(int left,int right) { int i, j; struct pol t,l; if (left > right) return; l = num[left]; i = left; j = rig.

#include <stdio.h> #include <math.h> int main(void) { int i, book = 1, j, t; int num[200]; long a, b, c; scanf("%ld%ld", &a, &b); if (a + b < 0) book = 0; c = abs(a + b); i = t = 0; if (!c) { printf("0"); return 0; } .