結果
| 問題 | No.195 フィボナッチ数列の理解(2) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-04-27 00:11:11 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,427 bytes |
| コンパイル時間 | 2,612 ms |
| コンパイル使用メモリ | 112,760 KB |
| 実行使用メモリ | 22,808 KB |
| 最終ジャッジ日時 | 2023-09-18 12:20:51 |
| 合計ジャッジ時間 | 5,018 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 54 ms
18,684 KB |
| testcase_01 | WA | - |
| testcase_02 | AC | 54 ms
20,720 KB |
| testcase_03 | AC | 54 ms
20,680 KB |
| testcase_04 | WA | - |
| testcase_05 | AC | 53 ms
20,692 KB |
| testcase_06 | AC | 55 ms
22,808 KB |
| testcase_07 | AC | 54 ms
22,708 KB |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | AC | 55 ms
22,636 KB |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | AC | 52 ms
20,420 KB |
| testcase_19 | AC | 54 ms
20,688 KB |
| testcase_20 | AC | 51 ms
18,248 KB |
| testcase_21 | AC | 55 ms
22,636 KB |
| testcase_22 | AC | 52 ms
20,468 KB |
| testcase_23 | AC | 54 ms
22,764 KB |
| testcase_24 | AC | 52 ms
22,468 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 X = sc.Long();
var Y = sc.Long();
var Z = sc.Long();
var one = new long[1000];
var two = new long[1000];
one[0] = 1;
two[1] = 1;
for (int i = 2; i < 1000; i++)
{
one[i] = one[i - 1] + one[i - 2];
two[i] = two[i - 1] + two[i - 2];
}
var l = new List<KeyValuePair<long, long>>();
for (int i = 0; i < 100; i++)
{
if (one[i] <= 1000000000 && two[i] <= 1000000000)
l.Add(new KeyValuePair<long, long>(one[i], two[i]));
else break;
}
var ans = Pair.Create(long.MaxValue, long.MaxValue);
var sz = l.Count;
for (int i = 0; i < sz; i++)
for (int j = 0; j < sz; j++)
{
var a = l[i].Key;
var b = l[i].Value;
var c = l[j].Key;
var d = l[j].Value;
long A, B;
if (a == 0)
{
if (X % b > 0)
continue;
B = X / b;
A = Y - d * B;
if (B <= 0)
continue;
if (A <= 0)
continue;
}
else if (b == 0)
{
if (X % a > 0)
continue;
A = X / a;
B = Y - c * A;
if (B <= 0 || A <= 0)
continue;
}
else if (c == 0)
{
if (Y % d > 0)
continue;
B = Y / d;
A = X - b * B;
if (B <= 0)
continue;
if (A <= 0)
continue;
}
else if (d == 0)
{
if (X % c > 0)
continue;
A = X / c;
B = Y - c * A;
if (B <= 0)
continue;
if (A <= 0)
continue;
}
else
{
var lcm = MathEx.LCM(a, c);
b *= lcm / a;
b -= d * (lcm / c);
var U = X * (lcm / a) - Y * (lcm / c);
if (b == 0)
{
A = 1;
B = Y - c;
if (B == 0)
continue;
}
else
{
if (U % b > 0)
continue;
B = U / b;
A = Y - d * B;
if (A % c > 0)
continue;
A /= c;
if (A <= 0 || B <= 0)
continue;
}
}
if (A <= 0 || B <= 0)
continue;
for (int k = 0; k < sz; k++)
{
var sum = l[k].Key * A + l[k].Value * B;
if (l[k].Key * A + l[k].Value * B == Z)
{
var p = Pair.Create(A, B);
ans = Pair.Min(ans, p);
}
}
}
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 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); 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
#region gcd,lcm
static public partial class MathEx
{
static public long GCD(long x, long 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 long LCM(long x, long y)
{
return x * y / GCD(x, y);
}
}
#endregion