董伟

#include #include using namespace std; int main() { typedef struct { string id; string login; string logout; }info; info min; info max; info tmp; int n; cin>>n; for(int i=0; i<n; ++i)

#include #include using namespace std; int main() { string s; cin>>s; int len = s.size()+2; int n1 = len /3; int bottom = len - 2*n1; int i=0; for(; i<n1-1;++i) { cout<<s[i]; for(int j=0;

#include using namespace std; int main() { char a[13] = {'0','1','2','3','4','5','6','7','8','9','A','B','C'}; int num; int tmp; for(int i=0; i<3; ++i) { cin>>num; if(!i) cout<<"#"; tmp

最淳朴的想法，把两个出口，正向走，方向走的距离都累加求和算出来，然后比较输出较小的 #include #include using namespace std; int main() { int num; cin >> num; int tmp; int sum = 0; vector vec; for (int i = 0; i < num; ++i) { cin >>

#include #include using namespace std; int main() { vector vec; int num; int base; cin>>num>>base; int digit; if(num == 0) { cout<<"Yes"<<endl; cout<<0; return 0; } while(num) { digi

#include using namespace std; int main() { float a[3][3]; float max = 0; int tag = 0; float profit = 1; char flag[3] = {'W','T','L'}; for(int i=0; i<3;++i) { for(int j=0; j<3; ++j) { cin

#include using namespace std; int main() { int n; int cur = 0; int floor; int total = 0; int tmp; cin>>n; for(int i=0; i<n; ++i) { cin>>floor; tmp = floor - cur; total += (tmp > 0 ? tmp

#include #include using namespace std; typedef struct student { string name; string sex; string id; int grade; }stu; int main() { int num; cin >> num; stu lowest_m; lowest_m.grade = 101

#include #include #include using namespace std; int main() { vector > vec; pair tmp; int num; cin >> num; int flag = 0; int count = 0; for (int i = 0; i { cin >> tmp.first >> tmp.second

#include #include//想用memset 在g++下要包这个头文件 #include using namespace std; int main() { string s1, s2,s3; getline(cin, s1); getline(cin, s2); char a[256]; memset(a, -1, sizeof(a)); for (int i = 0;