Run Code
|
Code Wall
|
Users
|
Misc
|
Feedback
|
About
|
Login
|
Theme
|
Privacy
Arrays
//clang 3.8.0 #include <stdio.h> int main(void) { int i, A[5],B[5],C[10]; printf("Enter 5 nos."); for(i=0;i<5;i++) { scanf("%d",A[i]); } printf("\nEnter next 5 nos."); for(i=0;i<5;i++) { scanf("%d",B[i]); } for(i=0;i<5;i++) { C[i]=A[i]; C[5+i]=B[i]; } printf("\nThe 3rd set is"); for(i=0;i<10;i++) { printf("%d",C[i]); } return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Numero pi Euler
Graph Depth First Search
Regiones A y B
lab7_OOP 0.3 alha
Bit string printer
Max number of a vector
Recursividad: Hanoi
Vending machine
Find the length of largest subarray with equal number of 0's and 1's using recursion
Triangulo Lateral Izquierdo
Please log in to post a comment.