#414854 (C#(csc)) No.843 Triple Primes

提出ソース

結果

問題	No.843 Triple Primes
ユーザー	ひばち
提出日時	2020-01-07 19:18:13
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	5,247 bytes
コンパイル時間	3,100 ms
コンパイル使用メモリ	118,504 KB
実行使用メモリ	25,724 KB
最終ジャッジ日時	2024-11-23 01:04:34
合計ジャッジ時間	4,057 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	23 ms 17,664 KB
testcase_01	AC	27 ms 17,648 KB
testcase_02	AC	23 ms 17,408 KB
testcase_03	AC	23 ms 17,792 KB
testcase_04	AC	23 ms 17,536 KB
testcase_05	AC	23 ms 17,408 KB
testcase_06	AC	23 ms 17,408 KB
testcase_07	AC	26 ms 17,396 KB
testcase_08	AC	27 ms 17,656 KB
testcase_09	AC	27 ms 17,520 KB
testcase_10	AC	26 ms 17,788 KB
testcase_11	AC	26 ms 17,520 KB
testcase_12	AC	27 ms 17,652 KB
testcase_13	AC	26 ms 17,648 KB
testcase_14	AC	26 ms 17,788 KB
testcase_15	AC	26 ms 17,780 KB
testcase_16	AC	26 ms 17,652 KB
testcase_17	AC	23 ms 17,664 KB
testcase_18	WA	-
testcase_19	AC	23 ms 17,408 KB
testcase_20	AC	24 ms 17,524 KB
testcase_21	AC	23 ms 17,408 KB
testcase_22	AC	24 ms 17,396 KB
testcase_23	AC	25 ms 17,652 KB
testcase_24	AC	24 ms 17,520 KB
testcase_25	AC	23 ms 17,408 KB
testcase_26	AC	26 ms 17,404 KB
testcase_27	AC	23 ms 17,664 KB
testcase_28	AC	27 ms 17,780 KB
testcase_29	AC	24 ms 17,652 KB
testcase_30	AC	26 ms 17,640 KB
testcase_31	AC	23 ms 17,664 KB
testcase_32	AC	23 ms 17,664 KB
testcase_33	AC	24 ms 17,780 KB
testcase_34	AC	25 ms 17,516 KB
testcase_35	AC	26 ms 17,652 KB
testcase_36	AC	24 ms 17,664 KB
testcase_37	AC	25 ms 17,660 KB
testcase_38	AC	25 ms 17,528 KB
testcase_39	AC	27 ms 17,656 KB
testcase_40	WA	-
testcase_41	AC	23 ms 17,664 KB
testcase_42	WA	-
testcase_43	WA	-

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

コンパイルメッセージ

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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var N = sc.Int;
        var p = new bool[N + 1];p[0] = p[1] = true;
        for (var i = 2; i <= N; i++)
            if (!p[i])
                for (var j = i << 1; j <= N; j += i)
                    p[j] = true;
        var res = 0;
        for(var j = 2; j * j <= N; j++)
        {
            int a = j * j - 2;
            if (!p[j] && !p[a]) res += 1 + j % 2;
        }
        WriteLine(res);
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T>
    { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T>
    { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b)
    { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f();
        return rt;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f(i);
        return rt;
    }
    public static T[] Copy<T>(this T[] A)
        => Create(A.Length, idx => A[idx]);
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public 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 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 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>(); }
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    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 void Tie(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    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()}";
    public void Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }
}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード