Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
lab9tho
//gcc 5.4.0 #include <stdio.h> int main(void) { char array1[30]; char array2[30]; char array3[30]; char array4[30]; int k; int l; scanf("%s",array1); scanf("%s",array2); printf("%s\n",array1); printf("%s\n",array2); for(int i=0; i<30; ++i){ for(int j=0; j<30; ++j){ if(array1[i]==array2[j]){ array3[k]=array1[i]; k++; } if(array1[i]==array2[j]){ array1[i]=0; array2[j]=0; array4[l]=array1[i]; l++; } } printf("array4= %s\n",array4); printf("array3= %s \n",array3); return 0; } }
run
|
edit
|
history
|
help
0
TruncatablePrime
Assignment 4
IndiSelSort
Lab 9 v0.9
Pointer
150113_CribaErastotenes
Sizeof void
C_141210_esMayor
fun with signed casting
Building squares using smallest amount of matches