2.6 函数
函数也是比较简单的,唯一需要特别用心去理解一下的就是递归函数的用法,这在后面的章节会着重讲述。
Codeup Contest ID:100000570
//Codeup Contest ID:100000570
//A:
#include<stdio.h>
#include<string.h>
void reverse(char a[]){
int x;
for(int i=0;;i++){
if(a[i]=='\0'){
x = i;
break;
}
}
for(int i=x-1;i>=0;i--){
printf("%c", a[i]);
}
}
int main(){
char str[100];
scanf("%s", str);
reverse(str);
return 0;
}
//B:
#include<stdio.h>
#include<string.h>
void yy(char a[]){
int x, j;
char b[100];
for(int i=0;;i++){
if(a[i]=='\0'){
x = i;
break;
}
}
j = 0;
for(int i=0;i<=x-1;i++){
if(a[i]=='a'||a[i]=='e'||a[i]=='i'||a[i]=='o'||a[i]=='u'){
b[j] = a[i];
j++;
}
}
for(int i=0;i<j;i++){
printf("%c", b[i]);
}
}
int main(){
char str[100];
scanf("%s", str);
yy(str);
return 0;
}
2.7 指针
主要讲了指针和引用的使用方式,重点是需要分清楚值传递和地址传递的区别(比如经典的swap函数)。
Codeup Contest ID:100000571
//Codeup Contest ID:100000571
//A:
#include<stdio.h>
#include<string.h>
int main(){
int a, b;
int* p1, *p2;
p1 = &a;
p2 = &b;
scanf("%d%d", &a, &b);
if(*p1>*p2) printf("%d %d", *p1, *p2);
else printf("%d %d", *p2, *p1);
return 0;
}
//B:
#include<stdio.h>
#include<string.h>
int main(){
int a[3];
for(int i=0;i<=2;i++){
scanf("%d", &a[i]);
}
for(int i=1;i<=2;i++){
for(int j=0;j<3-i;j++){
if(*(a+j)<*(a+j+1)){
int temp = *(a+j);
*(a+j) = *(a+j+1);
*(a+j+1) = temp;
}
}
}
for(int* p=a;p<=a+2;p++){
if(p==a) printf("%d", *p);
else printf(" %d", *p);
}
return 0;
}
//C:
#include<stdio.h>
#include<string.h>
int main(){
char* a = "I love China!";
int n;
scanf("%d", &n);
for(int i=1;i<=n;i++) a++;//指针a默认指向字符'I'的地址
printf("%s", a);
return 0;
}
//D:
#include<stdio.h>
#include<string.h>
int main(){
char str[3][100];
char temp[100];
char(*p)[100] = str;
for(int i=0;i<=2;i++){
scanf("%s", str[i]);
}
for(int i=1;i<=2;i++){
for(int j=0;j<3-i;j++){
if(strcmp(*(p+j),*(p+j+1))>0){
strcpy(temp, *(p+j+1));
strcpy(*(p+j+1), *(p+j));
strcpy(*(p+j), temp);
}
}
}
for(int i=0;i<=2;i++){
printf("%s\n", *(p+i));
}
return 0;
}
//E:
#include<stdio.h>
#include<string.h>
int* findmax(int a[], int n){
int max = 0;
int maxi = 0;
int *p = a;
for(int i=0;i<n;i++){
if(a[i]>max){
max = a[i];
maxi = i;
}
}
return p+maxi;
}
int* findmin(int a[], int n){
int min = 123123123;
int mini = 0;
int *p = a;
for(int i=0;i<n;i++){
if(a[i]<min){
min = a[i];
mini = i;
}
}
return p+mini;
}
void swap(int* a, int* b){
int temp = *a;
*a = *b;
*b = temp;
}
int main(){
int a[10];
int* p1, *p2;
p1 = a;
p2 = a+9;
for(int i=0;i<=9;i++){
scanf("%d", &a[i]);
}
swap(p2,findmax(a,10));
swap(p1,findmin(a,10));
for(int i=0;i<=9;i++){
printf("%d ", a[i]);
}
return 0;
}
2.8 结构体(struct)的使用
结构体之前在大一的时候也系统学习过,主要要清楚结构体成员的调用方式(点.调用或者箭头->调用)。
Codeup Contest ID:100000572
//Codeup Contest ID:100000572
//A:
#include<stdio.h>
#include<string.h>
struct person{
char name[20];
int count;
}leader[3] = {"Li", 0, "Zhang", 0, "Fun", 0};
int main(){
int n;
scanf("%d", &n);
while(n--){
char str[20];
scanf("%s", str);
if(strcmp(str,leader[0].name)==0) leader[0].count++;
if(strcmp(str,leader[1].name)==0) leader[1].count++;
if(strcmp(str,leader[2].name)==0) leader[2].count++;
}
for(int i=0;i<=2;i++){
printf("%s:%d\n", leader[i].name, leader[i].count);
}
return 0;
}
//B:
#include<stdio.h>
#include<string.h>
struct student{
int num;
char name[20];
char sex;
int age;
};
int main(){
int n;
struct student stu[20];
scanf("%d", &n);
for(int i=0;i<n;i++){
struct student* p;
p = &stu[i];
scanf("%d %s %c %d", &p->num, p->name, &p->sex, &p->age);
}
for(int i=0;i<n;i++){
struct student* p;
p = &stu[i];
printf("%d %s %c %d\n", p->num, p->name, p->sex, p->age);
}
return 0;
}
//C:
#include<stdio.h>
#include<string.h>
struct people{
int num;
char name[10];
char sex;
char job;
union {
int classs;
char position[10];
}category;
}p[100];
int main(){
int n;
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%d %s %c %c", &p[i].num, p[i].name, &p[i].sex, &p[i].job);
if(p[i].job=='s') scanf("%d", &p[i].category.classs);
else scanf("%s", p[i].category.position);
}
for(int i=0;i<n;i++){
printf("%d %s %c %c", p[i].num, p[i].name, p[i].sex, p[i].job);
if(p[i].job=='s') printf(" %d\n", p[i].category.classs);
else printf(" %s\n", p[i].category.position);
}
return 0;
}
//D:
#include<stdio.h>
#include<string.h>
struct student{
int num;
char name[10];
int score1;
int score2;
int score3;
}stu[5];
void input(student a[], int n){
for(int i=0;i<n;i++){
scanf("%d %s %d %d %d", &stu[i].num, stu[i].name, &stu[i].score1, &stu[i].score2, &stu[i].score3);
}
}
void output(student a[], int n){
for(int i=0;i<n;i++){
printf("%d %s %d %d %d\n", stu[i].num, stu[i].name, stu[i].score1, stu[i].score2, stu[i].score3);
}
}
int main(){
input(stu, 5);
output(stu, 5);
return 0;
}
//E:
#include<stdio.h>
#include<string.h>
struct student{
int num;
char name[10];
double score1;
double score2;
double score3;
}stu[10];
void input(student stu[], int n){
for(int i=0;i<n;i++){
scanf("%d %s %lf %lf %lf", &stu[i].num, stu[i].name, &stu[i].score1, &stu[i].score2, &stu[i].score3);
}
}
void output(student stu[], int n){
double sum1, sum2, sum3, av1, av2, av3;
sum1 = sum2 = sum3 = 0;
for(int i=0;i<n;i++){
sum1 += stu[i].score1;
sum2 += stu[i].score2;
sum3 += stu[i].score3;
}
av1 = sum1/10;
av2 = sum2/10;
av3 = sum3/10;
printf("%.2f %.2f %.2f\n", av1, av2, av3);
int max = 0;
int avv, max_i;
for(int i=0;i<n;i++){
avv = (stu[i].score1+stu[i].score2+stu[i].score3)/3;
if(avv>max){
max = avv;
max_i = i;
}
}
printf("%d %s %.0f %.0f %.0f", stu[max_i].num, stu[max_i].name, stu[max_i].score1, stu[max_i].score2, stu[max_i].score3);
}
int main(){
input(stu, 10);
output(stu, 10);
return 0;
}
2.9 补充
本节主要的内容是浮点数误差的修正,以及时间复杂度、空间复杂度的估算。其中,浮点数修正的有关内容可以总结为以下代码:
const double eps=1e-8;
const double Pi=acos(-1.0);
#define Equ(a,b) ((fabs((a)-(b)))<(eps))
#define More(a,b) (((a)-(b))>(eps))
#define Less(a,b) (((a)-(b))<(-eps))
#define MoreEqu(a,b) (((a)-(b))>(-eps))
#define LessEqu(a,b) (((a)-(b))<(eps))
//Codeup Contest ID:100000573
//本小节暂无练习题
2.10 黑盒测试
主要讲的是OJ系统的单点测试和多点测试,其中需要注意的是,多点测试中,每一次循环都要重置一下变量和数组,而重置数组一般使用memset函数或fill函数。
Codeup Contest ID:100000574
//Codeup Contest ID:100000574
//A:
#include<stdio.h>
#include<string.h>
int main(){
int a,b;
while(scanf("%d%d", &a, &b) != EOF){
printf("%d\n", a+b);
}
return 0;
}
//B:
#include<stdio.h>
#include<string.h>
int main(){
int a, b, n;
while(scanf("%d", &n) != EOF){
while(n--){
scanf("%d%d", &a, &b);
printf("%d\n", a+b);
}
}
return 0;
}
//C:
#include<stdio.h>
#include<string.h>
int main(){
int a, b, n;
while(scanf("%d%d", &a, &b) != EOF){
if(a==0&&b==0) break;
printf("%d\n", a+b);
}
return 0;
}
//D:
#include<stdio.h>
#include<string.h>
int main(){
int n;
while(scanf("%d", &n) != EOF){
if(n==0) break;
int sum = 0;
while(n--){
int m;
scanf("%d", &m);
sum += m;
}
printf("%d\n", sum);
}
return 0;
}
//E:
#include<stdio.h>
#include<string.h>
int main(){
int n;
scanf("%d", &n);
while(n--){
int sum = 0;
int m;
scanf("%d", &m);
while(m--){
int k;
scanf("%d", &k);
sum += k;
}
printf("%d\n", sum);
}
return 0;
}
//F:
#include<stdio.h>
#include<string.h>
int main(){
int n;
while(scanf("%d", &n) != EOF){
int sum = 0;
while(n--){
int m;
scanf("%d", &m);
sum += m;
}
printf("%d\n", sum);
}
return 0;
}
//G:
#include<stdio.h>
#include<string.h>
int main(){
int a, b;
while(scanf("%d%d", &a, &b) != EOF){
printf("%d\n\n", a+b);
}
return 0;
}
//H:
#include<stdio.h>
#include<string.h>
int main(){
int n, a, b;
scanf("%d", &n);
while(n--){
int m;
scanf("%d", &m);
int sum = 0;
while(m--){
int k;
scanf("%d", &k);
sum += k;
}
printf("%d\n\n", sum);
}
return 0;
}