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

sample input:

12

sample output

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

reshown by | 55 views

37 Answers

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

#include * * *** ** **



int main()

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


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


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


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





 return 0;

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

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



int main()

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


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

printf(" ");
** * ** * ** ** ** **


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





 return 0;

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

using ** std;






* **** * main()
** ** **


* * * * * *** * * n;
* * *** * * ******* * * ***** n;
** * * ** * * * ***** * (int i = 1;i ** n; i++)
** * * * * * **** *** ** * int j = i;j ****** i;j++
*** * * * * * ***** *** ** * ** * '*';
* * ***** * * **** ********** ** **** * '\n';


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












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

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

#include * * ** *



int main()

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


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

printf(" ");
** * ***** * *


* * ** * * * **





 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(" ");

 return 0;

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

#include * ** * ** *



int main()

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


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


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


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



 return 0;

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

#include **** * ***



int main()

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


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


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

if(k < g-1)
* * * ** * **** ***** * ");
*** * * * ****** ** * *



 return 0;

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

#include * ** * *



int main()

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


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


* * * * *** * * *

if(k!=g-1)
* ** * **** ** ** *** * * * ");
***** *** ****** *******



 return 0;

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

#include * ***** * *



int main()

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


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


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



 return 0;

}
answered by (-122 points)
Get it on Google Play Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.68.65.180
©2016-2019

Related questions

0 like 0 dislike
0 answers
[Resource] asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
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)
Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 55 views
1 like 0 dislike
17 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 49 views
1 like 0 dislike
18 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 50 views
0 like 0 dislike
112 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 122 views
8,792 questions
72,353 answers
47,172 comments
2,043 users