#include <stdio.h>
void bubbleSort(int arr[], int n) {
int i, j, temp;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main() {
int n;
printf("Enter the size of the array: ");
scanf("%d", &n);
int a[n], b[n], count = 0;
printf("Enter the elements of the array: ");
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] > 0 && a[i] % 3 == 0) {
b[count] = a[i];
count++;
}
}
bubbleSort(b, count);
int prev = b[0];
int sameCount = 1;
for (int i = 1; i < count; i++) {
if (b[i] == prev) {
sameCount++;
} else {
prev = b[i];
}
}
printf("Number of similar elements: %d\n", sameCount);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+Cgp2b2lkIGJ1YmJsZVNvcnQoaW50IGFycltdLCBpbnQgbikgewogICAgaW50IGksIGosIHRlbXA7CiAgICBmb3IgKGkgPSAwOyBpIDwgbiAtIDE7IGkrKykgewogICAgICAgIGZvciAoaiA9IDA7IGogPCBuIC0gaSAtIDE7IGorKykgewogICAgICAgICAgICBpZiAoYXJyW2pdID4gYXJyW2ogKyAxXSkgewogICAgICAgICAgICAgICAgdGVtcCA9IGFycltqXTsKICAgICAgICAgICAgICAgIGFycltqXSA9IGFycltqICsgMV07CiAgICAgICAgICAgICAgICBhcnJbaiArIDFdID0gdGVtcDsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KfQoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIHByaW50ZigiRW50ZXIgdGhlIHNpemUgb2YgdGhlIGFycmF5OiAiKTsKICAgIHNjYW5mKCIlZCIsICZuKTsKCiAgICBpbnQgYVtuXSwgYltuXSwgY291bnQgPSAwOwogICAgcHJpbnRmKCJFbnRlciB0aGUgZWxlbWVudHMgb2YgdGhlIGFycmF5OiAiKTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgc2NhbmYoIiVkIiwgJmFbaV0pOwogICAgICAgIGlmIChhW2ldID4gMCAmJiBhW2ldICUgMyA9PSAwKSB7CiAgICAgICAgICAgIGJbY291bnRdID0gYVtpXTsKICAgICAgICAgICAgY291bnQrKzsKICAgICAgICB9CiAgICB9CgogICAgYnViYmxlU29ydChiLCBjb3VudCk7CiAgICAKICAgIGludCBwcmV2ID0gYlswXTsKICAgIGludCBzYW1lQ291bnQgPSAxOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPCBjb3VudDsgaSsrKSB7CiAgICAgICAgaWYgKGJbaV0gPT0gcHJldikgewogICAgICAgICAgICBzYW1lQ291bnQrKzsKICAgICAgICB9IGVsc2UgewogICAgICAgICAgICBwcmV2ID0gYltpXTsKICAgICAgICB9CiAgICB9CgogICAgcHJpbnRmKCJOdW1iZXIgb2Ygc2ltaWxhciBlbGVtZW50czogJWRcbiIsIHNhbWVDb3VudCk7CgogICAgcmV0dXJuIDA7Cn0=