C :

#include <stdio.h>

int main(int argc, char const *argv[])
{
	int a[100];
	for (int i = 0; i < 100; ++i)
	{
		scanf("%d",&a[i]);
	}
	int x;
	scanf("%d",&x);
	int count = 0;
	for (int i = 0; i < 100; ++i)
	{
		if (x == a[i])
			count++;
	}
	printf("%d在数组a中出现的次数为%d\n",x,count);

	return 0;
}

C++ :

#include <iostream>
const int Max=100;
using namespace std;
int main(){
    int i,x,count=0;
    int a[Max];
    for(i=0;i<Max;i++){
        cin>>a[i];
    }
    cin>>x;
    for(i=0;i<Max;i++){
        if(a[i]==x)count++;
    }
    cout<<x<<"在数组a中出现的次数为"<<count;
	return 0;
}

Pascal :

var a:array[0..100] of longint;
    n,i,c:longint;
begin
  for i:=1 to 100 do
    read(a[i]);
  read(c);
  for i:=1 to 100 do
    if a[i]=c then
      inc(n);
  writeln(c,'在数组a中出现的次数为',n);
end.

Java :

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner in=new Scanner(System.in);
        while(in.hasNext()){
            int a[]=new int[100];
            int step=0;
            for(int i=0;i<100;i++){
                a[i]=in.nextInt();
            }
            int x=in.nextInt();
            for(int i=0;i<100;i++){
                if(a[i]==x){
                    step++;
                }
            }
            System.out.println(x+"在数组a中出现的次数为"+step);
        }
    }
}