1、一個(gè)有10個(gè)整數(shù)元素的數(shù)組，編寫一個(gè)程序找出其中的最大數(shù)和其下標(biāo)，并在主函數(shù)中打印最大數(shù)和相應(yīng)下標(biāo)
#include<iostream>using namespace std;int main() { void max(int *p, int length); int a[] = { 17,85,67,83,65,49,26,92,38,42 }; int length = sizeof(a) / sizeof(int);//求數(shù)組長(zhǎng)度 max(a,length); return 0;}void max(int *p,int length) { int index; int i = 0,max = 0; for (; i<length; p++) { if (*p > max) { max = *p; index = i; } i++; } cout << "max= " << max << "/t" << "index= " << index << endl;}/*#include <iostream>using namespace std;void main(){ int a[10]={17,85,67,83,65,49,26,92,38,42}; for(int max=-32768,i=0,j=0;i<10;i++){ if(max<a[i]){ max=a[i]; j=i; } } cout<<"第"<<j+1<<"個(gè)元素為最大數(shù)，值為:"<<max <<", 下標(biāo)為:"<<j<<endl;}*/2、編寫一個(gè)程序，該程序提示用戶輸入一個(gè)字符串，然后程序按照大寫字母?jìng)€(gè)數(shù)輸出該字符串（使用字符串?dāng)?shù)組來(lái)存儲(chǔ)字符串）
#include<iostream>#include<cstring>using namespace std;int main() { char a[100]; cout << "請(qǐng)輸入字符串：" << endl; cin >> a; int length = strlen(a);//獲取字符串長(zhǎng)度 for (int i = 0; i < length; i++) { if (a[i] >= 'a'&&a[i] <= 'z') { a[i] -= 32; } else if (a[i] >= 'A'&&a[i] <= 'Z') { //a[i] += 32; } } cout << a << endl; return 0;}3、編寫一個(gè)程序，該程序提示用戶輸入學(xué)生姓名以及考試分?jǐn)?shù)。該程序輸出（假定每個(gè)班級(jí)中最多有學(xué)生30名) 1)班級(jí)平均分 2)考試分?jǐn)?shù)低于班級(jí)平均分的學(xué)生姓名 3)最高分以及最高分的學(xué)生姓名
#include<iostream>#include<string>#include<cstdlib>using namespace std;int main() { int i,num; cout << "請(qǐng)輸入學(xué)生個(gè)數(shù)" << endl; cin >> num; if (num > 30) { cout << "學(xué)生少于30人" << endl; } string *name = new string[num]; double *grade = new double[num]; if (grade == NULL || name==NULL) { cout << "Cannot allocate more memory, exit the 4、編寫一個(gè)程序輸入一個(gè)n*n的矩陣，求出兩條對(duì)角線元素值之和#include <iostream>using namespace std;int main() { int num; cout << "請(qǐng)輸入對(duì)角矩陣的大小" << endl; cin >> num; int **p = new int*[num]; for (int i = 0; i <num; i++) p[i] = new int[num]; int sum = 0; int number; for (int i = 0; i < num; i++) { cout << "請(qǐng)輸入矩陣元素"; cout << "第" << (i + 1) << "行" << endl; for (int j = 0; j < num; j++){ cout << "第" << (j + 1) << "列" << endl; cin >> number; p[i][j] = number; } } for (int i = 0; i < num; i++) { sum += p[i][i] + p[i][num-i-1]; } cout << "sum=" << sum << endl; return 0;}5、初始化一個(gè)矩陣F(5*5),元素取自隨機(jī)函數(shù)，將其值傳遞給函數(shù)，實(shí)現(xiàn)矩陣轉(zhuǎn)置。在主函數(shù)中輸出結(jié)果。隨機(jī)函數(shù)的原型 包含在stdlib.h中 是int rand(); 它產(chǎn)生一個(gè)0–65535的隨機(jī)數(shù)（16位機(jī)器中）
#include<iostream>#include<stdlib.h>using namespace std;int main() { void inverse(int (*p)[5]); int F[5][5]; cout << "變化前" << endl; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { F[i][j] = rand(); cout << F[i][j] << "/t"; } cout << endl; } inverse(F); cout << "變化后" << endl; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cout << F[i][j] << "/t"; } cout << endl; } return 0;}void inverse(int (*p)[5]) { for (int i = 0; i < 5; i++) { for (int j =i; j < 5; j++) { int t = p[i][j]; p[i][j] = p[j][i]; p[j][i] = t; } }}/*int main() { void inverse(int matrix1[5][5], int middle[5][5]); int F[5][5] ,middle[5][5]; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { F[i][j] = rand(); } } cout << "變化前" << endl; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cout << F[i][j] << "/t"; } cout << endl; } inverse(F,middle); cout << "變化后" << endl; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cout << middle[i][j] << "/t"; } cout << endl; } return 0;}void inverse(int matrix1[5][5], int middle[5][5]) { //轉(zhuǎn)置矩陣 int i, j; for (i = 0; i<5; i++) for (j = 0; j<5; j++) middle[j][i] = matrix1[i][j];}*/6、編寫一個(gè)函數(shù)char* strfind(char*s,char*t)，用于查找字符串t在字符串s中最右邊出現(xiàn)的位置，如果沒(méi)有找到則返回NULL。并編寫一個(gè)主程序來(lái)測(cè)試該函數(shù)，在主程序中按行輸入兩個(gè)字符串，并輸出結(jié)果。
/*#include<iostream>using namespace std;int main() { char* strfind(char*s, char*t); int num1, num2; char *index; while (1) { cout << "請(qǐng)輸入長(zhǎng)字符串的長(zhǎng)度" << endl; cin >> num1; cout << "請(qǐng)輸入短字符串長(zhǎng)度" << endl; cin >> num2; if (num2 > num1) { cout << "短字符串長(zhǎng)度大于長(zhǎng)字符串，請(qǐng)重新輸入" << endl; } else { char *s = new char[num1]; char *t = new char[num2]; cout << "請(qǐng)輸入長(zhǎng)字符串" << endl; cin >> s; cout << "請(qǐng)輸入短字符串" << endl; cin >> t; index = strfind(s, t); int lengthI = strlen(index); int lengthT = strlen(t); int xiabiao = lengthI - lengthT; cout << index << endl; cout << "最右邊出現(xiàn)的位置:" << xiabiao << endl; break; } } return 0;}char* strfind(char*s, char*t) { char *index; int i, j; int lengthS = strlen(s); int lengthT = strlen(t); char temp; for (i = 0; i < lengthS/2; i++) { temp = s[i]; s[i] = s[lengthS -1 - i]; s[lengthS - i-1] = temp; } for (i = 0; i < lengthT / 2; i++) { temp = t[i]; t[i] = t[lengthT - i-1]; t[lengthT - i-1] = temp; } if (strstr(s, t) == NULL) { index = "Not found!"; } else { index = strstr(s, t); } return index;}*/#include <iostream> #include <string> using namespace std;char *strfind(char *src, char *dst){ int len1 = strlen(src); int len2 = strlen(dst); int start = len1 - 1; int end = len2 - 1; int i, j = len2 - 1; for (i = start; i >= end; i--) { if (src[i] == dst[j]) { j--; if (j == -1) { cout << "the position is: " << i + 1 << endl; return &src[i]; } } else j = len2 - 1; } return NULL;}int main(){ char src[100]; char dst[100]; cout << "請(qǐng)輸入一個(gè)字符串：" << endl; cin.getline(src, 100, '/n'); cin.clear(); cout << "請(qǐng)輸入要查找的字符串：" << endl; cin.getline(dst, 100, '/n'); char *temp = strfind(src, dst); if (temp != NULL) { cout << "所尋找的字符串以及后面的字符串為：" << temp << endl; } else cout << "no such characters!" << endl; system("pause"); return 0;}新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
