結果
問題 | No.3054 ほぼ直角二等辺三角形 |
ユーザー | KumaTachiRen |
提出日時 | 2022-10-18 12:19:49 |
言語 | C# (.NET 8.0.203) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,734 bytes |
コンパイル時間 | 14,568 ms |
コンパイル使用メモリ | 168,764 KB |
実行使用メモリ | 185,740 KB |
最終ジャッジ日時 | 2024-06-28 21:02:54 |
合計ジャッジ時間 | 13,520 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
28,984 KB |
testcase_01 | AC | 45 ms
29,184 KB |
testcase_02 | AC | 44 ms
29,056 KB |
testcase_03 | AC | 44 ms
28,928 KB |
testcase_04 | AC | 47 ms
28,892 KB |
testcase_05 | AC | 46 ms
29,184 KB |
testcase_06 | AC | 46 ms
28,892 KB |
testcase_07 | AC | 45 ms
28,928 KB |
testcase_08 | AC | 45 ms
29,184 KB |
testcase_09 | AC | 44 ms
28,928 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (95 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System.Diagnostics; using System; using System.Linq; using System.Numerics; using System.Collections; using System.Collections.Generic; using System.IO; using System.Text; using static Functions; using N = System.Int64; static class Program { static public void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); var solver = new Solver(); solver.Solve(); Console.Out.Flush(); } } public class Solver { public void Solve() { int x = ri; var dl = 1; for (int i = 0; i < x - 1; i++) dl *= 10; var dr = dl * 10; { var t = new QuadraticField(3, 2); var p = new QuadraticField(1, 1) * t; var q = new QuadraticField(1, 0) * t; while (true) { var n = p.b; var m = q.b; var a = 2 * n * m; var b = n * n - m * m; var c = n * n + m * m; if (dl <= c && c < dr) { Write($"{a} {b} {c}"); return; } if (c >= dr) break; p *= t; q *= t; } } { var t = new QuadraticField(3, 2); var p = new QuadraticField(3, 2); var q = new QuadraticField(1, 1); while (true) { var n = p.b; var m = q.b; var a = n * n - m * m; var b = 2 * n * m; var c = n * n + m * m; if (dl <= c && c < dr) { Write($"{a} {b} {c}"); return; } if (c >= dr) break; p *= t; q *= t; } } } struct QuadraticField { const int d = 2; public BigInteger a, b; public QuadraticField(BigInteger _a, BigInteger _b) { a = _a; b = _b; } public static QuadraticField operator +(QuadraticField x, QuadraticField y) => new QuadraticField(x.a + y.a, x.b + y.b); public static QuadraticField operator -(QuadraticField x, QuadraticField y) => new QuadraticField(x.a - y.a, x.b - y.b); public static QuadraticField operator *(QuadraticField x, QuadraticField y) => new QuadraticField(x.a * y.a + 2 * x.b * y.b, x.a * y.b + x.b * y.a); } const long inf = (long)1 << 60; int ri { get { return (int)sc.Integer(); } } long rl { get { return sc.Integer(); } } double rd { get { return sc.Double(); } } string rs { get { return sc.Scan(); } } string rline { get { return sc.Line(); } } public StreamScanner sc = new StreamScanner(Console.OpenStandardInput()); T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray(); void WriteJoin<T>(string s, IEnumerable<T> t) { Console.WriteLine(string.Join(s, t)); } void WriteMax(params long[] x) => Console.Write(x.Max()); void WriteMin(params long[] x) => Console.Write(x.Min()); void Write<T>(T t) { Console.WriteLine(t.ToString()); } void WriteFlush<T>(T t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); } void WriteError<T>(T t) { Console.Error.WriteLine(t.ToString()); } void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); } void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); } void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); } } public static class Functions { public static int Popcount(long x) { x = x - ((x >> 1) & 0x5555555555555555); x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333); x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f; x = x + (x >> 8); x = x + (x >> 16); x = x + (x >> 32); return (int)(x & 0x0000007f); } public static int Ctz(long x) { if (x == 0) return -1; return Popcount((x & -x) - 1); } public static int SafeMod(int x, int m) { int r = x % m; return r < 0 ? r + m : r; } public static long SafeMod(long x, long m) { long r = x % m; return r < 0 ? r + m : r; } public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1; public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b; public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b); public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b); public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; } public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; } public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; } public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; } public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; } public static int LowerBound<T, S>(in T[] list, S val, Func<T, S, int> comp) { if (list.Length == 0) return -1; int l = 0, r = list.Length; while (l < r) { int x = (l + r) / 2; if (comp(list[x], val) < 0) l = x + 1; else r = x; } return l; } public static int LowerBound<T, S>(in List<T> list, S val, Func<T, S, int> comp) { if (list.Count == 0) return -1; int l = 0, r = list.Count; while (l < r) { int x = (l + r) / 2; if (comp(list[x], val) < 0) l = x + 1; else r = x; } return l; } public static int UpperBound<T, S>(in List<T> list, S val, Func<T, S, int> comp) { if (list.Count == 0) return 0; if (comp(list.Last(), val) < 0) return list.Count; int l = 0, r = list.Count; while (l < r) { int x = (l + r) / 2; if (comp(list[x], val) <= 0) l = x + 1; else r = x; } return l; } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } private 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) throw new EndOfStreamException(); 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 Line() { var sb = new StringBuilder(); for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b); return sb.ToString(); } 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 Integer() { 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 double Double() { return double.Parse(Scan()); } }