1 like 0 dislike
5.9k views
請設計一個程式,由使用者輸入一個數,程式會找出其所有因數後由小到大輸出。

sample input:

12

sample output

1 2 3 4 6 12
[Exercise] Coding (C) - asked in 2016-1 程式設計(一)AC by (18k points)
ID: 15446 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00

reshown by | 5.9k views

37 Answers

0 like 0 dislike
Hidden content!
#include *** *****

#include ** ** * ** * *



int main()

{
* ** * * ** ** ** ** * j,n,k,g=0;


** ** ** * *** * * ** * **** * * *
**** * ** * ** ** * * num[j-1];
** ****** ** ** ******* ** ** *** *
******** * ** * ** * * * * *** ** *** ** (0==j%n)
* *** * ** *** ** * ** *
*** ** * * * * * ** *
****** * * * ** ** ** * * *** ** ***
* * **** * ** *** ** * ** ***



printf("%d ",num[k]);
**** * * *** ** **



 return 0;

}
answered by (-122 points)
0 like 0 dislike
Hidden content!
#include **** * ** * *

#include *** *** * *



int main()

{
** ** * **** ** * * j,n,k,g=0;


* * ** ***** *** ** ***** ** *** * *** ** ** * ***
**** * * * * * * * num[j-1];
* * *** * ** * ***** * * * * ***
**** ** * * * * *** *** * ** * * * *** (0==j%n)
* ***** * * * * * * ** *
* * * **** * **
*** ** *** * ** *** * ** *** *
**** ** ** * **** * **



printf("%d ",num[k]);
* * ** * * ** *** *



 return 0;

}
answered by (-122 points)
0 like 0 dislike
Hidden content!
#include * *** * ****

#include * * * *** *



int main()

{
** ******** * * * *** j,n,k,g=0;


* * * * * ** * * * * ** **** ***** * *
** **** ****** ** ** * *** num[j-1];
*** *** * **** **** * ** * * * ****
***** *** * * ******* ** ** * * (0==j%n)
*** ** **** ** *
* ** ****** ***** *
** * *** ** * ** ** * ** *
* * * * * * * * *** **** **



printf("%d ",num[k]);
***** *** *** **** ** ***



 return 0;

}
answered by (-122 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>
** ****** * ** ** *



int main()

{
* *** * ** * * a,i;
* ** *** ** * **** * *** * ** * * * *
* **** * *** ** ** *** *
**** **** * *
***** ** ** * ** * ** * * * **** *
* ** ** ***** ***** ** ** ",i);
* * * ** * *** **


* *** * **** * *** ** * **
* * ****** * * *** 0;



}
answered by (-124 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



int main()

{
* * ** ** ** * ****** x,i;
* * ** * * ** * * * *** * **** *****


**** * * * * *** ** ** ** * i<=x; i++)
* ** * ****** *******
* ** ** * * *** ** *** ** ** ***** * ** **** * * (x % i == 0)
** ** ** ***** * * * * * ** * * *** **** ** *** * *** ** * ",i);
* ** ***** * * *** * ***

}
answered by (-162 points)
0 like 0 dislike
Hidden content!
#include ** * * *** * *

#include *** * ** * **

int main()

{
** ** ** ** ** n,i,ans;
** * **** ** * ** * * * **** ****
***** * *** ** ** ****** (i = n; i <= n;--i)
* ** * ***** ****** *
* ** * ** ********** ** *** ***** ** * **** % i == 0;
* * ** * * * * ** * *** **** * * * * * = n / i;
*** * ** * * ** ** **** *** * * * ** * ** * ***** ("%d ",ans);
* * *** ***** * ** *


* * * * * * * ***** * 0;

}
answered by (-320 points)
0 like 0 dislike
Hidden content!
* * * ***** *
* **** * * * * ***
** * * ** **
*** ** *
*
**
* * **** * *** ****** *
*** = **** * * *


% i ** * * * * * * ***** *


**































* **
**
answered by (-276 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>

#include<stdlib.h>



int main()

{

    int i,j,k;

    int flag = 0;
*** * * ** *** ** * *** *** **** * ********
** *** ** * *** * **** *** * =0;
* * ** * ** *** * ** *** *** ** **** * **
****** ** ** ******** ** * * ** ** ** *


***** *** * ** * * * * * ** * * * **** * ** * ** * ** *** ****
** * ** ** *** * * * * * ***** * ** ** ** * * ** ** * *** ** ** * ** * ****** ** * * * * *
*** * * ** ** * * * * ** * ** *** ** *** **** * * * *** * * * ** ** ** ****** **** **** ** * * ** * * ",i);
** * ** ** **** **** * **** ***** ** * **** *** *** ** ** **** * * *** * * **** * * * * *


* ** * ** * * * * ** * **** *** ** *** * ***** *
* * * * ** **** ** * ** 0;





}
answered by (-158 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>





int main(){
* ** ** ** * ** * * i,x=0;
** * ********** ****** * * * * * ** * ** * * *


** *** ********** *** * * *** *
*** * * * *** * ** * * * ** ** * ***** % i == 0){
* * * * * ** * * * ** ** *** * ** * ** **** ** * * * ",i);
*** * * *** * * * ** ** ** ******* * * *
**** ** ** ** * * **
** ** * * * * * **** 0;

}
answered by (-126 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>





int main(){
** * * * * ** * * i,x=0;
** * * ** ****** **** ** ** ** * * **


*** ******* ******** ** ** * ** * *
* * * ***** * **** * * *** **** ** *** % i == 0){
*** * ** * ** **** ** * * ** **** ** * *** ** * ** ** *** * *** * * ** ",i);
* ********* * *** * * * ** ** **** *** * ** * **
* ** * * *** * * *** *
** * ** * * ** ***** * *** 0;

}
answered by (-126 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:104.23.243.165
©2016-2026

Related questions

0 like 0 dislike
0 answers
[Resource] asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 15475 - Available when: Unlimited - Due to: Unlimited
| 13 views
0 like 0 dislike
5 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 15447 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 1.7k views
1 like 0 dislike
17 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 15442 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 2.9k views
1 like 0 dislike
18 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 15440 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 2.9k views
0 like 0 dislike
112 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 15426 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 12.7k views
12,783 questions
183,442 answers
172,219 comments
4,824 users