hdoj1014簡單題

來源:互聯網
上載者:User
#include<iostream>#include <iomanip>#include<string>using namespace std;int main(){int m, n;int seed;while(cin>>m>>n){int count[100005] = {0};seed = 0;count[0] = 1;for(int i = 1; i < n; i++){seed = (seed + m) % n;count[seed]++;}int flag = 1;for(int i = 0; i < n; i++){if(count[i] == 0){flag = 0;cout << setfill (' ') << setw (10)<<m;cout << setfill (' ') << setw (10)<<n;cout << setfill (' ') << setw (4)<<' ';cout << "Bad Choice"<<endl<<endl;break;}}if(flag){cout << setfill (' ') << setw (10)<<m;cout << setfill (' ') << setw (10)<<n;cout << setfill (' ') << setw (4)<<' ';cout << "Good Choice"<<endl<<endl;}}}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.