結果
問題 | No.193 筒の数式 |
ユーザー | EmKjp |
提出日時 | 2015-04-28 20:51:44 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 33 ms / 1,000 ms |
コード長 | 3,070 bytes |
コンパイル時間 | 1,141 ms |
コンパイル使用メモリ | 110,080 KB |
実行使用メモリ | 19,328 KB |
最終ジャッジ日時 | 2024-07-05 05:04:21 |
合計ジャッジ時間 | 2,237 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.IO;using System.Collections.Generic;using System.Globalization;using System.Linq;using System.Text;partial class Solver {int Evaluate(string s) {if (!Char.IsDigit(s.First())) return int.MinValue;if (!Char.IsDigit(s.Last())) return int.MinValue;s = s.Replace("-", " -");s = s.Replace("+", " +");return s.Split().Select(x => int.Parse(x)).Sum();}public void Run() {var S = ns();int ans = int.MinValue;for (int i = 0; i < S.Length; i++) {ans = Math.Max(ans, Evaluate(S));S = S.Substring(1) + S.Substring(0, 1);}cout.WriteLine(ans);}}// PREWRITEN CODE BEGINS FROM HEREpartial class Solver : Scanner {public static void Main(string[] args) {new Solver(Console.In, Console.Out).Run();}TextReader cin;TextWriter cout;public Solver(TextReader reader, TextWriter writer): base(reader) {this.cin = reader;this.cout = writer;}public Solver(string input, TextWriter writer): this(new StringReader(input), writer) {}public int ni() {return NextInt();}public long nl() {return NextLong();}public string ns() {return Next();}}public class Scanner {private TextReader Reader;private Queue<String> TokenQueue = new Queue<string>();private CultureInfo ci = CultureInfo.InvariantCulture;public Scanner(): this(Console.In) {}public Scanner(TextReader reader) {this.Reader = reader;}public int NextInt() { return Int32.Parse(Next(), ci); }public long NextLong() { return Int64.Parse(Next(), ci); }public double NextDouble() { return double.Parse(Next(), ci); }public string[] NextArray(int size) {var array = new string[size];for (int i = 0; i < size; i++) array[i] = Next();return array;}public int[] NextIntArray(int size) {var array = new int[size];for (int i = 0; i < size; i++) array[i] = NextInt();return array;}public long[] NextLongArray(int size) {var array = new long[size];for (int i = 0; i < size; i++) array[i] = NextLong();return array;}public String Next() {if (TokenQueue.Count == 0) {if (!StockTokens()) throw new InvalidOperationException();}return TokenQueue.Dequeue();}public bool HasNext() {if (TokenQueue.Count > 0)return true;return StockTokens();}private bool StockTokens() {while (true) {var line = Reader.ReadLine();if (line == null) return false;var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);if (tokens.Length == 0) continue;foreach (var token in tokens)TokenQueue.Enqueue(token);return true;}}}