#include<iostream> #include<string> using namespace std; int main() { int t; cin >> t; while (t--) { int i, j, kind, VertexNum, nfe, AdjMatrix[99][99]; string Vertex[100]; cin >> kind >> VertexNum; //输入顶点数目 for (i = 1; i <= VertexNum; i++) cin >> Vertex[i]; //输入顶点 cin >> nfe; for (int m = 1; m <= nfe; m++) { string judge1, judge2; int k = 0, p = 0; cin >> judge1 >> judge2; for (int i = 1; i <= VertexNum; i++) { if (judge1 == Vertex[i]) { k = i; break; } } for (int i = 1; i <= VertexNum; i++) { if (judge2 == Vertex[i]) { p = i; break; } } if (kind == 'D') AdjMatrix[k][p] = 1; else { AdjMatrix[k][p] = 1; AdjMatrix[p][k] = 1; } } for (int i = 1; i <= VertexNum; i++) { for (int j = 1; j <= VertexNum; j++) { if (!AdjMatrix[i][j]) { AdjMatrix[i][j] = 0; } } } for (int i = 1; i <= VertexNum; i++) { for (int j = 1; j < VertexNum; j++) { cout << AdjMatrix[i][j] << ' '; } cout << AdjMatrix[i][VertexNum] << endl; } for (int i = 1; i <= VertexNum; i++) { if (kind == 'D') { int intcheck1, outcheck2, total; for (int j = 1; j <= VertexNum; j++) { if (AdjMatrix[i][j] == 1) intcheck1++; if (AdjMatrix[j][i] == 1) outcheck2++; } total = intcheck1 + outcheck2; cout << Vertex[i] << ": " << intcheck1 << ' ' << outcheck2 << ' ' << total << ' ' << endl; } else { int total2; for (int j = 1; j <= VertexNum; j++) { if (AdjMatrix[i][j] == 1) total2++; } cout << Vertex[i] << ": " << total2 << endl; } } } return 0; }问题在哪

C++实用技巧：高效读写string与STL排序算法

#include <iostream> #include <algorithm> using namespace std; int main() { int a[10]; for (int i = 0; i < 10; ++i) cin >> a[i]; sort(a, a + 10); for (int i = 0; i < 10; ++i) cout << a[i] << ' '; ...

C++学习笔记：string类与getline函数解析

#include <iostream> #include <string> using namespace std; int main() { string line; while(getline(cin, line)) { // 从输入中读取整行，直到遇到EOF或回车 cout << line << endl; // 输出读取的整行 } ...

#include <iostream> #include <algorithm> #include <string> #include <cstdio> #include <cmath> #include <set> #include <map> using namespace std; //const int N = 1e5 + 10; //typedef long long ll; int main() { int t; cin >> t; while (t--) { int n; set<string>a; string s; cin >> n >> s; int t = 0; for (int i = 0; i < s.size(); i++) { t = s.find(s[t]); a.insert(s.substr(i, 1)); } for (int i = 0; i < a.size(); i++) cout << a[i]; cout << endl; } return 0; }有什么问题

using namespace std; int main() { int t; cin >> t; while (t--) { int n; set<string> a; string s; cin >> n >> s; int t = 0; for (int i = 0; i < s.size(); i++) { a.insert(s.substr(i, 1)); t ...

优化这段代码#include <iostream> #include <vector> #include <string> using namespace std; int main() { string s; s.reserve(100); char c; while (cin >> c) { s.push_back(c); } cout << "s===" << s << endl; return 0; }

using namespace std; int main() { char s[100]; int len = 0; char c; while (cin >> c) { s[len++] = c; } s[len] = '\0'; cout << "s===" << s << endl; return 0; } 这里使用了字符数组s来存储...

#include <cstdio> #include <algorithm> #include <iostream> using namespace std; int main() { string temp; while(getline(cin,temp)) { reverse(temp.begin(),temp.end()); cout<<temp<<endl; } return 0; }将这个c++的代码改为c语言的代码

#include <string.h> int main() { char temp[201]; while (fgets(temp, 201, stdin)) { int len = strlen(temp); for (int i = len - 2; i >= 0; i--) { printf("%c", temp[i]); } printf("\n"); } ...

#include <iostream> #include <string> #include <vector> #include <algorithm> #include #include<queue> using namespace std; int main() { int n,m; int a[1000]; int i; while(cin>>n>>m) { for(i=0;i<n;i++) { cin>>a[i]; } std::sort(a,a+n); for(int j=0;j<m;j++) { int b; cin>>b; intit=std::lower_bound(a,a+n,b); if (it != a + n && it == b) { std::cout<<b<<" found at "<<it-a+1<<endl; } else { std::cout<<b<<" not found"<<endl; } }} return 0; }怎么修改可以让运行时不需要另外输回车键继续

#include <iostream> #include <string> #include <vector> #include <algorithm> #include <list> #include <queue> using namespace std; int main() { int n, m; int a[1000]; int i; while (cin >> n >> m)...

#include<iostream>#include<cmath>#include<string>using namespace std;void Reverse(string &Str, int start, int end){ if (start >= end) return; swap(Str[start], Str[end]); Reverse(Str, start+1, end-1);}int main(){ string Str; int a, b, i; while(cin >> a >> b >> Str) { Reverse(Str, a, b); cout << Str << endl; } return 0;}修复让他能正常运行

#include <iostream> #include <cmath> #include <string> using std::cin; using std::cout; using std::endl; using std::string; void Reverse(string& Str, int start, int len) { if (start >= len) return...

//11_8.cpp #include <iostream> #include <string> using namespace std; int main() { string line; cout << "Type a line terminated by 't' " << endl; getline(cin, line, 't'); cout << line << endl; return 0; } 试用get函数完成同样的功能。

using namespace std; int main() { string line; cout << "Type a line terminated by 't' " << endl; char c; while(cin.get(c)){ if(c == 't'){ break; } line += c; } cout << line << endl; return...

以#include <iostream> #include <windows.h> #include <iomanip> #define N 1000 using namespace std; struct person { int age char function[12] char gender[10] }; struct staff { int number; char name[12] person per;开头写一篇关于员工信息管理的小系统

cout << staffs[i].number << "\t\t" << staffs[i].name << "\t\t" << staffs[i].per.age << "\t\t" << staffs[i].per.gender << "\t\t" << staffs[i].per.function << endl; } } int main() { Staff staffs[N];...

#include <iostream> #include <algorithm> #include <cstring> #include <map> using namespace std; int ans; map<string, string> mp; int main() { string tmp; cin >> tmp; for (int i = 0; i < tmp.size() - 7; i ++) { string str = ""; for (int j = i; j < i + 8; j ++) str += tmp[j]; mp[str] = str; } int n; cin >> n; while(n --) { string s; cin >> s; sort(s.begin(), s.end()); do if(mp.count(s)) ans ++; while(next_permutation(s.begin(), s.end())); } cout << ans << endl; return 0; }解释

3.进入一个while循环，循环n次。每次循环中，读入一个字符串s，将其排序后，通过枚举其所有排列，检查是否在之前存储的map中出现过。如果出现过，将答案ans加1。 4.最后输出ans即为答案。这段代码的核心思想是将...

请写一个同样功能的C++代码 #include <iostream> #include <string> using namespace std; int main() { string str1; string str2; while(getline(cin, str1))// 输入第一个字符串 { getline(cin, str2); // 输入第二个字符串 size_t pos = 0; while ((pos =

str1.find(str2, pos)) != string::npos) // 在第一个字符串中查找第二个字符串 { str1.replace(pos, str2.length(), "");... // 更新 pos 的位置 } cout << str1 << endl; // 输出处理后的字符串 } return 0; }

优化这段代码:#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int n; string s[25]; bool cmp(string a,string b){ return a+b>b+a; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>s[i]; } sort(s+1,s+n+1,cmp); for(int i=1;i<=n;i++){ cout<<s[i]; } return 0; }

#include<iostream> #include<cstdio> #include<algorithm> #include<sstream> using namespace std; const int MAXN = 25; int n; string s[MAXN]; bool cmp(string a,string b){ stringstream ss1, ss2;...

#define _CRT_SECURE_NO_WARNINGS 1 #include<iostream> #include<cstring> #include<string> #include<cmath> using namespace std; int main() { int n; cin >> n; int a[101]; for (int i = 0; i < n; i++) cin >> a[i]; int p = n + 1; int p1 = 0; while (p>1) { p /= 2; p1++; } int y = 0; for (int i = 0; i < n; i++) if (a[i] == 0) y++; int r = int((y + 1) / 2) + int(pow(2, p1 - 1)) - y; cout << r << endl; return 0; }改错

using namespace std; int main() { int n; cin >> n; int a[101]; for (int i = 0; i < n; i++) { cin >> a[i]; if (i >= 101) { break; } } int p = n + 1; int p1 = 0; ...

#include <iostream> #include <cstdio> #include <vector> #include <iterator> #include <algorithm> #include <string> #include <set> #include <map> using namespace std; //cout<< //cin>> set<long long int>::iterator it; set<long long int>::iterator it1; bool pd(set<long long int > set1,set<long long int> set2) { if(set1.size()!=set2.size())return false; for(it=set1.begin(),it1=set2.begin();it!=set1.end();it++,it1++) { if(it!=it1)return false; } return true; } int main() { set<long long int> set1,set2; long long int x; while((cin>>x)) { if(x!=0)set1.insert(x); while(cin>>x&&x!=0) {set1.insert(x);} while(cin>>x&&x!=0) { set2.insert(x); } if(pd(set1,set2)==true)cout<<"YES"<<endl; else cout<<"NO"<<endl; set1.clear(); set2.clear(); } // // set_intersection()//交集 // set_union()//并集 // set_difference()//差集 // set_symmetric_difference() return 0; }这段代码哪里有问题

#include <iostream> #include <set> using namespace std; bool pd(const set<long long int>& set1, const set<long long int>& set2) { return set1 == set2; } int main() { set<long long int> set1, set2;...

#include<math.h> #include<algorithm> #include<time.h> #include<stdlib.h> #include<iostream> #include<string.h> #include<map> #include #include<string> #include<queue> #include<set> #include<vector> #include<stack> #include #define re register #define iosgo() std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0); #define run(i,n) for (int i = 1; i <= n; i++) #define cin std::cin #define cout std::cout #define ll long long #define endl "\n" using namespace std; typedef pair<int, int>pll; const int N = 2e6 + 10; pll c[N]; int h[150][150]; int x[N], y[N], dp[N], ss[N]; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } signed main() { string a; cin >> a; string b; cin >> b; if (a[0] == '0' || b[0] == '0') { cout << "0\n"; return 0; } int lena = a.length(); int lenb = b.length(); for (int i = 0; i < lena; i++) { x[i] = a[i] - '0'; } for (int i = 0; i < lenb; i++) { y[i] = b[i] - '0'; } int len = lena + lenb - 1; int r = 0; while (r < lenb) { for (int i = r, j = 0; i < lena + r; i++, j++) { ss[i] += x[j] * y[r]; } r++; } for (int i = len; i > 0; i--) { if (ss[i] >= 10) { ss[i - 1] += ss[i] / 10; ss[i] %= 10; } } for (int i = 0; i < len; i++) { cout << ss[i]; } }

这段代码是一个实现两个大整数相乘的程序。代码首先读取两个大整数a和b，然后将其转换为整型数组x和y。接下来，代码计算两个整数的乘积，并将结果存储在数组ss中。最后，代码将结果输出。注意，这段代码没有考虑...

#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>using namespace std;struct Student { string name; string id; int score;};bool compare(Student s1, Student s2) { return s1.score < s2.score;}int main() { int n; while (scanf("%d", &n) != EOF) { vector<Student> students; for (int i = 0; i < n; i++) { string name, id; int score; cin >> name >> id >> score; students.push_back({name, id, score}); } sort(students.begin(), students.end(), compare); cout << students.back().name << " " << students.back().id << " " << students.back().score << endl; cout << students.front().name << " " << students.front().id << " " << students.front().score << endl; cout << endl; } return 0;}

using namespace std; // 定义一个结构体来存储学生的信息 struct Student { string name; // 学生姓名 string id; // 学生学号 int score; // 学生成绩 }; // 定义一个比较函数，用于在排序时比较学生的成绩 ...

这段代码有什么问题#include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> using namespace std; const int mod=1337; int main(){ int a; string strb; while(cin>>a>>strb) { a=a%mod; int b[110]; int size=strb.length(); for(int i=0;i<size;i++){ b[i]=strb[i]-'0'; } int ans=1; for(int i=0;i<size;i++){ ans=(int)(pow(ans,10)*pow(a,b[i]))%mod; } cout<<ans<<endl; } }

这段代码的作用是读入一个整数a和一个字符串b，然后将a对1337取模，将字符串b的每个字符转化为数字存储在数组b中，最后计算a的b[0]次方，将结果赋值给ans，接着计算ans的b[1]次方，以此类推，直到计算完b中所有的...

#include <iostream> #include <fstream> #include <iomanip> #include <cstdio> using namespace std; void loadFile(char *fileName) { /***** Begin / / End *****/ } int main() { char fileName[20]; cin >> fileName; cout << "Off Bytes Characters" << endl; cout << "--- ------------------------------ ----------" << endl; loadFile(fileName); return 0; }

cout << hex << setw(2) << setfill('0') << (int)(unsigned char)buffer[i] << " "; } // 输出缺失的字节 if (inFile.gcount() < bufferSize) { cout << string((bufferSize - inFile.gcount()) * 3, ' '); ...

#include<iostream> #include<vector> using namespace std; int main() { string word; vector<string>v; while (cin >> word) { v.push_back(word); if (v.size() == 3)break; } for (auto it = v.begin(); it != v.end(); it++) { it[0] += 32; cout << *it << " "; } return 0; }

2. 在 while 循环中，不断读取用户输入的单词，并将其添加到 vector 容器 v 中。当 vector 容器 v 中存储的单词数量为 3 时，跳出循环。 3. 在 for 循环中，遍历 vector 容器 v 中的每个单词，并将...

相关推荐

C++实用技巧：高效读写string与STL排序算法

C++学习笔记：string类与getline函数解析

优化这段代码#include <iostream> #include <vector> #include <string> using namespace std; int main() { string s; s.reserve(100); char c; while (cin >> c) { s.push_back(c); } cout << "s===" << s << endl; return 0; }

#include <cstdio> #include <algorithm> #include <iostream> using namespace std; int main() { string temp; while(getline(cin,temp)) { reverse(temp.begin(),temp.end()); cout<<temp<<endl; } return 0; }将这个c++的代码改为c语言的代码

//11_8.cpp #include <iostream> #include <string> using namespace std; int main() { string line; cout << "Type a line terminated by 't' " << endl; getline(cin, line, 't'); cout << line << endl; return 0; } 试用get函数完成同样的功能。

以#include <iostream> #include <windows.h> #include <iomanip> #define N 1000 using namespace std; struct person { int age char function[12] char gender[10] }; struct staff { int number; char name[12] person per;开头写一篇关于员工信息管理的小系统

请写一个同样功能的C++代码 #include <iostream> #include <string> using namespace std; int main() { string str1; string str2; while(getline(cin, str1))// 输入第一个字符串 { getline(cin, str2); // 输入第二个字符串 size_t pos = 0; while ((pos =

优化这段代码:#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int n; string s[25]; bool cmp(string a,string b){ return a+b>b+a; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>s[i]; } sort(s+1,s+n+1,cmp); for(int i=1;i<=n;i++){ cout<<s[i]; } return 0; }

#include<iostream> #include<vector> using namespace std; int main() { string word; vector<string>v; while (cin >> word) { v.push_back(word); if (v.size() == 3)break; } for (auto it = v.begin(); it != v.end(); it++) { it[0] += 32; cout << *it << " "; } return 0; }

最新推荐

Angular实现MarcHayek简历展示应用教程

管理建模和仿真的文件

深入剖析：内存溢出背后的原因、预防及应急策略（专家版）

Java中如何对年月日时分秒的日期字符串作如下处理：如何日期分钟介于两个相连的半点之间，就将分钟数调整为前半点

Crossbow Spot最新更新 - 获取Chrome扩展新闻

"互动学习：行动中的多样性与论文攻读经历"

【Java内存管理终极指南】：一次性解决内存溢出、泄漏和性能瓶颈

c 语言return用法

量子管道网络优化与Python实现

关系数据表示学习