#include <stdio.h>
 
int main()
{
   int nbIntervalles;
   scanf("%d", &nbIntervalles);
   for (int iIntervalle = 0; iIntervalle < nbIntervalles; iIntervalle = iIntervalle + 1)
   {
      int debut, fin;
      scanf("%d %d", &debut, &fin);
   }

   printf("%d\n",42);
   return 0;
}

#include <iostream>
using namespace std;
 
int main()
{
   int nbIntervalles;
   cin >> nbIntervalles;
   for (int iIntervalle = 0; iIntervalle < nbIntervalles; iIntervalle = iIntervalle + 1)
   {
      int debut, fin;
      cin >> debut >> fin;
   }

   cout << 42 << endl;
   return 0;
}

import algorea.Scanner;

class Main
{
   public static void main(String [] args)
   {
      Scanner input = new Scanner(System.in);
      int nbIntervalles = input.nextInt();
      for (int iIntervalle = 0; iIntervalle < nbIntervalles; iIntervalle = iIntervalle + 1)
      {
         int debut = input.nextInt();
         int fin = input.nextInt();
      }
      System.out.println(42);
   }
}

Notez bien l'utilisation de algorea.Scanner, le Scanner de Java étant trop lent et gourmand en mémoire, il est très fortement déconseillé de l'utiliser.

void main()
{
   int nbIntervalles = readInt();
   for (int iIntervalle = 0; iIntervalle < nbIntervalles; iIntervalle = iIntervalle + 1)
   {
      int debut = readInt();
      int fin = readInt();
   }
   println(42);
}

let read_int() = Scanf.scanf " %d" (fun x -> x)
let nbIntervalles = read_int()
let _ =
   for iIntervalle = 1 to nbIntervalles do
      let debut = read_int() in
      let fin   = read_int() in
      ()
   done;
   print_int 42;
   print_newline()

program Solution;
var
   iIntervalle, nbIntervalles, debut, fin: LongInt;
begin
   readln(nbIntervalles);
   for iIntervalle := 1 to nbIntervalles do
   begin
      readln(debut, fin);
   end;
   writeln(42)
end.

nbIntervalles = int(input())
for loop in range(nbIntervalles):
   debut, fin = map(int, input().split())

print(42)