zoj 1269 Coconuts, Revisited

zoj 1269 Coconuts, Revisited,第1张

zoj 1269 Coconuts, Revisited
#include <iostream>using namespace std;int main(void){int i,j,n,num,people,judge;while(cin>>n&&n!=-1){people=0;for(i=2;i<n;i++){judge=0;num=n;for(j=1;j<=i;j++){if((num-1)%i!=0){judge=1;break;}num=(num-1)*(i-1)/i;}if(judge==0){if(num%i!=0) judge=1;}if(judge==0) people=i;}if(people==0) cout<<n<<" coconuts, no solution"<<endl;else cout<<n<<" coconuts, "<<people<<" people and 1 monkey"<<endl;}return 0;}

欢迎分享,转载请注明来源:内存溢出

原文地址:https://54852.com/zaji/4925755.html

(0)
打赏 微信扫一扫微信扫一扫 支付宝扫一扫支付宝扫一扫
上一篇 2022-11-12
下一篇2022-11-12

发表评论

登录后才能评论

评论列表(0条)

    保存