Submission #1689749
Source Code Expand
import java.math.BigInteger; import java.util.Scanner; public class Main { BigInteger[][] base = new BigInteger[2][2]; static Scanner sc = new Scanner(System.in); public static void main(String[] args) { int n = sc.nextInt(); helper(n); } private static void helper(int n) { // TODO Auto-generated method stub for (int i = 1; i <= 3500; i++) { for (int j = 1; j <= 3500; j++) { long up = 4*i * j - j * n - i * n; long down = i * j * n; if (up>0&&down % up==0) { System.out.println("" + i + " " + j + " " + down/up); return; } } } } private BigInteger[][] matrixMult(BigInteger[][] leftmatrix, BigInteger[][] rightMatrix) { // TODO Auto-generated method stub BigInteger[][] res = new BigInteger[2][2]; res[0][0] = leftmatrix[0][0].multiply(rightMatrix[0][0]).add(leftmatrix[0][1].multiply(rightMatrix[1][0])); res[0][1] = leftmatrix[0][0].multiply(rightMatrix[0][1]).add(leftmatrix[0][1].multiply(rightMatrix[1][1])); res[1][0] = leftmatrix[1][0].multiply(rightMatrix[0][0]).add(leftmatrix[1][1].multiply(rightMatrix[1][0])); res[1][1] = leftmatrix[1][0].multiply(rightMatrix[0][1]).add(leftmatrix[1][1].multiply(rightMatrix[1][1])); return res; } public BigInteger[][] fib(int n) { if ((n) <= 1) return base; BigInteger[][] res = ((n) % 2 == 1 ? fib((n - 1) / 2) : fib(n / 2)); res = matrixMult(res, res); if ((n) % 2 == 1) res = matrixMult(res, base); return res; } }
Submission Info
Submission Time | |
---|---|
Task | C - 4/N |
User | zcg496203111 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 1514 Byte |
Status | WA |
Exec Time | 138 ms |
Memory | 23892 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0002, 3485, 4664 |
All | 0002, 0003, 0004, 0005, 0006, 0007, 0049, 0073, 0097, 0121, 0137, 0139, 0156, 0163, 0169, 0181, 0191, 0223, 0229, 0263, 0271, 0289, 0361, 0481, 0529, 0551, 0649, 0720, 0916, 1081, 1156, 1498, 1921, 2041, 2329, 2449, 2568, 2918, 2929, 3289, 3429, 3485, 3763, 4081, 4277, 4648, 4652, 4656, 4660, 4664 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0002 | AC | 99 ms | 21332 KB |
0003 | AC | 96 ms | 19796 KB |
0004 | AC | 112 ms | 21844 KB |
0005 | AC | 138 ms | 21844 KB |
0006 | AC | 98 ms | 20688 KB |
0007 | AC | 97 ms | 21332 KB |
0049 | AC | 98 ms | 23636 KB |
0073 | AC | 100 ms | 21972 KB |
0097 | AC | 99 ms | 18768 KB |
0121 | AC | 100 ms | 20692 KB |
0137 | AC | 100 ms | 21076 KB |
0139 | AC | 100 ms | 21844 KB |
0156 | AC | 111 ms | 21844 KB |
0163 | AC | 112 ms | 21076 KB |
0169 | AC | 112 ms | 19796 KB |
0181 | AC | 116 ms | 21716 KB |
0191 | AC | 108 ms | 21716 KB |
0223 | AC | 107 ms | 18772 KB |
0229 | AC | 104 ms | 22996 KB |
0263 | AC | 113 ms | 19924 KB |
0271 | AC | 116 ms | 20688 KB |
0289 | AC | 117 ms | 23892 KB |
0361 | AC | 106 ms | 21716 KB |
0481 | AC | 108 ms | 20684 KB |
0529 | AC | 107 ms | 21844 KB |
0551 | AC | 109 ms | 20948 KB |
0649 | AC | 105 ms | 19668 KB |
0720 | AC | 106 ms | 21972 KB |
0916 | AC | 106 ms | 18772 KB |
1081 | AC | 106 ms | 23252 KB |
1156 | AC | 105 ms | 21844 KB |
1498 | AC | 106 ms | 20820 KB |
1921 | WA | 116 ms | 20820 KB |
2041 | WA | 106 ms | 20692 KB |
2329 | WA | 107 ms | 19668 KB |
2449 | WA | 107 ms | 21588 KB |
2568 | WA | 109 ms | 18768 KB |
2918 | WA | 119 ms | 19024 KB |
2929 | WA | 112 ms | 21716 KB |
3289 | WA | 109 ms | 19924 KB |
3429 | WA | 120 ms | 23764 KB |
3485 | WA | 112 ms | 21844 KB |
3763 | WA | 111 ms | 22868 KB |
4081 | WA | 112 ms | 21332 KB |
4277 | WA | 111 ms | 21716 KB |
4648 | WA | 111 ms | 19796 KB |
4652 | WA | 112 ms | 17620 KB |
4656 | WA | 114 ms | 21204 KB |
4660 | WA | 111 ms | 18888 KB |
4664 | WA | 116 ms | 21588 KB |