結果
問題 | No.83 最大マッチング |
ユーザー |
![]() |
提出日時 | 2020-08-08 16:10:40 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 115 ms / 5,000 ms |
コード長 | 3,756 bytes |
コンパイル時間 | 2,765 ms |
コンパイル使用メモリ | 80,160 KB |
実行使用メモリ | 42,036 KB |
最終ジャッジ日時 | 2024-10-01 20:09:08 |
合計ジャッジ時間 | 4,261 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.net.ConnectException;import java.rmi.dgc.Lease;import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Arrays;import java.util.Collections;import java.util.Deque;import java.util.HashMap;import java.util.HashSet;import java.util.List;import java.util.Map;import java.util.NoSuchElementException;import java.util.Objects;import java.util.Set;import java.util.Stack;import java.util.TreeMap;import java.util.TreeSet;import static java.util.Comparator.*;public class Main {public static void main(String[] args) {Main main = new Main();main.solve();main.out.close();}// ======================================================================public void solve() {int N = ni();if(N % 2 == 0) {for (int i = 0; i < N/2; i++) {out.print(1);}out.println("");} else {out.print(7);for (int i = 0; i < N/2-1; i++) {out.print(1);}out.println("");}}// ------------------------------------------// ライブラリ// ------------------------------------------private PrintWriter out = new PrintWriter(System.out);// Scannerprivate FastScanner scan = new FastScanner();int ni(){ return scan.nextInt();}int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}int[][] ni(int y, int x){int[][] a = new int[y][x];for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}long nl(){return scan.nextLong();}long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}long[][] nl(int y, int x){long[][] a = new long[y][x];for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}String ns(){return scan.next();}String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}String[][] ns(int y, int x){String[][] a = new String[y][x];for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}}class FastScanner {private final InputStream in = System.in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public String next() {if (!hasNext()) throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();return (int) nl;}public double nextDouble() { return Double.parseDouble(next());}}