C :

#include <stdio.h>
#include <stdlib.h>
 
int main()
{
    int appleh[10], benchh, taoh, bentaoh, i;
    benchh = 30;   
    for (i=0; i<10; i++)   
    {
        scanf("%d", &appleh[i]);
    }
    scanf("%d", &taoh);     
    bentaoh = benchh + taoh;   
    int n = 0;
    for (i=0; i<10; i++)
    {
        if(appleh[i] <= bentaoh)
        {
            n++;  
        }
    }
    printf("%d\n", n);
    return 0;
}

C++ :

#include <cstdlib>
#include <cstdio>
int high[11];
using namespace std;
int main()
{
	int d_input;
	for(int i=1;i<=10;i++)
	{
		scanf("%d",&d_input);
		high[i]=d_input;
	}
	scanf("%d",&d_input);
	int max=d_input+30;
	int can=0;
	for(int i=1;i<=10;i++)
	{
		if(max>=high[i])
		{
			can++;
		}
	}
	printf("%d",can);
	//system("pause");
	return 0;
}

Pascal :

var n,i,zf:longint;
    a:array[1..100] of longint;
begin
  zf:=0;
  for i:=1 to 10 do read(a[i]);
  readln(n);
  for i:=1 to 10 do
      if a[i]<=n+30 then zf:=zf+1;
  writeln(zf);
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input=new Scanner(System.in);
		int []a=new int[10];
		for (int i = 0; i < a.length; i++) {
			a[i]=input.nextInt();
		}
		int t=input.nextInt();
		int sum=t+30;
		int count=0;
		for (int i = 0; i < a.length; i++) {
			if(a[i]<=sum) {
				count++;
			}
		}
		System.out.println(count);
	}

}