2C语法基础1.pptVIP

重庆邮电大学计算机科学与技术学院 冯 潇 fengxiao@cqupt.edu.cn;*;*;说明;*;*;*;#include iostream #include string using namespace std; int main() { string name, classNo; cout input name and class number: ; cin name classNo; cout Hello, classNo + : + name , welcome to C++! endl; return 0; } ;全局名字空间;名字空间;*;自定义名字空间xiao;自定义名字空间xiao;*;bool类型示例-1;bool类型示例-2;样本输入数据 500 3 //马路长度500 ，区域数为3 150 300 //第一个区域的起点和终点 100 200 //第二个区域的起点和终点 470 471 //第三个区域的起点和终点 样本输出数据 298 //马路上剩余的树的数目 思路 定义bool类型数组，元素共L + 1个，初始值均为true 将区间内的元素值标记为false 统计true值元素，即为所求树的数目;C++的顺序存储容器--vector;memset：指定内存块填充值;#include iostream #include vector #include cstring using namespace std; int main() { int l,blocksNumber; cout input l and blocks:; cin l blocksNumber; //l+1个元素，每个元素值为true vector bool points(l + 1, true); //blocksNumber * 2个元，未初始化向量 vector int blocks(blocksNumber * 2);; int i; bool *start = (*points.begin()); for(i = 0;i blocksNumber * 2;i += 2) { cout input start and end point of block No. i + 1 : ; cin blocks[i] blocks[i + 1]; memset((void *)(start + blocks[i]), 0 , blocks[i + 1] - blocks[i] + 1); } ; int count = 0; for(i = 0;i l + 1;i++) { if(points[i] == true) count++; } cout trees remained : count endl; return 0; };*;*;*;*;…… ?void swap(int one, int another) { int temp; ? temp = one; one = another; another = temp; }? int main() { int one = 3, another = 5; ? print(交换前, one , another ); swap(one, another ); print(交换后, one , another ); return 0; };我需要更通用的swap实现！;*;*;参数泛化的swap();认识模板;int main() { int a1 = 5; int a2 = 3; cout before swap,integer1 = a1 ,integer2 = a2 endl; Swap(a1,a2);//int类型函数调用 cout after swap,integer1 = a1 ,integer2 = a2 endl; string s1 = C++; string s2 = Java; cout \nbefore swap,string1 = s1 ,string2 =