結果
問題 | No.347 微分と積分 |
ユーザー |
![]() |
提出日時 | 2016-03-08 17:22:23 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 118 ms / 5,000 ms |
コード長 | 3,124 bytes |
コンパイル時間 | 2,306 ms |
コンパイル使用メモリ | 79,988 KB |
実行使用メモリ | 54,688 KB |
最終ジャッジ日時 | 2024-09-24 14:54:45 |
合計ジャッジ時間 | 5,682 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 |
ソースコード
import java.io.InputStream;import java.io.IOException;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Arrays;import java.util.Comparator;import java.util.InputMismatchException;import java.util.NoSuchElementException;import java.math.BigInteger;import java.text.DecimalFormat;public class Main{static PrintWriter out;static InputReader ir;static void solve(){int n=ir.nextInt();double b=ir.nextDouble();double[] a=new double[n];for(int i=0;i<n;i++) a[i]=ir.nextDouble();DecimalFormat df=new DecimalFormat("0.00000000");double x1=0.0,x2=0.0;for(int i=0;i<n;i++) x1+=a[i]*Math.pow(b,a[i]-1.0);for(int i=0;i<n;i++) x2+=(a[i]==-1.0)?Math.log(b):Math.pow(b,a[i]+1.0)/(a[i]+1.0);out.println(df.format(x1));out.println(df.format(x2));}public static void main(String[] args) throws Exception{ir=new InputReader(System.in);out=new PrintWriter(System.out);solve();out.flush();}static class InputReader {private InputStream in;private byte[] buffer=new byte[1024];private int curbuf;private int lenbuf;public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}public boolean hasNextByte() {if(curbuf>=lenbuf){curbuf= 0;try{lenbuf=in.read(buffer);}catch(IOException e) {throw new InputMismatchException();}if(lenbuf<=0) return false;}return true;}private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}public boolean hasNext(){skip(); return hasNextByte();}public String next(){if(!hasNext()) throw new NoSuchElementException();StringBuilder sb=new StringBuilder();int b=readByte();while(!isSpaceChar(b)){sb.appendCodePoint(b);b=readByte();}return sb.toString();}public int nextInt() {if(!hasNext()) throw new NoSuchElementException();int c=readByte();while (isSpaceChar(c)) c=readByte();boolean minus=false;if (c=='-') {minus=true;c=readByte();}int res=0;do{if(c<'0'||c>'9') throw new InputMismatchException();res=res*10+c-'0';c=readByte();}while(!isSpaceChar(c));return (minus)?-res:res;}public long nextLong() {if(!hasNext()) throw new NoSuchElementException();int c=readByte();while (isSpaceChar(c)) c=readByte();boolean minus=false;if (c=='-') {minus=true;c=readByte();}long res = 0;do{if(c<'0'||c>'9') throw new InputMismatchException();res=res*10+c-'0';c=readByte();}while(!isSpaceChar(c));return (minus)?-res:res;}public double nextDouble(){return Double.parseDouble(next());}public int[] nextIntArray(int n){int[] a=new int[n];for(int i=0;i<n;i++) a[i]=nextInt();return a;}public long[] nextLongArray(int n){long[] a=new long[n];for(int i=0;i<n;i++) a[i]=nextLong();return a;}public char[][] nextCharMap(int n,int m){char[][] map=new char[n][m];for(int i=0;i<n;i++) map[i]=next().toCharArray();return map;}}}