結果
| 問題 | No.195 フィボナッチ数列の理解(2) |
| ユーザー |
 uwi
|
| 提出日時 | 2015-04-26 23:28:23 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,792 bytes |
| コンパイル時間 | 3,925 ms |
| コンパイル使用メモリ | 83,460 KB |
| 実行使用メモリ | 55,012 KB |
| 最終ジャッジ日時 | 2024-07-05 02:21:45 |
| 合計ジャッジ時間 | 7,158 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
ソースコード
package contest;
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 Q382 {
InputStream is;
PrintWriter out;
String INPUT = "2 8 10";
void solve()
{
long[] ca = new long[100];
long[] cb = new long[100];
ca[0] = 1;
cb[1] = 1;
for(int i = 2;i <= 60;i++){
ca[i] = ca[i-1] + ca[i-2];
cb[i] = cb[i-1] + cb[i-2];
}
int[] xs = na(3);
Arrays.sort(xs);
if(xs[0] < xs[1] && xs[1] < xs[2]){
long zu = Long.MAX_VALUE;
long zv = Long.MAX_VALUE;
for(int s = 1;s <= 60;s++){
long v = -1;
if(cb[s] != 0 && xs[1] - xs[0] * ca[s] > 0 && (xs[1] - xs[0] * ca[s]) % cb[s] == 0){
v = (xs[1] - xs[0] * ca[s]) / cb[s];
}
if(v >= 0){
for(int t = s+1;t <= 60;t++){
if(xs[2] - xs[0] * ca[t] == v * cb[t]){
long u = xs[0];
while(true){
// [u,v]
if(u < zu || u == zu && v < zv){
zu = u; zv = v;
}
long nu = v-u;
if(nu > 0){
v = u;
u = nu;
}else{
break;
}
}
break;
}
}
}
}
for(int s = 0;s <= 60;s++){
if(s == 1)continue;
long u = -1;
if(ca[s] != 0 && xs[1] - xs[0] * cb[s] > 0 && (xs[1] - xs[0] * cb[s]) % ca[s] == 0){
u = (xs[1] - xs[0] * cb[s]) / ca[s];
}
if(u >= 0){
for(int t = s+1;t <= 60;t++){
if(xs[2] - xs[0] * cb[t] == u * ca[t]){
long v = xs[0];
while(true){
// [u,v]
if(u < zu || u == zu && v < zv){
zu = u; zv = v;
}
long nu = v-u;
if(nu > 0){
v = u;
u = nu;
}else{
break;
}
}
break;
}
}
}
}
if(zu == Long.MAX_VALUE){
out.println(-1);
}else{
out.println(zu + " " + zv);
}
}else if(xs[0] == xs[1] && xs[1] == xs[2]){
long min = xs[0];
for(int s = 2;s <= 60;s++){
// a+by=z
long num = xs[0]-ca[s];
if(num > 0 && num % cb[s] == 0){
min = Math.min(min, num/cb[s]);
}
}
out.println(1 + " " + min);
}else{
if(xs[1] < xs[2]){
xs[1] = xs[2];
}
long zu = Long.MAX_VALUE;
long zv = Long.MAX_VALUE;
for(int s = 0;s <= 60;s++){
long v = -1;
if(cb[s] != 0 && xs[1] - xs[0] * ca[s] > 0 && (xs[1] - xs[0] * ca[s]) % cb[s] == 0){
v = (xs[1] - xs[0] * ca[s]) / cb[s];
}
if(v > 0){
long u = xs[0];
while(true){
// [u,v]
if(u < zu || u == zu && v < zv){
zu = u; zv = v;
}
long nu = v-u;
if(nu > 0){
v = u;
u = nu;
}else{
break;
}
}
}
}
for(int s = 0;s <= 60;s++){
long u = -1;
if(ca[s] != 0 && xs[1] - xs[0] * cb[s] > 0 && (xs[1] - xs[0] * cb[s]) % ca[s] == 0){
u = (xs[1] - xs[0] * cb[s]) / ca[s];
}
if(u > 0){
long v = xs[0];
while(true){
// [u,v]
if(u < zu || u == zu && v < zv){
zu = u; zv = v;
}
long nu = v-u;
if(nu > 0){
v = u;
u = nu;
}else{
break;
}
}
}
}
if(zu == Long.MAX_VALUE){
out.println(-1);
}else{
out.println(zu + " " + zv);
}
}
}
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");
}
public static void main(String[] args) throws Exception { new Q382().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 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[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private int ni()
{
int num = 0, 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 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)); }
}