第七色在线视频,2021少妇久久久久久久久久,亚洲欧洲精品成人久久av18,亚洲国产精品特色大片观看完整版,孙宇晨将参加特朗普的晚宴

為了賬號(hào)安全，請(qǐng)及時(shí)綁定郵箱和手機(jī)立即綁定
已解決430363個(gè)問題，去搜搜看，總會(huì)有你想問的

for循環(huán)跳轉(zhuǎn)問題的解決（for while循環(huán)語(yǔ)句中不能用goto吧？），滿足執(zhí)行A，否則跳過A，怎么辦？

for循環(huán)跳轉(zhuǎn)問題的解決（for while循環(huán)語(yǔ)句中不能用goto吧？），滿足執(zhí)行A，否則跳過A，怎么辦？

C
慕斯卡9202087 2016-11-03 13:09:49
如題for(.....){??? A??? if(滿足條件)??? 執(zhí)行B??? else??? 跳過B}{??? B}B不能和A一起循環(huán)還是貼代碼吧，一個(gè)我發(fā)現(xiàn)bug（2^n 3^n 5^n沒解決這個(gè)不用管了，這代碼時(shí)間復(fù)雜度太高，我知道丑數(shù)的正解了）的丑數(shù)解決。#include <stdio.h>int main(){?? ?int n,m,i, j, k,l,max,array[100];?? ?l = 0;?? ?scanf_s("%d%d", &n, &m);?? ?for (i = n; i <= m; i++)?? ?{?? ??? ?k = 0;//限制輸出NO條件?? ??? ?for (j = 4; j <= i / 2; j++)//j=1不考慮，2，3跳過了?? ??? ?{?? ??? ??? ?if (j == 2 || j == 3 || j == 5)?? ??? ??? ??? ?continue;?? ??? ??? ?if (i%j == 0)?? ??? ??? ??? ?break;?? ??? ?}//問題在此，怎么讓for循環(huán)后在i%j==0時(shí)結(jié)束掉后面自if(i%2=0...)至for(i=n...)前的代碼？?? ??? ?if (i % 2 == 0 || i % 3 == 0 || i % 5 == 0)?? ??? ?{?? ??? ??? ?array[l] = i;?? ??? ??? ?l++;?? ??? ??? ?k = 1;?? ??? ?}?? ??? ??? ??? ??? ?}?? ?for (i = n; i <= m; i++)?? ?{?? ??? ?if (array[i + 1] > array[i])?? ??? ??? ?max = array[i + 1];//選擇最大丑數(shù)?? ?}?? ?if (k == 1)?? ?{?? ??? ?printf("%d", max);?? ?}?? ?if (k == 0)?? ??? ?printf("%d %d NO", n, m);?? ?return 0;}
查看完整描述

1 回答

?
慕斯卡9202087

TA貢獻(xiàn)2條經(jīng)驗(yàn) 獲得超0個(gè)贊


#include <stdio.h>
int main()
{
?? ?int n,m,i,j,k,max,number,array[1000];
?? ?j = 0;
?? ?scanf_s("%d%d", &n, &m);
?? ?i = n;
?? ?if (m == n)
?? ?{
?? ?
?? ??? ??? ?number = i;
?? ??? ??? ?while (number % 2 == 0)
?? ??? ??? ??? ?number /= 2;
?? ??? ??? ?while (number % 3 == 0)
?? ??? ??? ??? ?number /= 3;
?? ??? ??? ?while (number % 5 == 0)
?? ??? ??? ??? ?number /= 5;
?? ??? ??? ?if (number == 1)
?? ??? ??? ?{
?? ??? ??? ??? ?printf("%d", n);
?? ??? ??? ??? ?return 0;
?? ??? ??? ?}
?? ??? ??? ?else
?? ??? ??? ?{
?? ??? ??? ??? ?printf("%d %dNO", n, m);
?? ??? ??? ??? ?return 0;
?? ??? ??? ?}
?? ?}
?? ?else
?? ?{
?? ??? ?for (i = n; i <= m; i++)
?? ??? ?{
?? ??? ??? ?number = i;
?? ??? ??? ?while (number % 2 == 0)
?? ??? ??? ??? ?number /= 2;
?? ??? ??? ?while (number % 3 == 0)
?? ??? ??? ??? ?number /= 3;
?? ??? ??? ?while (number % 5 == 0)
?? ??? ??? ??? ?number /= 5;
?? ??? ??? ?if (number == 1)
?? ??? ??? ?{
?? ??? ??? ??? ?array[j] = i;
?? ??? ??? ??? ?j++;
?? ??? ??? ??? ?k = j;
?? ??? ??? ?}
?? ??? ??? ?else
?? ??? ??? ??? ?number = 0;
?? ??? ?}
?? ?}
?? ?if (number == 1)
?? ?{
?? ??? ?for (i = n; i <= m; i++)
?? ??? ?{
?? ??? ??? ?for (j = 0; j < k; j++)
?? ??? ??? ??? ?if (array[j + 1] > array[j])
?? ??? ??? ??? ??? ?max = array[j + 1];//最大丑數(shù)
?? ??? ?}
?? ??? ?printf("%d", max);
?? ?}
?? ?if (number == 0)
?? ??? ?printf("%d %dNO", n, m);
?? ?return 0;

}除了可能的溢出問題，以及時(shí)間復(fù)雜度等考慮，算是勉強(qiáng)解決了這一問題吧（我還小，嘿嘿）。。。。

查看完整回答
反對(duì) 回復(fù) 2016-11-03
?
慕斯卡9202087

TA貢獻(xiàn)2條經(jīng)驗(yàn) 獲得超0個(gè)贊

#include <stdio.h>
int main()
{
?? ?int n,m,i,j,k,max,number,array[1000];
?? ?j = 0;
?? ?scanf_s("%d%d", &n, &m);
?? ?for (i = n; i <= m; i++)
?? ?{
?? ??? ?number = i;
?? ??? ?while (number % 2 == 0)
?? ??? ??? ?number /= 2;
?? ??? ?while (number % 3 == 0)
?? ??? ??? ?number /= 3;
?? ??? ?while (number % 5 == 0)
?? ??? ??? ?number /= 5;
?? ??? ?if (number == 1)
?? ??? ?{
?? ??? ??? ?array[j] = i;
?? ??? ??? ?j++;
?? ??? ??? ?k = j;
?? ??? ?}
?? ?}
?? ?for (i = n; i <= m; i++)
?? ?{
?? ??? ?for(j=0;j<k;j++)
?? ??? ?if (array[j + 1] > array[j])
?? ??? ??? ?max = array[j + 1];
?? ?}
?? ?printf("%d", max);
?? ?return 0;

}評(píng)論改的代碼格式。。。。[n,m]范圍內(nèi)最大丑數(shù)求解代碼，應(yīng)該沒問題，目前在想如何加上無(wú)丑數(shù)輸出no的情況


用的number代替i來給丑數(shù)輸入數(shù)組，但是如何改變number或者再添加一個(gè)變量使得number(number=0或者A=number時(shí)A=0使得printf（“%d”，max）跳過，而輸出printf（“no”）

查看完整回答
反對(duì) 回復(fù) 2016-11-03
?
kekedeaizhiyu

TA貢獻(xiàn)1條經(jīng)驗(yàn) 獲得超0個(gè)贊

不知道

查看完整回答
反對(duì) 回復(fù) 2016-11-03
  • 1 回答
  • 0 關(guān)注
  • 1777 瀏覽

添加回答

舉報(bào)

0/150
提交
取消
微信客服

購(gòu)課補(bǔ)貼
聯(lián)系客服咨詢優(yōu)惠詳情

 幫助反饋 APP下載

慕課網(wǎng)APP
您的移動(dòng)學(xué)習(xí)伙伴

 公眾號(hào)

掃描二維碼
關(guān)注慕課網(wǎng)微信公眾號(hào)