PAT 1005. 繼續(3n+1)猜想__PAT

來源:互聯網
上載者:User
#include <stdio.h>


int main() {
int num[101];
int i, k, n, length; 
for(i = 0; i < 101; i ++) {
num[i] = -1;
}
scanf("%d", &k);
for(i = 0; i < k; i ++) {
scanf("%d", &n);
num[n] = 0;
}
for(i = 0; i < 101; i ++) {
if(num[i] != 0) {
continue;
}
n = i;
while(n != 1) {
if(n % 2 == 0) {
n = n / 2;
if(n <= 100) {
num[n] = 1;
}
} else {
n = 3 * n + 1;
n = n / 2;
if(n <= 100) {
num[n] = 1;
}
}
}
}
for(i = 0, length = 0; i < 101; i ++) {
if(num[i] == 0) {
length ++;
}
}
for(i = 100; i > 1; i --) {
if(num[i] == 0) {
length --;
if(length != 0) {
printf("%d ", i);
} else {
printf("%d", i);
break;
}
}
}
}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.