zoukankan      html  css  js  c++  java
  • 160809207刘兆轩

    #include<stdio.h>
    int main()
    {
        int i=1,sum=0;
        do{
            sum+=i;
            i++;
        }while(i<=100);
        printf("sum=%d
    ",sum);
        return 0;
    }
     
    #include <stdio.h>
     int main()
     {
         int k,sum=0;
        for(k=1;k<=100;k++)
             sum+=k;
        printf("sum=%d
    ",sum);
        return 0;
     }
    
    #include<stdio.h>
    void main()
    {
        int i,sum=0;
        i=1;
        while(i<=100){
        sum+=i;
        i++;
        }
        printf("sum=%d
    ",sum);
        return 0;    
    }



    
    
    #include <stdio.h>
    int main()
    {
        int i,n,sum=1;
        printf("输入一个数");
        scanf("%d",&n);
        i=n;
            do{
            sum=sum*i;
            i--;
        }while(i>=1);
             printf("n!=%d",sum);
        return 0;
    }
    
    #include <stdio.h>
    int main()
    {
        int i,n,sum=1;
        printf("输入一个数");
        scanf("%d",&n);
        i=n;
         for(i=n;i>=1;i--)
         sum=sum*i;
             printf("n!=%d",sum);
        return 0;
    }
        
    #include <stdio.h>
    int main()
    {
        int i,n,sum=1;
        printf("输入一个数");
        scanf("%d",&n);
        i=n;
        while(i>=1){
            sum=sum*i;
            i--;
        } 
        printf("n!=%d",sum);
        return 0;
    }

    
    
    #include <stdio.h>
    int main(){ 
            int k;
            float sum=0;
    for(k=1;k<=100;k++) 
    sum += k;
    
    for(k=1;k<=50;k++)
    sum=sum+k*k;
    
    for(k=1;k<=10;k++)
    sum=sum+1.0/k;
     
    
     printf("和为:%.2f",sum);
     return 0;
     }

    
    
    #include<stdio.h>
    int main()
     {
         char c;
         int zm=0,sz=0,kg=0,qt=0;
         while((c=getchar())!='
    ')
        {
             if(c>='a'&&c<='z'||c>='A'&&c<='Z')
                 zm++;
             else if(c=='  ')
                  kg++;
            else if(c>='0'&&c<='9')
                sz++;
            else
                qt++;    
         }
         printf("字母个数:%d
    ",zm);
         printf("空格个数:%d
    ",kg);
         printf("数字个数:%d
    ",sz);
         printf("其他个数:%d
    ",qt);
         return 0;
     }
     
    
    

    
    
    #include <stdio.h>
    int main()
    {
    int i,t,m,n;
    printf("输入两个整数:");
    scanf("%d%d",&m,&n);
        if(n>m)
        {
            t=m;
            m=n;
            n=t;
        } 
        for(i=n;i>=1;i--)
        if(m%i==0&&n%i==0)
        break;
        printf("m=%d n=%d",m,n);
        if(i=!0)
        printf("最小公约数为:%d
    ",i);
        i=(m+n)/i;
        printf("最大公倍数为:%d
    ",i) ;
    return 0;    
    }
    #include <stdio.h>
    int main()
    {
      int n,k1,k2,k3;
      for(k1=0;k1<=9;k1++)
          for(k2=0;k2<=9;k2++)
              for(k3=0;k3<=9;k3++){
                  if(k3*100+k2*10+k1==k1*k1*k1+k2*k2*k2+k3*k3*k3)
                  printf("%d
    ",k3*100+k2*10+k1);
              }        
    return 0;   




    这次课我们学了循环结构。经过几周的学习,我已经不会再对问题束手无策,但在细节上还是掌握不好。课上老师留了几道练习练习题,我想这是远远不够的。想要学到更多知识只能靠自己。
     










  • 相关阅读:
    0309. Best Time to Buy and Sell Stock with Cooldown (M)
    0621. Task Scheduler (M)
    0106. Construct Binary Tree from Inorder and Postorder Traversal (M)
    0258. Add Digits (E)
    0154. Find Minimum in Rotated Sorted Array II (H)
    0797. All Paths From Source to Target (M)
    0260. Single Number III (M)
    0072. Edit Distance (H)
    0103. Binary Tree Zigzag Level Order Traversal (M)
    0312. Burst Balloons (H)
  • 原文地址:https://www.cnblogs.com/160809207lzx/p/5955956.html
Copyright © 2011-2022 走看看