noip模拟赛 gcd

题目更正：输出的a<b.

分析：这是一道数学题，范围这么大肯定是有规律的，打个表可以发现f(a,b)=k,a+b最小的a,b是斐波那契数列的第k+1项和k+2项.矩阵快速幂搞一搞就好了.

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;
const int mod = 1e9 + ;

typedef long long ll;

ll k;
struct node
{
    ll a[][];
    node() { memset(a, , sizeof(a)); }
};

node mul(node x, node y)
{
    node p;
    for (int i = ; i <= ; i++)
        for (int j = ; j <= ; j++)
            for (int k = ; k <= ; k++)
                p.a[i][j] = (p.a[i][j] + x.a[i][k] * y.a[k][j] % mod) % mod;
    return p;
}

void qpow(ll b)
{
    node x, y, z;
    x.a[][] = ;
    x.a[][] = ;
    y.a[][] = y.a[][] = y.a[][] = ;
    y.a[][] = ;
    while (b)
    {
        if (b & )
            x = mul(x, y);
        y = mul(y, y);
        b >>= ;
    }
    printf("%lld %lld", x.a[][],x.a[][]);
}

int main()
{
    scanf("%lld", &k);
    if (k != )
        qpow(k + );
    else
        printf("1 1");

    return ;
}