結果
| 問題 | No.195 フィボナッチ数列の理解(2) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-26 02:50:22 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,271 bytes |
| コンパイル時間 | 4,258 ms |
| コンパイル使用メモリ | 115,836 KB |
| 実行使用メモリ | 22,800 KB |
| 最終ジャッジ日時 | 2023-09-20 13:17:42 |
| 合計ジャッジ時間 | 5,147 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 54 ms
20,612 KB |
| testcase_01 | AC | 54 ms
20,696 KB |
| testcase_02 | AC | 55 ms
22,736 KB |
| testcase_03 | AC | 54 ms
20,688 KB |
| testcase_04 | AC | 52 ms
20,408 KB |
| testcase_05 | AC | 54 ms
20,692 KB |
| testcase_06 | AC | 55 ms
22,744 KB |
| testcase_07 | AC | 55 ms
22,744 KB |
| testcase_08 | AC | 53 ms
18,648 KB |
| testcase_09 | AC | 54 ms
20,704 KB |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | AC | 54 ms
22,764 KB |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | AC | 55 ms
22,688 KB |
| testcase_19 | AC | 54 ms
20,804 KB |
| testcase_20 | AC | 52 ms
20,488 KB |
| testcase_21 | WA | - |
| testcase_22 | AC | 53 ms
22,592 KB |
| testcase_23 | AC | 54 ms
20,608 KB |
| testcase_24 | AC | 51 ms
20,432 KB |
コンパイルメッセージ
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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var p = sc.Long();
var q = sc.Long();
var r = sc.Long();
var fib1 = new long[46];
var fib2 = new long[46];
fib1[0] = 1;
fib2[1] = 1;
for (int i = 2; i < 46; i++)
{
fib1[i] = fib1[i - 1] + fib1[i - 2];
fib2[i] = fib2[i - 1] + fib2[i - 2];
}
var ans = Pair.Create(long.MaxValue, long.MaxValue);
Func<long, long, bool> check = (x, y) =>
{
if (x <= 0 || y <= 0) return false;
for (int k = 0; k < 46; k++)
{
if (x * fib1[k] + y * fib2[k] == r)
return true;
}
return false;
};
for (int i = 0; i < 46; i++)
for (int j = 0; j < 46; j++)
{
var a = fib1[i]; var b = fib2[i];
var c = fib1[j]; var d = fib2[j];
long x, y;
if (a == 0)
{
if (p % b == 0)
{
x = 1; y = p / b;
if (c * x + d * y == q && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
}
}
else if (b == 0)
{
if (p % a != 0)
{
x = p / a; y = 1;
if (c * x + d * y == q && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
}
}
else if (c == 0)
{
if (q % d == 0)
{
x = 1; y = q / d;
if (a * x + b * y == p && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
}
}
else if (d == 0)
{
if (q % c == 0)
{
x = p / c; y = 1;
if (a * x + b * y != p && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
}
}
else
{
var gcdac = MathEx.GCD(a, c); var gcdbd = MathEx.GCD(b, d);
var u = (a * (d / gcdbd) - c * (b / gcdbd));
var v = (b * (c / gcdac) - d * (a / gcdac));
if (u == 0 || v == 0)
{
x = 1; y = (p - x * a) / b;
if (a * x + b * y == p && c * x + d * y == q && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
y = 1; x = (p - y * b) / a;
if (a * x + b * y == p && c * x + d * y == q && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
}
else
{
if ((p * (d / gcdbd) - q * (b / gcdbd)) % u == 0 &&
(p * (c / gcdac) - q * (a / gcdac)) % v == 0)
{
x = (p * (d / gcdbd) - q * (b / gcdbd)) / u;
y = (p * (c / gcdac) - q * (a / gcdac)) / v;
if (x < 0 && y < 0) { x *= -1; y *= -1; }
if (x > 0 && y > 0 && x <= 1000000000 && y <= 1000000000 && a * x + b * y == p && c * x + d * y == q && check(x, y)) ans = Pair.Min(ans, Pair.Create(x, y));
}
}
}
}
if (ans.x == long.MaxValue)
IO.Printer.Out.WriteLine(-1);
else IO.Printer.Out.WriteLine("{0} {1}", ans.x, ans.y);
}
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 gcd,lcm
static public partial class MathEx
{
static public long GCD(long x, long y)
{
if (x == 0 || y == 0) return 1;
byte i = 0;
while (x != 0 && y != 0)
{
if (i == 0)
y %= x;
else x %= y;
i ^= 1;
}
return x == 0 ? y : x;
}
}
#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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<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 long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
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); }
}
}
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 Compair
static public class Pair
{
static public Pair<FT, ST> Create<FT, ST>(FT f, ST s)
where FT : IComparable<FT>
where ST : IComparable<ST>
{ return new Pair<FT, ST>(f, s); }
static public Pair<FT, ST> Min<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
where FT : IComparable<FT>
where ST : IComparable<ST>
{ return (p.CompareTo(q) <= 0) ? p : q; }
static public Pair<FT, ST> Max<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
where FT : IComparable<FT>
where ST : IComparable<ST>
{ return (p.CompareTo(q) >= 0) ? p : q; }
}
public struct Pair<FT, ST> : IComparable<Pair<FT, ST>>
where FT : IComparable<FT>
where ST : IComparable<ST>
{
public FT x;
public ST y;
public Pair(FT f, ST s) : this() { x = f; y = s; }
public int CompareTo(Pair<FT, ST> other)
{
var cmp = x.CompareTo(other.x);
return cmp != 0 ? cmp : y.CompareTo(other.y);
}
}
#endregion