zoukankan      html  css  js  c++  java
  • 输入流输出流打印到文件

    蓝桥杯真题,

    package demo2;
    
    import java.io.File;
    import java.io.FileNotFoundException;
    import java.io.PrintStream;
    import java.math.BigInteger;
     
    public class Main8 {
     
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            try {
                PrintStream out = System.out;
                PrintStream ps = new PrintStream(new File("ans.txt"));
                System.setOut(ps);
                work(123456);
                System.setOut(out);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
         
        
        }
        
        private static void work(int n) {
            BigInteger x = BigInteger.valueOf(2);
            BigInteger y = BigInteger.valueOf(3);
            
            for(int i = 1; i < n; ++i) {
                BigInteger tmp1 = x.multiply(BigInteger.valueOf(2)).subtract(y.multiply(BigInteger.valueOf(3)));
                BigInteger tmp2 = x.multiply(BigInteger.valueOf(3)).add(y.multiply(BigInteger.valueOf(2)));
                x = tmp1;
                y = tmp2;
            }
            System.out.println(x + "" + y + "i");
        }
     
    }
    
     

     输入输出流:

    public static void main(String[] args) throws IOException {
                FileInputStream f2 = new FileInputStream("ans.txt"); 
                File f1 =new File("ant.txt");
                InputStreamReader ps = new InputStreamReader(f2,"utf8");
                PrintStream pw = new PrintStream(new FileOutputStream(f1));
                BufferedReader ff = new BufferedReader(ps);
                System.setOut(pw);
                  String i;
                  while((i=ff.readLine())!=null){
                      System.out.println(i);
                  }
                 
            }
  • 相关阅读:
    自主学习1
    动手动脑10.28
    《程序员修炼之道》阅读笔记三
    《程序员修炼之道》阅读笔记
    11月20,21,22训练赛
    Rabbits(跳兔子)
    01背包变式(并查集+dp01背包)
    问题 I: 约会序列(两边枚举)
    问题 J: 直角三角形
    Cow Exhibition (01背包的负数处理)
  • 原文地址:https://www.cnblogs.com/ls-pankong/p/10568053.html
Copyright © 2011-2022 走看看