C++河內塔
herrDeng網內搜尋
自訂搜尋
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力，本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動，請在活動期間內踴躍上網檢測資訊安全素養認知程度，並有機會參與抽獎，詳情請參閱活動網站（網址： https://isafe.moe.edu.tw/event
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
XOR prefixsum CPP python解Leetcode 1829 Maximum XOR for Each Query 其實這裡考慮的是元素個數為2^maximumBit的交換群，運算子為XOR。 [Python code請進]
-
你會用C的算子sizeof?
-
Python C++使用字串find迴圈速解Leetcode 2490 Circular Sentence C++ & Python都有字串的find，用法都類似 split=s.find(' ', split+1)能找到s從index=split+1開...
-
先說明一下這是後知後覺的解答，所謂後知就是股票價格已知存在陣列(清單)，當然就要用迴圈練習，雙迴圈暴力解需時O(n**2)，當然不用，採python單一迴圈解答「最佳股票的買賣時機#LeetCode 121 Best Time to Buy and Sell Stock」，解...
-
Colab上安裝中文字型修改股市爬蟲pyplot顯圖 使用python套件： numpy, requests. pyplot, matplotlib.font_manager, matplotlib.mpl
-
2 pointer Python C++解Leetcode 3163 String Compression III [codes on Leetcode] https://leetcode.com/problems/string-compression-iii/solution...
26 則留言:
#include <stdio.h>
void hanoi(int n, char A, char B, char C) {
if(n == 1) {
printf("Move sheet from %c to %c\n", A, C);
}
else {
hanoi(n-1, A, C, B);
hanoi(1, A, B, C);
hanoi(n-1, B, A, C);
}
}
int main() {
int n;
printf("請輸入盤數：");
scanf("%d", &n);
hanoi(n, 'A', 'B', 'C');
return 0;
}
#include <iostream>
using namespace std;
void hanoi(int, char, char, char);
int main() {
int n;
cout << "請輸入盤數：";
cin >> n;
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n, char a, char b, char c) {
if(n == 1)
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
else {
hanoi(n - 1, a, c, b);
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
hanoi(n - 1, b, a, c);
}
}
#include <iostream>
using namespace std;
void hanoi(int,char*,char*,char*);
int main()
{
cout << "input a number:";
int number;
cin >> number;
char p1[]="A";
char p2[]="B";
char p3[]="C";
hanoi(number,p1,p2,p3);
system("pause");
return 0;
}
void hanoi(int n,char* p1,char* p2,char* p3)
{
if(n==1){
cout << "no." << n << " from " << p1 << " to " << p3 << endl;
}else{
hanoi(n-1,p1,p3,p2);
cout << "no." << n << " from " << p1 << " to " << p3 << endl;
hanoi(n-1,p2,p1,p3);
}
}
#include <iostream>
using namespace std;
void hanoi(int, char, char, char);
int main() {
int n;
cout << "請輸入盤數：";
cin >> n;
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n, char a, char b, char c) {
if(n == 1)
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
else {
hanoi(n - 1, a, c, b);
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
hanoi(n - 1, b, a, c);
}
}
#include
using namespace std;
void hanoi(int, char, char, char);
int main() {
int n;
cout << "請輸入盤數：";
cin >> n;
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n, char a, char b, char c) {
if(n == 1)
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
else {
hanoi(n - 1, a, c, b);
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
hanoi(n - 1, b, a, c);
}
}
#include
using namespace std;
void hanoi(int, char, char, char);
int main() {
int n;
cout << "請輸入盤數：";
cin >> n;
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n, char a, char b, char c) {
if(n == 1)
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
else {
hanoi(n - 1, a, c, b);
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
hanoi(n - 1, b, a, c);
}
}
#include
using namespace std;
void hanoi(int, char, char, char);
int main() {
int n;
cout << "請輸入盤數：";
cin >> n;
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n, char a, char b, char c) {
if(n == 1)
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
else {
hanoi(n - 1, a, c, b);
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
hanoi(n - 1, b, a, c);
}
}
#include
using namespace std;
void hanoi(int, char, char, char);
int main() {
int n;
cout << "請輸入盤數：";
cin >> n;
hanoi(n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n, char a, char b, char c) {
if(n == 1)
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
else {
hanoi(n - 1, a, c, b);
cout << "盤 " << n << " 由 " << a << " 移至 " << c << "\n";
hanoi(n - 1, b, a, c);
}
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
void move(int n, char a, char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt", ios::out);
hanoiTower(5, 'a', 'b', 'c');
ff.close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
void move(int n , char a , char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from , char peg3 , char to){
if (n==1) move(n,from,to);
else{
hanoiTower(n-1, from , to , peg3);
move(n,from,to);
hanoiTower(n-1, peg3,from , to );
}
}
int main()
{
ff.open("123.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
void move(int n, char a, char b){
cout<<"Disc "<<n<<" 能"<<a<<"到"<<b<<endl;
ff<<"Disc "<<n<<" 能"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt", ios::out);
hanoiTower(5, 'a', 'b', 'c');
ff.close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
int counter=0;
void move(int n, char a,char b)
{
cout<<++counter<<":盤子" <<n<<"從"<<a<<"至"<<b<<endl;
ff<<":盤子" <<n<<"從"<<a<<"至"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3,char to_peg) {
if(n == 1) move(n,from_peg,to_peg);
else {
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n,from_peg,to_peg);
hanoiTower(n-1,peg3,from_peg,to_peg);
;
}
}
int main() {
ff.open("t.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
int counter=0;
void move(int n, char a, char b){
cout<<++counter<<"Disc "<<n<<" 從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<" 從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n==1)move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
using namespace std;
fstream ff;
void move (int n, char a,char b){
cout<<" Disc "<<n<<"從"<<a<<"到"<<b<<endl;
ff<<counter<<" Disc "<<n<<" 從 "<<a<<" 從 "<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt", ios::out);
hanoiTower(5, 'a', 'b', 'c');
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
void move(int n, char a, char b){
cout<<" Disc "<<n<<"從"<<"到"<<b<<endl;
ff<<" Disc " <<n<<"從"<<"到"<<b<<endl;
}
viod hanoiTower(int n, char form_peg, char peg3, char to_peg)
{
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt", ios::out);
hanoiTower(5, 'a','b','c');
}
#indlude
#indlude
using namespace std;
fstream ff;
void move (int n,char a, char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;.
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from_peg ,char from_peg3,char to_peg)
{ if(n==1)move(n, from_peg, to_peg);
else{
hanoiTower(n-1,from_peg, to_peg,peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1,peg3, from_peg,to_peg);
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
close();
return 0;
}
#include
#include
using namespace std;
fstream ff("h.txt", ios::out);
void move(int n, char a, char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from_peg,char peg3,char to_peg)
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1,from_peg, to_peg,peg3);
move(n, from_peg,to_peg);
hanoiTower(n-1,from_peg, to_peg,peg3);
}
}
int main()
{
hanoiTower(5,'a','b','c');
return 0;
}
#include
#include
using namespace std;
fstream ff("h.txt", ios::out);
void move(int n, char a, char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from_peg,char peg3,char to_peg)
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1,from_peg, to_peg,peg3);
move(n, from_peg,to_peg);
hanoiTower(n-1,from_peg, to_peg,peg3);
}
}
int main()
{
hanoiTower(5,'a','b','c');
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
int counter=0;
void move(int n, char a, char b){
cout<<++counter<<"Disc "<<n<<" 從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<" 從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n==1)move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
void hanoi(int n, char a, char b);
int move(int n,char a, char b) {
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n == 1) move(n,from_peg,to_peg);
else {
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3,from_peg, to_peg );
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
void move(int n, char a, char b){
cout<< " Disc" <<n<< " 從" <<a<< " 到" <<b<<endl;
ff<< " Disc" <<n<< " 從" <<a<< " 到" <<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n==1) move(n, from_peg, to_peg);
else{
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3, from_peg, to_peg);
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5, 'a', 'b', 'c');
ff.close();
return 0;
}
#include
#include
using namespace std;
fstream ff;
void move (int n,char a, char b){
cout<<++counter<<": Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<counter<<": Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from_peg ,char from_peg3,char to_peg)
{ if(n==1)move(n, from_peg, to_peg);
else{
hanoiTower(n-1,from_peg, to_peg,peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1,peg3, from_peg,to_peg);
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
close();
return 0;
}
#include <iostream>
#include <fstream>
using namespace std;
fstream ff;
int counter=0;
void hanoi(int n, char a, char b);
int move(int n,char a, char b) {
cout<<++counter<<"盤子"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n, char from_peg, char peg3, char to_peg)
{
if(n == 1) move(n,from_peg,to_peg);
else {
hanoiTower(n-1, from_peg, to_peg, peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1, peg3,from_peg, to_peg );
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include
#include
using namespace std;
fstream ff;
void move(int n , char a , char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from , char peg3 , char to){
if (n==1) move(n,from,to);
else{
hanoiTower(n-1, from , to , peg3);
move(n,from,to);
hanoiTower(n-1, peg3,from , to );
}
}
int main()
{
ff.open("123.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include
#include
using namespace std;
fstream ff;
void move(int n , char a , char b){
cout<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<"Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from , char peg3 , char to){
if (n==1) move(n,from,to);
else{
hanoiTower(n-1, from , to , peg3);
move(n,from,to);
hanoiTower(n-1, peg3,from , to );
}
}
int main()
{
ff.open("123.txt",ios::out);
hanoiTower(5,'a','b','c');
ff.close();
return 0;
}
#include
#include
using namespace std;
fstream ff;
void move (int n,char a, char b){
cout<<++counter<<": Disc"<<n<<"從"<<a<<"到"<<b<<endl;
ff<<counter<<": Disc"<<n<<"從"<<a<<"到"<<b<<endl;
}
void hanoiTower(int n,char from_peg ,char from_peg3,char to_peg)
{ if(n==1)move(n, from_peg, to_peg);
else{
hanoiTower(n-1,from_peg, to_peg,peg3);
move(n, from_peg, to_peg);
hanoiTower(n-1,peg3, from_peg,to_peg);
}
}
int main()
{
ff.open("h.txt",ios::out);
hanoiTower(5,'a','b','c');
close();
return 0;
}
張貼留言