結果

問題 No.195 フィボナッチ数列の理解(2)
コンテスト
ユーザー LayCurse
提出日時 2015-04-26 23:20:42
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
WA  
実行時間 -
コード長 4,520 bytes
コンパイル時間 1,465 ms
コンパイル使用メモリ 163,992 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-05 01:27:27
合計ジャッジ時間 2,208 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20 WA * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

template<class T> void unique(T arr[], int &sz, int sorted=0){int i,k=0;if(!sorted)sort(arr,arr+sz);rep(i,sz)if(!k||arr[k-1]!=arr[i])arr[k++]=arr[i];sz=k;}
template<class T, class S> void unique(T arr[], S val[], int &sz, void *mem, int sorted=0){int i,k=0;if(!sorted)sort(sz,arr,val,mem);rep(i,sz)if(!k||arr[k-1]!=arr[i])arr[k]=arr[i],val[k++]=val[i];else val[k-1] += val[i];sz=k;}
template<class T, class S, class V> void unique(T arr[], S v1[], V v2[], int &sz, void *mem, int sorted=0){int i,k=0;if(!sorted)sort(sz,arr,v1,v2,mem);rep(i,sz)if(!k||arr[k-1]!=arr[i])arr[k]=arr[i],v1[k]=v1[i],v2[k++]=v2[i];else v1[k-1] += v1[i],v2[k-1] += v2[i];sz = k;}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

ll in[3];

ll a[100], b[100];
ll s, t;
ll res1, res2;

void solve1(ll X){
  ll i, j, tmp;
  rep(i,50){
    REP(j,1,b[i]+1){
      tmp = j * a[i];
      if(tmp > X) break;
      if((X - tmp) % b[i] == 0){
        s = j;
        t = (X - tmp) / b[i];
        
        if(res1==0) res1 = s, res2 = t;
        if(res1 > s || (res1 == s && res2 > t)){
          res1 = s; res2 = t;
        }
        
        break;
      }
    }
  }
}

void solve2(ll X, ll Y){
  int i, j, k;
  ll det;

  rep(i,50) rep(j,50) rep(k,50){
    det = a[i] * b[j] - a[j] * b[i];
    if(det==0) continue;
    s = (X*b[j] - Y*b[i]) / det;
    t = (-X*a[j] + Y*a[i]) / det;

    if(s <= 0 || t <= 0) continue;
    if(X != s*a[i] + t*b[i]) continue;
    if(Y != s*a[j] + t*b[j]) continue;

    if(res1==0) res1 = s, res2 = t;
    if(res1 > s || (res1 == s && res2 > t)){
      res1 = s; res2 = t;
    }
  }
}

void solve3(ll X, ll Y, ll Z){
  int i, j, k;
  ll det;

  rep(i,50) rep(j,50) rep(k,50){
    det = a[i] * b[j] - a[j] * b[i];
    if(det==0) continue;
    s = (X*b[j] - Y*b[i]) / det;
    t = (-X*a[j] + Y*a[i]) / det;

    if(s <= 0 || t <= 0) continue;
    if(X != s*a[i] + t*b[i]) continue;
    if(Y != s*a[j] + t*b[j]) continue;
    if(Z != s*a[k] + t*b[k]) continue;

    if(res1==0) res1 = s, res2 = t;
    if(res1 > s || (res1 == s && res2 > t)){
      res1 = s; res2 = t;
    }
  }
}

int main(){
  int i, j, k;
  int sz = 3;

  rep(i,sz) reader(in+i);
  unique(in, sz);

  a[0] = 1; a[1] = 0;
  b[0] = 0; b[1] = 1;
  REP(i,2,50){
    a[i] = a[i-1] + a[i-2];
    b[i] = b[i-1] + b[i-2];
  }

  if(sz==1) solve1(in[0]);
  if(sz==2) solve2(in[0], in[1]);
  if(sz==3) solve3(in[0], in[1], in[2]);

  if(res1==0) writerLn(-1); else writerLn(res1,res2);

  return 0;
}
0