zoukankan      html  css  js  c++  java
  • c实验4

    #include <stdio.h>
    int main(){
    int i,j,t;
    int a[10];
    printf("输入10个数:");
    for(i=0;i<10;i++){
    scanf("%d",&a[i]);
    }
    for(j=0;j<9;j++){
    for(i=0;i<9-j;i++){
    if(a[i]>a[i+1]){
    t=a[i];
    a[i]=a[i+1];
    a[i+1]=t;
    }
    }
    }
    printf("顺序:");
    for(i=0;i<10;i++){
    printf("%d ",a[i]);

    }

    printf(" ");

    return 0;
    }

    #include <stdio.h>
    int main(){
    int a[3][3];
    int i,k,j;
    printf("输入9个数:");
    for(i=0;i<3;i++){
    for(j=0;j<3;j++){
    scanf("%d",&a[i][j]);
    }
    }
    k=(a[0][0]+a[1][1]+a[2][2]+a[0][2]+a[2][0]);
    printf("对角线之和:");
    printf("%d ",k);
    return 0;

    }

    #include <stdio.h>
    int main()
    {
    int i,num=0,word=0;
    char string[80];
    char c;
    gets(string);
    for(i=0;(c=string[i])!='';i++)
    if(c==' ')word=0;
    else if(word==0)
    {word=1;
    num++;
    }
    printf("there is %d words in this line ",num);
    return 0;
    }

    # include<stdio.h>
    # include<math.h>
    int main(){
    int a[101],i,j,n=0;
    for(i=2;i<=100;i++)
    a[i]=i;
    for(i=2;i<=100;i++){
    for(j=2;j<=sqrt(i);j++){
    if(a[i]%j==0)
    a[i]=0;
    }

    }
    printf("2到100的素数:");
    for(i=2;i<=100;i++){
    if(a[i]!=0){
    printf("%d ",a[i]);

    }


    }
    printf(" ");
    return 0;
    }

  • 相关阅读:
    Swift 懒加载
    Swift 模型属性
    Swift 循环引用
    Two Sum
    Best Time to Buy and Sell Stock II
    Best Time to Buy and Sell Stock I
    Pascal's Triangle II
    杨辉三角(数组)
    Merge Sorted Array 合并数组
    Plus One
  • 原文地址:https://www.cnblogs.com/P201821440004/p/10883402.html
Copyright © 2011-2022 走看看