TP N 10 : Gestion des fichiers Langage JAVA Rappel : Exemple d utilisation de FileReader/FileWriter import java.io.*; public class Copy public static void main(string[] args) throws IOException File inputfile = new File("in.txt"); File outputfile = new File("out.txt"); FileReader in = new FileReader(inputFile); FileWriter out = new FileWriter(outputFile); int c; while ((c = in.read())!= -1) out.write(c); BufferedReader et PrintWriter Utiles pour la lecture et l'écriture de fichiers textes. BufferedReader in = new BufferedReader(new FileReader("in.txt")); String str; while ((str=in.readline())!= null) // faire quelque chose avec la ligne System.out.println(str); BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); PrintWriter out = new PrintWriter(new FileWriter("in.txt")); out.println(in.readline().tolowercase().tostring()); out.println(in.readline().tostring()); Page 1
Exemple : 2 4 5 12 9 4 16 25 144 81 in.txt out.txt import java.io.*; public class Copy public static void main(string[] args) try BufferedReader in = new BufferedReader(new FileReader("file/in.txt")); PrintWriter out = new PrintWriter(new FileWriter("file/out.txt")); String str; while(((str = in.readline())!= null)) out.println((int)math.pow(integer.parseint(str), 2)); catch (FileNotFoundException e) System.out.println("Fichier introuvable"); catch (IOException e) e.getmessage(); La classe File Une classe qui permet de manipuler des fichiers et des répertoires sans toutefois accéder aux données dans les fichiers. File myfile = new File("file"); // Si on se trouve dans le répertoire courant String relative = myfile.getpath(); // retourne "fichier.txt" System.out.println(relative); String absolute = myfile.getabsolutepath(); System.out.println(absolute); // C:\Users\lachgar\workspace\Exception\in.txt System.out.println(absolute); boolean there = myfile.exists(); // vrai ou faux si le fichier existe ou non System.out.println(there); boolean checkdir = myfile.isdirectory(); // si le fichier est un répertoire System.out.println(checkDir); long mylength = myfile.length(); // taille du fichier. System.out.println(myLength); // retourne les différents fichiers dans un répertoire String[] allfiles = myfile.list(); for(string st : allfiles) System.out.println(st); Page 2
ObjectInputStream et ObjectOutputStream permettent de lire et écrire des objets sur un stream. Un objet doit implémenter l'interface Serializable pour pouvoir être écrit ou lu. L'interface Serializable contient les deux méthodes suivantes : private void readobject(java.io.objectinputstream stream) throws IOException, ClassNotFoundException; private void writeobject(java.io.objectoutputstream stream) throws IOException; Exemple: class Etudiant implements Serializable String nom; String prenom; double note; Etudiant(String n, String p, double n) nom = n; prenom = p; note = n; private void readobject(java.io.objectinputstream stream) nom = (String) stream.readobject(); prenom = (String) stream.readobject(); note = stream.readdouble(); private void writeobject(java.io.objectoutputstream stream) stream.writeobject(nom); stream.writeobject(prenom); stream.writedouble(note); Etudiant e = new Etudiant("salhi","samir",90); FileOutputStream fos = new FileOutputStream("etd.tmp"); ObjectOutputStream oos = new ObjectOutputStream(fos); oos.writeobject(e); oos.close(); FileInputStream fis = new FileInputStream("t.tmp"); ObjectInputStream ois = new ObjectInputStream(fis); Etudiant e2 = (Etudiant) ois.readobject(); ois.close(); Page 3
Problem A : Nombres opposés Etant donné un tableau d'entiers non nuls, trouvez combien il y a d'entiers distincts positifs dont l'opposé est aussi dans le tableau. Par exemple, pour le tableau de taille 15 qui suit: -3 4 2 8 9 1-3 -8-4 2 8 2-8 1 3 il faut afficher 3. En effet, les trois entiers 3, 4, et 8 ont aussi leur opposé dans le tableau. LIMITES DE TEMPS ET DE MEMOIRE (Langage : C++) Temps : 1s sur une machine à 1Ghz. Mémoire : 16000 Ko. CONTRAINTES 1 <= N <= 20000, où N est le nombre d'éléments du tableau. -10<SUP>8</SUP> < X < 10<SUP>8</SUP>, et X différent de 0, où X est un élément du tableau. De plus, dans 50% des tests, on a : 1 <= N <= 1000. ENTRÉE La première ligne de l'entrée contient un entier N, la taille du tableau. La deuxième ligne contient N entiers séparés par des espaces : les éléments du tableau. SORTIE Vous devez écrire une ligne sur la sortie, contenant un entier K : le nombre d'entiers distincts X > 0, tels que X et X appartiennent tous les deux au tableau. EXEMPLE entrée : 15-3 4 2 8 9 1-3 -8-4 2 8 2-8 1 3 sortie : 3 Page 4
Solution : import java.io.*; import java.util.iterator; import java.util.set; import java.util.stringtokenizer; import java.util.treeset; public class ProblemeA public static void main(string[] args) throws IOException BufferedReader in = new BufferedReader(new FileReader("file/in.txt")); PrintWriter out = new PrintWriter(new FileWriter("file/out.txt")); int n = Integer.parseInt(in.readLine().toString()); StringTokenizer st = new StringTokenizer(in.readLine()," "); Set <Integer> set = new TreeSet<Integer>(); Set <Integer> set2 = new TreeSet<Integer>(); while(st.hasmoreelements()) set.add(integer.parseint(st.nextelement().tostring())); int size1 = set.size(); Iterator<Integer> it = set.iterator(); while(it.hasnext()) set2.add(math.abs(it.next())); out.println(size1 - set2.size()); Page 5
Problem B Binary Addition Source file: bin.c bin.cpp bin.java, Input file: bin.in, output file: bin.out Problem Description Adding binary numbers is a very simple task, and very similar to the longhand addition of decimal numbers. As with decimal numbers, you start by adding the bits (digits) one column at a time, from right to left. Unlike decimal addition, there is little to memorize in the way of rules for the addition of binary bits: 0 + 0 = 0 1 + 0 = 1 0 + 1 = 1 1 + 1 = 10 1 + 1 + 1 = 11 Just as with decimal addition, when the sum in one column is a two-bit (two-digit) number. the least significant figure is written as part of the total sum and the most significant figure is "carried" to the next left column. Consider the following examples: 11 1 <-- Carry bits --> 1 11 1001101 1001001 1000111 + 0010010 + 0011001 + 1010110 --------- --------- --------- 1011111 1100010 10011101 The addition problem on the left did not require any bits to be carried, since the sum of bits in each column was either 1 or 0, not 10 or 11. In the other two problems, there definitely were bits to be carried, but the process of addition is still quite simple. Input Specifications The first line of input contains an integer N, (1 <= N <= 1000), which is the number of binary addition problems that follow. Each problem appears on a single line containing two binary values separated by a single space character. The maximum length of each binary value is 80 bits (binary digits). Note: The maximum length result could be 81 bits (binary digits). Output Specifications For each binary addition problem, print the problem number, a space, and the binary result of the addition. Extra leading zeroes must be omitted. Sample Input/Output bin.in 3 1001101 10010 1001001 11001 1000111 1010110 1 1011111 2 1100010 3 10011101 bin.out Page 6
Solution : import java.io.bufferedreader; import java.io.filereader; import java.io.filewriter; import java.io.ioexception; import java.io.printwriter; import java.math.biginteger; import java.util.stringtokenizer; public class Bin public static void main(string[] args) throws NumberFormatException, IOException int N,i, var = 0; BigInteger a, b; StringTokenizer st = null; BufferedReader in = new BufferedReader(new FileReader("bin.in")); PrintWriter out = new PrintWriter (new FileWriter("bin.out")); N = Integer.parseInt(in.readLine()); for( i = 1 ; i <= N ; i++) st = new StringTokenizer(in.readLine()); st.hasmoretokens(); a = new BigInteger(st.nextToken(), 2); b = new BigInteger(st.nextToken(), 2); if (var!=0) out.println(""); var = 1; out.print(i+" "+a.add(b).tostring(2)); Page 7
Problem B Good triangle Source file: good.c good.cpp good.java, Input file: good.in, output file: good.out Problem Description The n th Triangular number, T(n) = 1 +... + n, is the sum of the first n integers. It is the number of points in a triangular array with n points on side. For example T(4): Write a program to compute the weighted sum of triangular numbers: W (n) = SUM[k = 1..n; k*t(k+1)] Input Specifications The first line of input contains a single integer N, (1 N 1000) which is the number of datasets that follow. Each dataset consists of a single line of input containing a single integer n, (1 n 300), which is the number of points on a side of the triangle. Output Specifications For each dataset, output on a single line the dataset number, (1 through N), a blank, the value of n for the dataset, a blank, and the weighted sum: W (n), of triangular numbers for n. Sample Input/Output 4 3 4 5 10 good.in 1 3 45 2 4 105 3 5 210 4 10 2145 good.out Page 8
Solution : import java.io.bufferedreader; import java.io.filereader; import java.io.filewriter; import java.io.ioexception; import java.io.printwriter; public class Good static int T(int n) int i,s = 0; for(i = 1;i <= n; i++) s+= i; return s; static int w(int n) int s = 0,k; for(k = 1;k <= n;k++) s+= k * T(k + 1); return s; public static void main(string[] args) throws NumberFormatException, IOException int N,n,i, var = 0; BufferedReader in = new BufferedReader(new FileReader("good.in")); PrintWriter out = new PrintWriter (new FileWriter("good.out")); N = Integer.parseInt(in.readLine()); for( i = 1 ; i <= N ; i++) n = Integer.parseInt(in.readLine()); if (var!=0) out.println(""); var = 1; out.print(i+" "+n+" "+w(n)); Page 9