C :

#include<stdio.h>
int main(){
	int a[10],i;
	for(i=0;i<10;i++){
		scanf("%d",&a[i]);
	}
	int h,ct=0;
	scanf("%d",&h);
	for(i=0;i<10;i++){
		if(h+30>=a[i]){
			ct++;
		}
	}
	printf("%d",ct);
	return 0;
}

C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	int a[10],h,c = 0;
	int i;
	for(i = 0;i < 10;i++){
		cin>>a[i];
	} 
	
	cin>>h;
	
	for(i = 0;i < 10;i++){
		if(h + 30 >= a[i]){
			c++;
		}
	} 
	
	cout<<c<<endl;
	 
    return 0;
}

Pascal :

var reads,for1,Hecan:integer; 
    apple:array[1..10] of integer; 
begin 
 for for1:=1 to 10 do read(apple[for1]); 
 readln(reads); 
 readln; 
 for for1:=1 to 10 do if reads+30>=apple[for1] then inc(Hecan); 
 writeln(Hecan); 
 readln; 
end.

Java :

import java.util.Scanner;



public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		
		int[] a=new int[10];
		for(int i=0;i<10;i++){
			a[i]=sc.nextInt();
		}
		int n=sc.nextInt();
		int k=getNum(a,n);
		System.out.println(k);
	}
	public static int getNum(int[] a,int n){
		int k=0;
		for(int i=0;i<a.length;i++){
			if(a[i]<=n+30){
				k++;
			}
		}
		return k;
	}
	
	
}

Python :

s = input().split()
n = int(input())
l = []
c = 0
for v in s:
    l.append(int(v))
for i in range(0, len(l)):
    if n + 30 >= l[i]:
        c += 1
print(c)