lethegods的博客

强连通分量. 有向图强 连通分量 ：在 有向图 G中，如果两个顶点vi,vj间（vi>vj）有一条从vi到vj的有向路径，同时还有一条从vj到vi的有向路径，则称两个顶点 强连通 (strongly connected)。. 如果有向图G的每两个顶点都强连通，称G是一个 强连通图 。. 有向图的极大强连通 子图 ，称为强连通分量。步骤1：在有向图上运行带时间戳的DFS；步骤2：在翻转的有向图上按照post值的大小运行DFS

#include<iostream>#define N 100using namespace std;int main(){ int a[N]; int* p; int n = 0; //n表示一共多少人 int m = 0; //m表示被淘汰的人数 int i = 1; //每轮循环中的计数器 int k = 0; //用来表示报数的数 int j = 0; //用于循环的计数器 p = a;

#include<iostream>using namespace std;struct Student { char number[10]; char name[10]; double score;};int main(){ Student temp; Student array[10] = { {"001","李建华",13.6}, {"002","张岩",14.8}, {"010","胡晓强",12.0}, {"013","马万驰",12.9},

#include <iostream>using namespace std;//实现一个简单的计算器int main(){ char op; float num1, num2; cout << "输入运算符：+、-、*、/ : "; cin >> op; cout << "输入两个数: "; cin >> num1 >> num2; switch (op)

#include<iostream>#include<stdio.h>#define N 10using namespace std;void order(int a[], int size);int main(){ int myarray[N]; cout << "输入10个数：" << endl; for (int i = 0; i < N; i++) { cin >> myarray[i]; } ord

#include<iostream>using namespace std;int main(){ int i, x, k = 1, m, j = 0; int array[20] = { 0 }; cout << "请输入需要转化的十进制数" << endl; cin >> x; i = x; while (x != 0) { m = x % 2; k = x / 2; array[j] = m; if (k == 1)

#include<iostream>using namespace std;int main(){ int array[20] = { 0 }; array[1] = 1; for(int n=2;n<20;n++) array[n] = array[n - 1] + array[n - 2]; for (int i = 19; i >= 0; i--) { cout<< array[i] << " "; } return 0;}

#include<iostream>using namespace std;template<typename T>T Abs(T x){ if (x >= 0) return x; else return -x;}int main(){ double c; cout << "请输入一个数" << endl; cin >> c; cout << "绝对值为：" << Abs(c)&l

#include<iostream>using namespace std;int fib(int a);int main(){ int n;cout << "请输入n" << endl; cin >> n; fib(n); cout << fib(n) << endl;}int fib(int a){ if (a ==1) return 1; if (a ==2) return 1; if (

#include<iostream> using namespace std;int strlen(char str){ int i=0, len = 0; while (str != '/0') { len++; i++; } return len;}int strcmp(char str1[], char str2[], int lenth){ int i; char* p1,*p2;

#include <iostream>#include <string>using namespace std;int str_cmp(string str1, string str2){ int len1 = str1.length(); int len2 = str2.length(); for (int i = 0; i < len1 && i < len2; i++) if (str1[i] != str2[i]) return s.

#include <iostream>#include <math.h>using namespace std;int main(){ int k; double m, n; double i, sum; double eps = 1e-6; double a, b, c, d; double f1, f2; double * p=&i; cout << "求解形如ax^3+bx^2+cx+d=0方程请输入1\n求解形如asin(x)+bx

#include<iostream>using namespace std;int main(){ char ch[30];cout<<”输入字符串以@结尾”<<endl; gets_s(ch); int digit = 0, i=0; while (ch[i] != '\0') { if ('0' <= ch[i]&& ch[i] <= '9') digit++; i++; } cout <&l