The Bells are Ringing
阿新 • • 發佈:2018-12-16
連結
題解
顯然都是的約數,且不大於
那我就找出所有這樣的約數,然後列舉就行了
這題要注意的一個坑點就是:
樣例給出的Such bells don’t exist
中的單引號格式是全形單引號,而提交的程式中必須使用半形單引號才能
程式碼
//數學 #include <bits/stdc++.h> #define maxn 1000010 #define ll long long using namespace std; ll N, lis[maxn], ans; void init() { ll i; *lis=0; for(i=1;i<=N and i<=1000000;i++)if(N%i==0)lis[++*lis]=i; } ll gcd(ll a, ll b){return !b?a:gcd(b,a%b);} ll lcm(ll a, ll b){return a/gcd(a,b)*b;} ll lcm(ll a, ll b, ll c){return lcm(lcm(a,b),c);} int main() { ll i, j, k, flag, kase=0; while(scanf("%lld",&N),N) { printf("Scenario %lld:\n",++kase); init(); flag=0; for(i=1;i<=*lis;i++)for(j=i+1;j<=*lis and lis[j]-lis[i]<=25;j++)for(k=j+1;k<=*lis and lis[k]-lis[i]<=25;k++) if(lcm(lis[i],lis[j],lis[k])==N)printf("%lld %lld %lld\n",lis[i],lis[j],lis[k]), flag=1; if(!flag)printf("Such bells don't exist\n"); printf("\n"); } return 0; }