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

sample input:

12

sample output

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

reshown by | 5.1k views

33 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()

{
***** * * * * a,i,j,k;
****** *** * ** * *** ** ******* *** **
* * ** ** **** **** *
** *** * * **** * ** **** * ** **
**** * *** * ** * * * **

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

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



int main()

{
* * ** ** ** ** * * * i , j ;
*** * ** * ** * *
* **** * *** ****** **** * a ;
* **** ** ** *** *
* * ** * **** *** **** * ***** *** * ** , &a);

   

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








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

** * * * *** *

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

#include<math.h>

int main()

{
* * ** * ** * ** * * * * * i , j ;
*** ** ** ** * ** *
* * *** * * * * * * a ;
*** * * * * * *
** * ** * * * * *** * ** ***** , &a);

   

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








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

** ***** * **

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

#include<math.h>

int main()

{
*** * ** ****** ** * i , j ;
*** * **** * ** * **
***** * ** ** ** * * ** a ;
*** * ** * * ** * *** * *
*** * ** ** * * ** * * *** * , &a);

   

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






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

* * ******* *** ***

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



int main()

{
*** * **** * * i, j;
* * * * **** * * * * *** ***** * **** ** *
* * * * ** ** ** * * ** ** <=i;j++)
** ** *** *** * * ** **** * * * * ** ** * % j == 0)
** * * * * * ** ** * ***** **** * * ** * * * * ",j);
***** * * * * * * * ** ** 0;
* ** ** * ** * * ***

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

int * *

{
* *
* i=0;
******** * *** ** , * * ** *


* *** * ** ** *

{
* ***
*** * ** ** , i);

}


* 0;

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



int main()

{
** ***** * * *** **** * * **** i,k;
***** * * ***** ** ** * *
** * ** * ** ***** ** * ********** *


* * * * ** ** *** ** * *
* **** * ** * * * **
**** * * ** * *** * *** * = 1;k <= i;k++)
** * * ** ***** *** * % k == 0)
***** * ** ***** * * * * * ** * * ",k);
******** ** * * ** *

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

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



int main()

{
**** ** * * *** i,k;
** ** *** ** ****** *
* * * * * ** * *** ** ** * ** ** * * ***


*** * * * *** **** *
* * *** * * ** ** *
**** *** ***** **** = 1;k < i;k++)
****** * ** * ** * % k == 0)
* * ** * ** ** * * **** * * ***
** ** *** * ** * *

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

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

#include * *** * *** ***



int main(int argc, char *argv[])

{
* ** * ******* ******* n , k ,i;
** **** * *** * * * ** ** * * * **
** ** * ** * ******** ***
**** * **** * ** * ** *** * **** * ** * * * ** * *** * * **** ** * * * ");
* * *** * * *** ** * = 2; i <= n; i++){
* ** * *** ** ** * ** * *** **** * * ** *** * * ** * * * * * % i == 0)
* ****** ** * **** *** **** **** * ** ** ** ***** *** ** *** * *** *** * **** * ** * * *** * ",i);
* * * ** * * ***

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

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



int main()

{
* * * ** ** * **** * * i,k;
** **** *** * *** *
* * * * ** * * * *** ** * * * **** * ** ****


** ***** * ** ***** ***
***** * ** ** *
* **** * ****** ** = 0;k < i;k++)
* * * ** ******** * * * * % k == 0)
**** * * *** ***** * ** *** * **** ***** * *
* * ** * ** **** *

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

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

Related questions

0 like 0 dislike
5 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15448 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 1.4k views
0 like 0 dislike
11 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15441 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 2.8k views
0 like 0 dislike
73 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15439 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 9.4k views
0 like 0 dislike
41 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15427 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 6.3k views
0 like 0 dislike
28 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15421 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 4.8k views
12,783 questions
183,442 answers
172,219 comments
4,824 users