import fr.jussieu.script.*;
public class Methodes{
public static int somme3(int a, int b, int c)
{
return a+b+c;
}
@param@return
public static int somme_tab(int [] a)
{
int somme = 0;
for (int i=0; i < a.length; i++)
somme = somme + a[i];
return somme;
}
somme_tab()@param@return
public static double moyenne_tab(int [] a)
{
double somme = somme_tab(a);
return somme / a.length;
}
@paramx</CODE> et <CODE>y
public static int somme_carres(int x, int y)
{
int s = 0;
for (int i = x; i <= y; i++)
s = s + i*i;
return s;
}
char@paramchar@returnt
public static char [] renverse(char [] t)
{
char [] res;
res = new char [t.length];
for (int i = 0; i < t.length; i++)
res[i] = t[t.length-i-1];
return res;
}
public static boolean est_palindrome(char [] t)
{
char [] res = renverse(t);
for (int i = 0; i < t.length; i++)
if (res[i] != t[i])
return false;
return true;
}
public static boolean est_interne(int a, int b, int x, int y, double r)
{
double distance;
distance = Math.sqrt((x-a)*(x-a) + (y-b)*(y-b));
return distance < r;
}
public static boolean est_contenu_dans(int x1, int y1, int c1, int x2, int y2, int c2)
{
return (x2 >= x1) && (y2 >= y1) && (x2+c2 <= x1+c1) && (y2+c2 <= y1+c1);
}
public static boolean est_premier(int p)
{
if (p <= 1)
return false;
for (int i = 2; i <= p-1; i++)
if (p%i == 0)
return false;
return true;
}
public static int [] somme_2tab(int [] t1, int [] t2)
{
int [] res = new int [t1.length];
for (int i = 0; i < t1.length; i++)
res[i] = t1[i] + t2[i];
return res;
}
public static int nombre_multiples(int [] t, int n)
{
int nb_mul = 0;
for (int i = 0; i < t.length; i++)
if (t[i] % n == 0)
nb_mul++;
return nb_mul;
}
@return
public static int [] readTableauInt()
{
int n;
do
{
Deug.print("Entrez la taille (positive) du tableau : ");
n = Deug.readInt();
}
while (n <= 0);
int [] t = new int [n];
for (int i = 0; i < n; i++)
{
Deug.print("Entrez t[" + i + "] : ");
t[i] = Deug.readInt();
}
return t;
}
public static void main (String args[])
{
int [] t = readTableauInt();
Deug.print("Entrez un entier : ");
int n = Deug.readInt();
Deug.println("Il y a " + nombre_multiples(t,n) + " entiers dans le tableau divisibles par " + n);
}
}