結果
問題 | No.105 arcの六角ボルト |
ユーザー | femto |
提出日時 | 2015-12-19 15:25:53 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 132 ms / 5,000 ms |
コード長 | 4,214 bytes |
コンパイル時間 | 1,634 ms |
コンパイル使用メモリ | 110,208 KB |
実行使用メモリ | 24,064 KB |
最終ジャッジ日時 | 2024-09-16 16:05:52 |
合計ジャッジ時間 | 1,921 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Diagnostics; using System.Collections.Generic; using System.Linq; using Enu = System.Linq.Enumerable; class Solution { void calc() { double[] x = new double[6], y = new double[6]; for(int i = 0; i < 6; i++) { rdo(out x[i], out y[i]); } double theta = Math.Atan2(y[0], x[0]); while(theta < 0) { theta += Math.PI / 3.0; } while(theta > 2.0 * Math.PI * 50.0 / 360.0) { theta -= Math.PI / 3.0; } Console.WriteLine(360.0 * theta / (2.0 * Math.PI)); } static void Main(string[] args) { int n = ri(); Console.ReadLine(); for(int i = 0; i < n; i++) { new Solution().calc(); Console.ReadLine(); } } #region static int ri() { return int.Parse(Console.ReadLine()); } static int[] ria(int n) { if(n <= 0) { Console.ReadLine(); return new int[0]; } else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray(); } static void rio(out int p1) { p1 = ri(); } static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; } static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static long rl() { return long.Parse(Console.ReadLine()); } static long[] rla(int n) { if(n <= 0) { Console.ReadLine(); return new long[0]; } else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray(); } static void rlo(out long p1) { p1 = rl(); } static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; } static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static double rd() { return double.Parse(Console.ReadLine()); } static double[] rda(int n) { if(n <= 0) { Console.ReadLine(); return new double[0]; } else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray(); } static void rdo(out double p1) { p1 = rd(); } static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; } static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; } static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); } static void wa2<T>(T[][] a) { foreach(var row in a) { Debug.WriteLine(String.Join(" ", row)); } } [DebuggerDisplay("{x} , {y}")] class point<T> { public T x, y; public point(T x, T y) { this.x = x; this.y = y; } } #endregion } static class Extention { public static T[][] ToJagArray<T>(this T[,] a) { int n = a.GetLength(0), m = a.GetLength(1); var ret = new T[n][]; for(int i = 0; i < n; i++) { ret[i] = new T[m]; for(int j = 0; j < m; j++) { ret[i][j] = a[i, j]; } } return ret; } public static bool InRange<T>(this T[,] a, int i, int j) { int n = a.GetLength(0), m = a.GetLength(1); return 0 <= i && i < n && 0 <= j && j < m; } }