結果

問題 No.152 貯金箱の消失
ユーザー femtofemto
提出日時 2015-04-09 14:34:28
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 74 ms / 5,000 ms
コード長 3,951 bytes
コンパイル時間 3,532 ms
コンパイル使用メモリ 116,208 KB
実行使用メモリ 17,792 KB
最終ジャッジ日時 2024-07-04 13:25:08
合計ジャッジ時間 4,606 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 12
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;
class Solution {
int L;
void calc() {
L = ri();
L /= 4;
int ans = 0;
for (int m = 1; m * m < L; m++) {
for (int n = 1; n < m; n++) {
if (gcd(n, m) != 1 || (m - n) % 2 == 0) continue;
if (2 * m * (m + n) <= L) ans++;
else break;
}
}
Console.WriteLine(ans);
}
public long gcd(long a, long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
static void Main(string[] args) {
new Solution().calc();
}
#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 {
public int x, y;
public point(int x, int 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;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0