C :

#include "stdio.h"
int main()
{
    int n=31;
    printf("%d\n",n);
}

C++ :

#include<bits/stdc++.h>
using namespace std;
int main()
{cout<<31;
}

Pascal :

var i,j,k,l,h,g,sum:longint;
f:array[0..42] of boolean;
begin
for i:=0 to 1 do
     for j:=0 to 1 do
         for k:=0 to 1 do
             for l:=0 to 1 do
                 for h:=0 to 1 do
                     for g:=0 to 1 do
                          f[i*2+j*3+k*5+l*7+h*10+g*15]:=true;
for i:=1 to 42 do
     if f[i] then
        inc(sum);
     writeln(sum);
end.

#include<stdio.h> int main(void){ int a[6] = { 2,3,5,7,10,15 }, sums[100]; int sum = 0, i, count=0, mid; for (i = 1; i <64; i++) { sum = 0; for (int j = 0; j <6; j++) { if (i & (1 << j)) { sum += a[j]; } } sums[count] = sum; count++; } int unique = 0; for (i = 0; i < count; i++) { mid = 1; for (int j = 0; j < i; j++) { if (sums[i] == sums[j]) { mid = 0; break; } } if (mid) { unique++; } } printf("%d", unique); return 0; }