#include<iostream>
using namespace std;
unsigned long long gcd(unsigned long long m, unsigned long long n) {
if(n == 0)
return m;
else
return gcd(n, m % n);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
unsigned long long F[10050];
F[0] = (unsigned long long)0;
F[1] = (unsigned long long)1;
for(int i=2; i<10050; i++)
F[i] = (unsigned long long)F[i-1] + (unsigned long long)F[i-2];
int a, b;
while(cin >> a >> b)
{
cout << gcd(F[a], F[b]) << '\n';
}
return 0;
}
各種改法都錯了，感覺測資有錯
WA (line:3)
314159265358979323846264338327
...
(少年π)
學校
:
臺北市私立延平高級中學
編號 : 69058
來源 : [223.137.149.175]
最後登入時間 ：
2024-11-18 16:24:11
#include
using namespace std;
unsigned long long gcd(unsigned long long m, unsigned long long n) {
if(n == 0)
return m;
else
return gcd(n, m % n);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
unsigned long long F[10050];
F[0] = (unsigned long long)0;
F[1] = (unsigned long long)1;
for(int i=2; i<10050; i++)
F[i] = (unsigned long long)F[i-1] + (unsigned long long)F[i-2];
int a, b;
while(cin >> a >> b)
{
cout << gcd(F[a], F[b]) << '\n';
}
return 0;
}
各種改法都錯了，感覺測資有錯
WA (line:3)
答案不會超過unsigned long long,不代表這種暴力解的運算過程中不會超過unsigned long long
好吧我看到其他大大的解釋了 我為我的無知道歉