循环的运用

这篇博客展示了三个C语言实现的简单程序:计算n的阶乘、n!的前n项和以及数组的由外而内打印。还包含了一个密码验证的示例,演示了输入错误密码三次后的处理。这些代码实例涵盖了基础算法和控制流程,适合初学者学习。
摘要由CSDN通过智能技术生成
n的阶乘:n!
           int main()
                        {
         int a, b, c;

 

         int d = 0;

 

 

        scanf( "%d" ,&d);
         for (a = 1, b = 1, c = 1; a != 0; a++)
        {
                if (a == 1 && d == 1)
               {
                       printf( "1!=1\n");
                        break;
               }
                else
               {
                       c = a * b;
                        if (a == d)
                       {
                              printf( "%d!=%d\n", a, c);
                               break;
                       }
                        //printf("%d!=%d\n", a, c);
                       b = c;
               }
        }
         return 0;
        }
简易算法
         int a = 1;
         int b = 1;
         int c = 1;
        scanf( "%d",&c);
         for (a = 1, b = 1; a <= c; a++)
               b = b * a;
        printf( "%d!=%d\n", c, b);
         return 0;
n!的前n项和
          int a = 1;
         int b = 1;
         int c = 1;
         int d = 0;
        scanf( "%d",&c);
         for (a = 1, b = 1; a <= c; a++)
        {
               b = b * a;
               d = d + b;
        }
        
        printf( "sum=%d\n",d);
         return 0;
数组二分查找法
         int arr[] = { 1,2,3,4,5,6,7,8,9 };
         int k = 11;
         int sz = sizeof(arr) / sizeof(arr[0]);
         int left = 0;
         int right = sz - 1;
while(left<=right)
{
         int mid = (left + right) / 2;
         if (arr[mid] > k)
        {
               right = mid - 1;
        }
         else if (arr[mid] < k)
        {
               left = arr[mid] + 1;
        }
         else
        {
               printf( "找到了!下标是:%d\n", mid);
                break;
        }
}
if(left>right)
{
        printf( "找不到\n");
}
         return 0;
由外而内打印 
         char arr0[] = "welcome to my town!!!!";
         char arr1[] = "######################";
         int left = 0;
         //int right = sizeof(arr0) / sizeof(arr0[0]) - 2;
         int right = strlen(arr1) - 1;
         while (left <= right)
        {
               arr1[left] = arr0[left];
            arr1[right] = arr0[right];
            printf( "%s\n", arr1);
               Sleep(500);
               system( "cls"); //清空屏幕
            left++;
            right--;
     }
        printf( "%s\n", arr0);
         return 0;
输入密码
int i = 0;
char password[20] = { 0 };
for(i=1;i<=3;i++)
{
        printf( "请输入密码:>");
        scanf( "%s", password);
         if (strcmp(password, "123123") == 0)
        {
               printf( "密码正确\n");
                break;
        }
         else if (i == 3)
        {
               printf( "滚\n");
               printf( "密码错误,请重新输入\n");
        }
         else
               printf( "密码错误,请重新输入\n");
}
         return 0;
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值