0 like 0 dislike
3.7k views

13. Please write a program that receives 1, then outputs number 1-9.

Template

#include <stdio.h>
int main(int argc, char *argv[]){
int i;
scanf("%d",&i); // DO NOT CHANGE // No need to use printf("Enter number:")

// your condition starts from here

return 0;
}

Input

1

Acceptable Output1

123456789

Acceptable Output2

1 2 3 4 5 6 7 8 9

 

[Exam] asked in Mid-term examination by (5.9k points)
ID: 32015 - Available when: Unlimited - Due to: 2017-11-15 16:30
| 3.7k views

19 Answers

0 like 0 dislike
Hidden content!
* ** * ** *** **** * *
** * * ** *** ***

** * *** * * *** *** * or ** * *** ** *** * *** *** * or * * **

* ** * * * * ** * {
** * ** * * i;
** **
* * * ** ** *** * * 1 * 9 */
* * * * * ** = i * 9; i * * i 1 ** i = i + 1
* *** * *** * * * * ** ** ** ** *** * * ***** *
***** ** **** }
*** * ** ** * *
**** * **

* ** ****

}
100/100 answered by (183 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Correct output
0 like 0 dislike
Hidden content!
** * ** * * *
int * * * * char *** **
** * i;
** ** ** * **** ** // DO NOT *** // No ** to use * * * * ** ***

* *** ** *
** * *** ** **** ** * * **** * * * ** * * ** * i);
}

* ** 0;
}
100/100 answered by (153 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Wrong output
0 like 0 dislike
Hidden content!
** * * * **** *
* ** * * * * * ***
int i;
* ** ****** ***** *** // DO NOT // No ** to use **** * ** * * * * ** *

// * * ** ** * * *
** ** **** ***
*** * ** ** * * ** * * ** * ***** ** * ** ** * i);
}

* ** 0;
}
100/100 answered by (283 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Wrong output
0 like 0 dislike
Hidden content!
* * ** * * ** * *
** ** * * * *
* i;
* ***** * * * * * * // DO NOT * // No need to use * *** ** **

// * * ** * ***
** *** ****** *** ** *****
* * * * ****** * **
* ** ** **


* 0;
}
100/100 answered by (254 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Wrong output
0 like 0 dislike
Hidden content!
* *** * ** * *
* * * **** ** ***
** i;
** ** ** * *
*** **** **
{
*** * * ** * * ** ** i);
* * * ** * * i = i + 1;
** * * ** != 1);
* ** * **** ** * ** * * * **
** ** **** // DO NOT * // No to * * * * * ** * *** * ****

// * * * ** *** * **

* *** 0;
}
100/100 answered by (246 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Correct output
0 like 0 dislike
Hidden content!
* * ** ** ** *
int * ** ** ** **
** * i;
* ** ** * * ** ** **
* = 1; * * *
* ** * ** ** ** * ** i);
}

* * 0;
}
100/100 answered by (220 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Correct output
0 like 0 dislike
Hidden content!
* * * * * ** ***
** * ** *** * ** * *
*** i;
** ** *** * *** ** *** // DO NOT * // No * to use * * **** * *** **** *

// *** * * ** here
* * * * * * ** i ** **
* * ** *** **


** 0;
}
100/100 answered by (221 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Wrong output
0 like 0 dislike
Hidden content!
* ** * ****
int * *** char * *
int i;
** ** * ** *** * * *

* * * **** ** * ** *
*** ** *** ** *** ** * *
}

* 0;
}
100/100 answered by (273 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Wrong output
0 like 0 dislike
Hidden content!
* * * ** *****
int * * argc, char * * **
int i;
* ** * * ** * * *** *
*** ** * ** i=0; * **** ; i=i+1);
* ** ** **** * ** ** *** *** *
** ** * ***
* * ** * * i=0; * * ; i=i+1 );
* ** ******** ******* * * * **** ***
* * * 0;
}
1/100 answered by (449 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
0 like 0 dislike
Hidden content!
*** * ** ****
** * ** * **
* i = 1;
** * * * * *** *
*** * ** 9){
*** * * *** * * * * ** **** ** i);
** ** * *** ** i = i *
}


*** 0;
}
100/100 answered by (243 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:104.23.187.20
©2016-2025

Related questions

0 like 0 dislike
18 answers
[Exam] asked Nov 14, 2017 in Mid-term examination by nat236919 (5.9k points)
ID: 32199 - Available when: Unlimited - Due to: 2017-11-15 16:30
| 4k views
0 like 0 dislike
21 answers
[Exam] asked Nov 15, 2017 in Mid-term examination by nat236919 (5.9k points)
ID: 32690 - Available when: Unlimited - Due to: 2017-11-15 16:10
| 4.2k views
0 like 0 dislike
22 answers
[Exam] asked Nov 14, 2017 in Mid-term examination by nat236919 (5.9k points)
ID: 31995 - Available when: Unlimited - Due to: 2017-11-15 16:10
| 2.4k views
0 like 0 dislike
22 answers
[Exam] asked Nov 14, 2017 in Mid-term examination by nat236919 (5.9k points)
ID: 31983 - Available when: Unlimited - Due to: 2017-11-15 16:10
| 2.4k views
0 like 0 dislike
21 answers
[Exam] asked Nov 14, 2017 in Mid-term examination by nat236919 (5.9k points)
ID: 31979 - Available when: Unlimited - Due to: Unlimited
| 2.2k views
12,783 questions
183,442 answers
172,219 comments
4,824 users