結果
問題 | No.897 compαctree |
ユーザー |
![]() |
提出日時 | 2019-10-04 21:27:27 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 6,056 bytes |
コンパイル時間 | 1,154 ms |
コンパイル使用メモリ | 112,768 KB |
実行使用メモリ | 18,304 KB |
最終ジャッジ日時 | 2024-10-03 07:11:27 |
合計ジャッジ時間 | 1,828 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;using System.IO;using static System.Console;using static System.Convert;using static System.Math;using System.Text;using Pi=csat.Pair<int,int>;using PL=csat.Pair<long,int>;namespace csat{class Program{public static bool chmin<T>(ref T t,T v)where T:IComparable<T>{if(t.CompareTo(v)==1){t=v;return true;} return false;}public static bool chmax<T>(ref T t,T v)where T:IComparable<T>{if(t.CompareTo(v)==-1){t=v;return true;}return false;}public static void swap<T>(ref T t1,ref T t2){var tm=t1;t1=t2;t2=tm;}public static void Fail<T>(T s){WriteLine(s);Console.Out.Close();Environment.Exit(0);}static void Main(string[] args){var sw=new StreamWriter(Console.OpenStandardOutput()){AutoFlush=false};Console.SetOut(sw);var p=new Program();for(var i=1;i>0;i--)p.Solve();Console.Out.Flush();}void Solve(){var num=Input.num;while(num-->0){int n,k;Input.Make(out n,out k);if(k==1){WriteLine(n-1);continue;}var sum=1L;for(var i=0;;i++){if(sum>=n){WriteLine(i);break;}sum*=k;sum++;}}}}public class Input{public static string read => ReadLine().Trim();public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();public static int num => ToInt32(read);public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();public static long numL => ToInt64(read);public static T[] create<T>(int n, Func<int, T> f)=> Enumerable.Repeat(0, n).Select(f).ToArray();public static char[][] grid(int h)=> create(h, _ => read.ToCharArray());public static int[] ar1D(int n)=> create(n, _ => num);public static long[] arL1D(int n)=> create(n, _ => numL);public static string[] strs(int n)=> create(n, _ => read);public static int[][] ar2D(int n)=> create(n, _ => ar);public static long[][] arL2D(int n)=> create(n, _ => arL);public static List<T>[] edge<T>(int n)=> create(n, _ => new List<T>());public static T GetValue<T>(string g){var t = typeof(T);if (t == typeof(int))return (T)(object)int.Parse(g);if (t == typeof(long))return (T)(object)long.Parse(g);if (t == typeof(string))return (T)(object)g;if (t == typeof(char))return (T)(object)char.Parse(g);if (t == typeof(double))return (T)(object)double.Parse(g);if (t == typeof(bool))return (T)(object)bool.Parse(g);return default(T);}public static void Make<T1, T2>(out T1 v1, out T2 v2){v1 = Next<T1>();v2 = Next<T2>();}public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3){Make(out v1, out v2);v3 = Next<T3>();}public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4){Make(out v1, out v2, out v3);v4 = Next<T4>();}public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5){Make(out v1, out v2, out v3, out v4);v5 = Next<T5>();}public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6){Make(out v1, out v2, out v3, out v4, out v5);v6 = Next<T6>();}private static Queue<string> sc;public static T Next<T>() { sc = sc ?? new Queue<string>(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); returnGetValue<T>(sc.Dequeue()); }public static void Next<T>(ref T val) => val = Next<T>();public const long Inf = (long)1e18;public const double eps = 1e-6;public const string Alfa = "abcdefghijklmnopqrstuvwxyz";public const int MOD = 1000000007;}public class Pair<T1, T2> : IComparable<Pair<T1, T2>>{public T1 v1 { get; set; }public T2 v2 { get; set; }public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }public Pair(T1 v1, T2 v2){ this.v1 = v1; this.v2 = v2; }public int CompareTo(Pair<T1, T2> p){var c = Comparer<T1>.Default.Compare(v1, p.v1);if (c == 0)c = Comparer<T2>.Default.Compare(v2, p.v2);return c;}public override string ToString()=> $"{v1.ToString()} {v2.ToString()}";public override bool Equals(object obj)=> this == (Pair<T1, T2>)obj;public override int GetHashCode()=> v1.GetHashCode() ^ v2.GetHashCode();public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2)=> p1.CompareTo(p2) == 0;public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2)=> p1.CompareTo(p2) != 0;public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2)=> p1.CompareTo(p2) == 1;public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2)=> p1.CompareTo(p2) != -1;public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2)=> p1.CompareTo(p2) == -1;public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2)=> p1.CompareTo(p2) != 1;}public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>{public T3 v3 { get; set; }public Pair() : base() { v3 = Input.Next<T3>(); }public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2){ this.v3 = v3; }public int CompareTo(Pair<T1, T2, T3> p){var c = base.CompareTo(p);if (c == 0)c = Comparer<T3>.Default.Compare(v3, p.v3);return c;}public override string ToString()=> $"{base.ToString()} {v3.ToString()}";}}