浙江工商2019机试真题2

关注

原创最新推荐文章于 2026-07-07 17:11:08 发布 180 阅读 AI 写同款· GEO 优化 ›

从真题到实战：解码浙江工商大学计算机复试机试核心算法与高频考点本文深入解析浙江工商大学计算机复试机试的高频算法考点，包括哈希表、字符串处理、数学题和博弈论等核心内容。通过真题案例和实战技巧，帮助考生掌握解题思路和应试策略，提升机试通过率。特别强调输入输出处理的细节和算法思维的训练，为考生提供系统化的备考方案。阅读详情

6output transpose matrix

#include <stdio.h>
int main(void) {
    int n,i,j;
    printf("please input n equal to:");
    scanf("%d",&n);
    int a[n][n];
    printf("please input a[n][n] equal to:");
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            scanf("%d",&a[i][j]);
        }
    }
    printf("output origion matrix:\n");
    for(i=0;i<n;i++){
        for(j=0;j<n;j   ++){
            printf("%d",a[i][j]);
        }
        printf("\n");
    }
    printf("output transpose matrix:\n");
    for(j=0;j<n;j++){
        for(i=0;i<n;i++){
            printf("%d",a[i][j]);
        }
        printf("\n");
    }
    return 0;
}

在这里插入图片描述

8I find that quit a lot of c langage programs have to be implemented mathematically and then programmatically.

There is one way for the first level of stairs,two ways for the second level,three ways for the third level of stairs,and five ways for the fourth level of stairs.
f(n)=f(n-1)+f(n-2)

#include<stdio.h>
int step(n){//n为非负整数
    if(n==0){return 1;}
    else if(n==1){return 1;}
    else{
        return step(n-1)+step(n-2);
    }
}
int main(){
    int n,m;
    scanf("%d",&n);
    m=step(n);
    printf("%d",m);
}