#556279 (C#(csc)) No.750 Frac #1

提出ソース

結果

問題	No.750 Frac #1
ユーザー	fairy_lettuce
提出日時	2020-09-21 01:42:00
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	33 ms / 1,000 ms
コード長	11,292 bytes
コンパイル時間	1,062 ms
コンパイル使用メモリ	121,760 KB
実行使用メモリ	26,620 KB
最終ジャッジ日時	2024-06-24 11:19:12
合計ジャッジ時間	3,036 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	32 ms 26,608 KB
testcase_01	AC	30 ms 22,572 KB
testcase_02	AC	31 ms 22,328 KB
testcase_03	AC	32 ms 24,444 KB
testcase_04	AC	31 ms 24,432 KB
testcase_05	AC	31 ms 24,428 KB
testcase_06	AC	32 ms 26,364 KB
testcase_07	AC	31 ms 24,688 KB
testcase_08	AC	28 ms 26,340 KB
testcase_09	AC	32 ms 24,372 KB
testcase_10	AC	31 ms 24,440 KB
testcase_11	AC	31 ms 24,500 KB
testcase_12	AC	32 ms 24,436 KB
testcase_13	AC	31 ms 24,304 KB
testcase_14	AC	31 ms 26,616 KB
testcase_15	AC	28 ms 24,236 KB
testcase_16	AC	32 ms 24,704 KB
testcase_17	AC	31 ms 24,560 KB
testcase_18	AC	31 ms 24,240 KB
testcase_19	AC	31 ms 26,356 KB
testcase_20	AC	28 ms 24,432 KB
testcase_21	AC	31 ms 24,568 KB
testcase_22	AC	33 ms 26,488 KB
testcase_23	AC	31 ms 26,620 KB
testcase_24	AC	32 ms 24,564 KB
testcase_25	AC	31 ms 22,324 KB
testcase_26	AC	32 ms 24,564 KB
testcase_27	AC	32 ms 24,564 KB
testcase_28	AC	29 ms 24,496 KB
testcase_29	AC	31 ms 24,564 KB
testcase_30	AC	31 ms 26,616 KB
testcase_31	AC	31 ms 26,608 KB
testcase_32	AC	32 ms 22,196 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Diagnostics;
using System.Runtime.CompilerServices;

namespace FertiLib.Contest.C
{
	static class Program
	{
		public static void Solve(Scanner cin)
		{
			int n = cin.ReadInt();
			var l = new List<(Rational r, int a, int b)>();
			for (int i = 0; i < n; i++)
			{
				var (a, b) = cin.ReadValue<int, int>();
				l.Add((new Rational(a, b), a, b));
			}
			l.Sort();
			l.Reverse();
			foreach (var e in l)
			{
				Console.WriteLine($"{e.a} {e.b}");
			}
		}

		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);
			var cin = new Scanner();
			Solve(cin);
			Console.Out.Flush();
		}

		public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO");
		public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No");
		public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no");

		public static bool Chmax<T>(ref T a, T b) where T : IComparable<T>
		{
			if (a.CompareTo(b) >= 0) return false;
			a = b;
			return true;
		}
		public static bool Chmin<T>(ref T a, T b) where T : IComparable<T>
		{
			if (a.CompareTo(b) <= 0) return false;
			a = b;
			return true;
		}
	}

	public struct Rational : IComparable<Rational>, IEquatable<Rational>
	{
		public long numerator { get; set; }
		public long denominator { get; set; }

		public Rational(long numerator, long denominator)
		{
			if (denominator < 0)
			{
				numerator *= -1;
				denominator *= -1;
			}

			static long GCD(long a, long b)
			{
				a = Math.Abs(a);
				b = Math.Abs(b);
				while (a > 0)
				{
					b %= a;
					var x = a;
					a = b;
					b = x;
				}
				return b;
			}

			var gcd = GCD(numerator, denominator);
			numerator /= gcd;
			denominator /= gcd;

			this.numerator = numerator;
			this.denominator = denominator;
		}

		public Rational(long integer)
		{
			numerator = integer;
			denominator = 1;
		}

		public static Rational Parse(string s)
		{
			var sarray = s.Split('/');
			if (sarray.Length == 1) return new Rational(long.Parse(sarray[0]));
			if (sarray.Length == 2) return new Rational(long.Parse(sarray[0]), long.Parse(sarray[1]));
			throw new ArgumentException("Invalid argument input.");
		}

		public static Rational operator +(Rational l, Rational r) => new Rational(l.numerator * r.denominator + l.denominator * r.numerator, l.denominator * r.denominator);
		public static Rational operator -(Rational l, Rational r) => new Rational(l.numerator * r.denominator - l.denominator * r.numerator, l.denominator * r.denominator);
		public static Rational operator *(Rational l, Rational r) => new Rational(l.numerator * r.numerator, l.denominator * r.denominator);
		public static Rational operator /(Rational l, Rational r) => new Rational(l.numerator * r.denominator, l.denominator * r.numerator);

		public static Rational operator ++(Rational x)
		{
			var tmp = x + new Rational(1);
			return tmp;
		}
		public static Rational operator --(Rational x)
		{
			var tmp = x - new Rational(1);
			return tmp;
		}

		public static bool operator >(Rational l, Rational r) => l.CompareTo(r) > 0;
		public static bool operator <(Rational l, Rational r) => l.CompareTo(r) < 0;
		public static bool operator >=(Rational l, Rational r) => l.CompareTo(r) >= 0;
		public static bool operator <=(Rational l, Rational r) => l.CompareTo(r) <= 0;
		public static bool operator ==(Rational l, Rational r) => l.Equals(r);
		public static bool operator !=(Rational l, Rational r) => !l.Equals(r);

		public override string ToString() => $"{numerator}/{denominator}";

		public int CompareTo(Rational x)
		{
			var diff = this - x;
			if (diff.numerator > 0) return 1;
			if (diff.numerator < 0) return -1;
			return 0;
		}

		public bool Equals(Rational item) => denominator == item.denominator && numerator == item.numerator;

		public override bool Equals(object obj) => obj is Rational r && numerator == r.numerator && denominator == r.denominator;

		public override int GetHashCode()
		{
			return HashCode.Combine(numerator, denominator);
		}
	}

	static class Extention
	{
		public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);

		public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default);
		public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default);
		public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer)
		{
			var ng = index - 1;
			var ok = index + length;
			while (ok - ng > 1)
			{
				var mid = ng + (ok - ng) / 2;
				var res = comparer.Compare(list[mid], value);
				if (res < 0 || (isUpperBound && res == 0)) ng = mid;
				else ok = mid;
			}
			return ok;
		}
	}

	class Scanner
	{
		string[] s;
		int i;

		char[] separator = new char[] { ' ' };

		public Scanner()
		{
			s = new string[0];
			i = 0;
		}

		public string Read() => ReadString();

		public string ReadString()
		{
			if (i < s.Length) return s[i++];
			string st = Console.ReadLine();
			while (st == "") st = Console.ReadLine();
			s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries);
			if (s.Length == 0) return ReadString();
			i = 0;
			return s[i++];
		}

		public string[] ReadStringArray(int N)
		{
			string[] Array = new string[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadString();
			}
			return Array;
		}

		public int ReadInt()
		{
			return int.Parse(ReadString());
		}

		public int[] ReadIntArray(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadInt() + add;
			}
			return Array;
		}

		public long ReadLong()
		{
			return long.Parse(ReadString());
		}

		public long[] ReadLongArray(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadLong() + add;
			}
			return Array;
		}

		public double ReadDouble()
		{
			return double.Parse(ReadString());
		}

		public double[] ReadDoubleArray(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadDouble() + add;
			}
			return Array;
		}

		public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1));

		public (T1, T2) ReadValue<T1, T2>()
		{
			var inputs = ReadStringArray(2);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			return (v1, v2);
		}

		public (T1, T2, T3) ReadValue<T1, T2, T3>()
		{
			var inputs = ReadStringArray(3);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			return (v1, v2, v3);
		}

		public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>()
		{
			var inputs = ReadStringArray(4);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			return (v1, v2, v3, v4);
		}

		public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>()
		{
			var inputs = ReadStringArray(5);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			return (v1, v2, v3, v4, v5);
		}

		public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>()
		{
			var inputs = ReadStringArray(6);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
			return (v1, v2, v3, v4, v5, v6);
		}

		public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>()
		{
			var inputs = ReadStringArray(7);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
			var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
			return (v1, v2, v3, v4, v5, v6, v7);
		}

		public T1[] ReadValueArray<T1>(int N)
		{
			var v1 = new T1[N];
			for (int i = 0; i < N; i++)
			{
				v1[i] = ReadValue<T1>();
			}
			return v1;
		}

		public (T1[], T2[]) ReadValueArray<T1, T2>(int N)
		{
			var (v1, v2) = (new T1[N], new T2[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2) = ReadValue<T1, T2>();
				v1[i] = t1;
				v2[i] = t2;
			}
			return (v1, v2);
		}

		public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int N)
		{
			var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3) = ReadValue<T1, T2, T3>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
			}
			return (v1, v2, v3);
		}

		public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int N)
		{
			var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4) = ReadValue<T1, T2, T3, T4>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
			}
			return (v1, v2, v3, v4);
		}

		public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int N)
		{
			var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5) = ReadValue<T1, T2, T3, T4, T5>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
			}
			return (v1, v2, v3, v4, v5);
		}

		public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int N)
		{
			var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5, t6) = ReadValue<T1, T2, T3, T4, T5, T6>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
				v6[i] = t6;
			}
			return (v1, v2, v3, v4, v5, v6);
		}

		public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int N)
		{
			var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5, t6, t7) = ReadValue<T1, T2, T3, T4, T5, T6, T7>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
				v6[i] = t6;
				v7[i] = t7;
			}
			return (v1, v2, v3, v4, v5, v6, v7);
		}
	}
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード