結果

問題 No.73 helloworld
ユーザー femtofemto
提出日時 2015-04-01 22:13:42
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 25 ms / 5,000 ms
コード長 4,996 bytes
コンパイル時間 2,270 ms
コンパイル使用メモリ 111,104 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-06-29 01:38:09
合計ジャッジ時間 2,197 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 14
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;
class Solution {
Dictionary<char, long> dic = new Dictionary<char, long>();
void calc() {
for (char c = 'a'; c <= 'z'; c++) {
var r = rl();
dic[c] = r;
}
long ans = 1;
foreach (var c in new char[] { 'd', 'e', 'h', 'l', 'o', 'r', 'w' }) {
long rem, max = 0;
switch (c) {
case 'l':
rem = dic[c] - 3;
if (rem < 0) {
ans = 0;
break;
}
for (int i = 0; i <= rem; i++) {
long m = ((2 + i) * (2 + i - 1) / 2) * (1 + rem - i);
max = Math.Max(max, m);
}
ans *= max;
break;
case 'o':
rem = dic[c] - 2;
if (rem < 0) {
ans = 0;
break;
}
for (int i = 0; i <= rem; i++) {
long m = (1 + i) * (1 + rem - i);
max = Math.Max(max, m);
}
ans *= max;
break;
default:
rem = dic[c] - 1;
if (rem < 0) {
ans = 0;
break;
}
ans *= 1 + rem;
break;
}
}
Console.WriteLine(ans);
}
static void Main(string[] args) {
new Solution().calc();
}
#region
static int ri() { return int.Parse(Console.ReadLine()); }
static int[] ria(int n) {
if (n <= 0) { Console.ReadLine(); return new int[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
}
static void rio(out int p1) { p1 = ri(); }
static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 =
        r[4]; }
static long rl() { return long.Parse(Console.ReadLine()); }
static long[] rla(int n) {
if (n <= 0) { Console.ReadLine(); return new long[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
}
static void rlo(out long p1) { p1 = rl(); }
static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5
        = r[4]; }
static double rd() { return double.Parse(Console.ReadLine()); }
static double[] rda(int n) {
if (n <= 0) { Console.ReadLine(); return new double[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
}
static void rdo(out double p1) { p1 = rd(); }
static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4
        = r[3]; p5 = r[4]; }
static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
static void wa2<T>(T[][] a) {
foreach (var row in a) {
Debug.WriteLine(String.Join(" ", row));
}
}
[DebuggerDisplay("{x} , {y}")]
class point {
public int x, y;
public point(int x, int y) {
this.x = x; this.y = y;
}
}
#endregion
}
static class Extention {
public static T[][] ToJagArray<T>(this T[,] a) {
int n = a.GetLength(0), m = a.GetLength(1);
var ret = new T[n][];
for (int i = 0; i < n; i++) {
ret[i] = new T[m];
for (int j = 0; j < m; j++) {
ret[i][j] = a[i, j];
}
}
return ret;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0