結果

問題 No.316 もっと刺激的なFizzBuzzをください
ユーザー nanophoto12
提出日時 2015-12-13 08:42:53
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 33 ms / 1,000 ms
コード長 2,085 bytes
コンパイル時間 2,127 ms
コンパイル使用メモリ 107,776 KB
実行使用メモリ 19,584 KB
最終ジャッジ日時 2024-11-21 11:56:32
合計ジャッジ時間 3,136 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 33
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.Text;
namespace No316
{
    class MainClass
    {
        private static long Pow(long value, long pow){
            long result = 1;
            for (int i = 0; i < pow; i++) {
                result *= value;
            }
            return result;
        }
        private static long Multiply(Dictionary<long, int> first, Dictionary<long, int> second){
            long value = 1;
            var firstCopy = new Dictionary<long, int> (first);
            var secondCopy = new Dictionary<long, int> (second);
            foreach (var keyValue in firstCopy) {
                long mul = keyValue.Value;
                if(secondCopy.ContainsKey(keyValue.Key)){
                    mul = Math.Max(mul, secondCopy[keyValue.Key]);
                    secondCopy.Remove (keyValue.Key);
                }
                value *= Pow (keyValue.Key, mul);
            }
            foreach (var keyValue in secondCopy) {
                value *= Pow (keyValue.Key, keyValue.Value);
            }
            return value;
        }
        private static Dictionary<long, int> Split(long value)
        {       
            var cache = value;
            Dictionary<long, int> dic = new Dictionary<long, int> ();   
            for (long i = 2; i * i <= cache; i++) {
                while (value % i == 0) {
                    if (!dic.ContainsKey (i)) {
                        dic.Add (i, 0);
                    }
                    dic [i]++;
                    value /= i;
                }
            }
            if (value != 1) {
                dic.Add (value, 1);
            }
            return dic;
        }
            
        public static void Main (string[] args)
        {
            var n = Convert.ToInt64(Console.ReadLine ());
            var keys = Console.ReadLine ().Split(' ').Select(a=>Convert.ToInt64(a)).ToList();
            var aCount = n / keys [0];
            var bCount = n / keys [1];
            var cCount = n / keys [2];
            var aFactor = Split (keys [0]);
            var bFactor = Split (keys [1]);
            var cFactor = Split (keys [2]);
            var ab = Multiply (aFactor, bFactor);
            var bc = Multiply (bFactor, cFactor);
            var ca = Multiply (cFactor, aFactor);
            var abCount = n / ab;
            var bcCount = n / bc;
            var caCount = n / ca;
            var caFactor = Split (ca);
            var abc = Multiply (bFactor, caFactor);
                    
            var abcCount = n / abc;
            var sum = aCount + bCount + cCount - abCount - bcCount - caCount + abcCount;
            Console.WriteLine(sum.ToString());
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0