結果

問題 No.1004 サイコロの実装 (2)
ユーザー clocklrclocklr
提出日時 2020-03-12 14:09:58
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 20 ms / 2,000 ms
コード長 3,305 bytes
コンパイル時間 4,934 ms
コンパイル使用メモリ 114,764 KB
実行使用メモリ 25,952 KB
最終ジャッジ日時 2024-11-17 22:08:58
合計ジャッジ時間 6,047 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
25,884 KB
testcase_01 AC 19 ms
22,192 KB
testcase_02 AC 18 ms
23,724 KB
testcase_03 AC 19 ms
23,656 KB
testcase_04 AC 18 ms
23,980 KB
testcase_05 AC 19 ms
25,864 KB
testcase_06 AC 19 ms
24,040 KB
testcase_07 AC 19 ms
25,888 KB
testcase_08 AC 19 ms
23,972 KB
testcase_09 AC 19 ms
23,788 KB
testcase_10 AC 19 ms
23,836 KB
testcase_11 AC 19 ms
22,068 KB
testcase_12 AC 19 ms
25,892 KB
testcase_13 AC 19 ms
23,984 KB
testcase_14 AC 19 ms
23,788 KB
testcase_15 AC 19 ms
24,100 KB
testcase_16 AC 19 ms
23,984 KB
testcase_17 AC 19 ms
23,984 KB
testcase_18 AC 19 ms
24,056 KB
testcase_19 AC 19 ms
23,920 KB
testcase_20 AC 19 ms
23,784 KB
testcase_21 AC 19 ms
25,872 KB
testcase_22 AC 19 ms
23,988 KB
testcase_23 AC 19 ms
25,952 KB
testcase_24 AC 20 ms
25,748 KB
testcase_25 AC 19 ms
23,988 KB
testcase_26 AC 19 ms
23,660 KB
testcase_27 AC 20 ms
25,888 KB
testcase_28 AC 20 ms
23,916 KB
testcase_29 AC 20 ms
23,652 KB
testcase_30 AC 19 ms
25,848 KB
testcase_31 AC 19 ms
21,812 KB
testcase_32 AC 20 ms
23,656 KB
testcase_33 AC 19 ms
23,788 KB
testcase_34 AC 19 ms
25,880 KB
testcase_35 AC 19 ms
23,972 KB
testcase_36 AC 19 ms
25,748 KB
testcase_37 AC 18 ms
23,784 KB
testcase_38 AC 19 ms
23,792 KB
testcase_39 AC 19 ms
23,964 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Math;

public class Hello{
    static public int mod = 1000000007;
    public static void Main(){
        string[] str = stra();
        uint a = uint.Parse(str[0]);
        uint b = uint.Parse(str[1]);
        uint x0 = uint.Parse(str[2]);
        uint n = uint.Parse(str[3]);
        uint x = (a*x0+b)%6+1;
        if(x %2 == 1){
            WriteLine($"{n/2} {0}");
        }else{
            WriteLine($"{0} {n/2}");
        }
        
        


        

        
        
        
    

        
        
        
        
    }
    // ncr mod
    static int ncr(int n,int r){r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    //static int square2(long a,long b,long m){var list = new List<int>();int temp = 1;long n2 = a;list.Add(1);int count = 1;while(temp < b){list.Add((int)n2);temp*=2;count++;n2 = n2*n2%m;}long ret = 1;while(b > 0){if(temp <= b){b -= temp;ret = ret*list[count]%1000000007;}count--;temp/=2;}return(int)ret;}
    //各種読取
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long divideup(long divided,long divid){ long temp_divide = divided/divid; if(divided % divid > 0){ temp_divide++; } return temp_divide; }
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
}
0