結果
| 問題 | No.377 背景パターン |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-06-02 23:55:16 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 8,698 bytes |
| コンパイル時間 | 1,135 ms |
| コンパイル使用メモリ | 112,640 KB |
| 実行使用メモリ | 33,408 KB |
| 最終ジャッジ日時 | 2024-10-08 06:05:14 |
| 合計ジャッジ時間 | 4,716 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | WA | - |
| testcase_03 | RE | - |
| testcase_04 | AC | 25 ms
17,920 KB |
| testcase_05 | AC | 24 ms
17,792 KB |
| testcase_06 | WA | - |
| testcase_07 | AC | 24 ms
17,792 KB |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | RE | - |
| testcase_12 | WA | - |
| testcase_13 | AC | 36 ms
17,664 KB |
| testcase_14 | AC | 36 ms
17,920 KB |
| testcase_15 | WA | - |
| testcase_16 | RE | - |
| testcase_17 | AC | 2,254 ms
33,152 KB |
| testcase_18 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
public class Solver
{
public void Solve()
{
var h = sc.Long();
var w = sc.Long();
var k = sc.Long();
var pat = getPattern(getDivisors(h), getDivisors(w), k);
ModInteger ans = 0;
foreach (var x in pat)
foreach (var y in x) ans += y;
IO.Printer.Out.WriteLine(ans * ModInteger.Inverse(h * w));
}
List<long> getDivisors(long n)
{
var div = new List<long>();
for (long i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
div.Add(i);
if (i != (n / i)) div.Add(n / i);
}
}
div.Sort();
return div;
}
//a[i]=gcd(n,x)==iとなるxの数
long[] getCounts(List<long> A)
{
var n = A.Count;
var a = new long[n];
for (int i = n - 1; i >= 0; i--)
{
a[i] = A[n - 1] / A[i];
for (int j = i + 1; j < n; j++)
if (A[j] % A[i] == 0) a[i] -= a[j];
}
return a;
}
ModInteger[][] getPattern(List<long> A, List<long> B, long k)
{
var n = A.Count;
var m = B.Count;
var C = getCounts(A);
var D = getCounts(B);
var pat = Enumerate(n, x => new ModInteger[m]);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
var a = A[n - 1] / A[i];
var b = B[m - 1] / B[j];
var lcm = MathEx.LCM(a, b);
pat[i][j] = C[i] * D[j] * ModInteger.Pow(k, A[n - 1] * B[n - 1] / lcm);
}
return pat;
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
#endregion
#region gcd,lcm
static public partial class MathEx
{
static public Number GCD(Number x, Number y)
{
byte i = 0;
while (x != 0 && y != 0)
{
if (i == 0)
y %= x;
else x %= y;
i ^= 1;
}
return x == 0 ? y : x;
}
static public Number LCM(Number x, Number y)
{
return (x / GCD(x, y)) * y;
}
static public Number GCD(params Number[] a)
{
var gcd = a[0];
foreach (var x in a)
gcd = GCD(gcd, x);
return gcd;
}
}
#endregion
#region ModNumber
public partial struct ModInteger
{
public const long Mod = (long)1e9 + 7;
public long num;
public ModInteger(long n) : this() { num = n % Mod; if (num < 0) num += Mod; }
public override string ToString() { return num.ToString(); }
public static ModInteger operator +(ModInteger l, ModInteger r) { var n = l.num + r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; }
public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num + Mod - r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; }
public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger(l.num * r.num); }
public static ModInteger operator ^(ModInteger l, long r) { return ModInteger.Pow(l, r); }
public static implicit operator ModInteger(long n) { return new ModInteger(n); }
public static ModInteger Pow(ModInteger v, long k)
{
ModInteger ret = 1;
var n = k;
for (; n > 0; n >>= 1, v *= v)
{
if ((n & 1) == 1)
ret = ret * v;
}
return ret;
}
}
#endregion
#region Inverse
public partial struct ModInteger
{
static public ModInteger Inverse(ModInteger v)
{
long p, q;
ExGCD(v.num, Mod, out p, out q);
return new ModInteger(p % Mod + Mod);
}
static public long ExGCD(long a, long b, out long x, out long y)
{
var u = new long[] { a, 1, 0 };
var v = new long[] { b, 0, 1 };
while (v[0] != 0)
{
var t = u[0] / v[0];
for (int i = 0; i < 3; i++)
{
var tmp = u[i] - t * v[i];
u[i] = v[i];
v[i] = tmp;
}
}
x = u[1];
y = u[2];
if (u[0] > 0)
return u[0];
for (int i = 0; i < 3; i++)
u[i] = -u[i];
return u[0];
}
}
#endregion