結果

問題 No.435 占い(Extra)
ユーザー uwiuwi
提出日時 2016-10-14 23:18:43
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,145 bytes
コンパイル時間 4,386 ms
コンパイル使用メモリ 88,804 KB
実行使用メモリ 78,956 KB
最終ジャッジ日時 2024-04-17 02:36:17
合計ジャッジ時間 9,627 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
37,580 KB
testcase_01 AC 64 ms
37,676 KB
testcase_02 AC 63 ms
37,140 KB
testcase_03 AC 64 ms
37,756 KB
testcase_04 RE -
testcase_05 AC 67 ms
37,512 KB
testcase_06 AC 106 ms
39,404 KB
testcase_07 AC 68 ms
37,700 KB
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 MLE -
testcase_18 RE -
testcase_19 RE -
testcase_20 MLE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 MLE -
testcase_27 RE -
testcase_28 AC 67 ms
37,188 KB
testcase_29 RE -
testcase_30 MLE -
testcase_31 MLE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest161014;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] iv = new int[9];
		for(int i = 0;i < 9;i++){
			if(i % 3 != 0){
				iv[i] = (int)invl(i, 9);
			}
		}
		
		for(int T = ni();T > 0;T--){
			int n = ni(), x = ni();
			long a = ni(), b = ni(), mod = ni();
			int[] r = new int[n];
			r[0] = x;
			for(int i = 1;i < n;i++){
				r[i] = (int)(((r[i-1]^a)+b)%mod);
			}
			for(int i = 0;i < n;i++)r[i] %= 10;
			if(Arrays.stream(r).allMatch(z -> z == 0)){
				out.println(0);
				continue;
			}
			
			long sum = 0;
			long c = 1;
			long z = 0;
			for(int i = 0;i < n;i++){
				sum += r[i] * (z >= 2 ? 0 : z == 1 ? c * 3 : c);
				if(i == n-1)break;
				{
					int m = n-1-i;
					while(m % 3 == 0){
						m /= 3;
						z++;
					}
					c = c * m % 9;
				}
				{
					int m = i+1;
					while(m % 3 == 0){
						m /= 3;
						z--;
					}
					c = c * iv[m] % 9;
				}
			}
			sum %= 9;
			if(sum == 0)sum = 9;
			out.println(sum);
		}
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0