返回列表 發帖

Rank: 8Rank: 8
1# 跳轉到 » 倒序看帖
打印
tT
tonyh發表於 2019-11-29 19:42 | 只看該作者

陣列 (二)

  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int n[8]={30,31,33,32,31,35,28,29};
  7.     string c[8]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int i=0; i<8; i++)
  9.          cout<<"5年"<<c[i]<<"班有"<<n[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;
  12. }
複製代碼
收藏 分享

Rank: 1
2#
孫嘉駿發表於 2019-11-29 20:05 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int j[8]={30,31,33,32,31,35,28,29};
  7.     string f[8]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int x=0; x<8; x++)
  9.          cout<<"5年"<<f[x]<<"班有"<<j[x]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;
  12. }
複製代碼

TOP

Rank: 1
3#
林政瑜發表於 2019-11-29 20:05 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int n[8]={30,31,33,32,31,35,28,29};
  7.     string c[8]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int i=0; i<8; i++)
  9.          cout<<"5年"<<c[i]<<"班有"<<n[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;
  12. }
複製代碼

TOP

Rank: 1
4#
李宇澤發表於 2019-11-29 20:05 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int a[8]={30,31,33,32,31,35,28,29};
  7.     string b[8]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int i=0; i<8; i++)
  9.          cout<<"5年"<<b[i]<<"班有"<<a[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;
  12. }
複製代碼
李宇澤Oscar

TOP

Rank: 1
5#
余有晉發表於 2019-11-29 20:07 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int n[8]={30,31,33,32,31,35,28,29};
  7.     string c[8]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int i=0; i<8; i++)
  9.          cout<<"5年"<<c[i]<<"班有"<<n[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;
  12. }
複製代碼

TOP

Rank: 1
6#
黃辰昊發表於 2019-11-29 20:07 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int n[]={30,31,33,32,31,35,28,29};
  7.     string c[]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int i=0; i<8; i++)
  9.         cout<<"5年"<<c[i]<<"班有"<<n[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;
  12. }
複製代碼
Huang chenhao

TOP

Rank: 1
7#
蔡忻霓發表於 2019-11-29 20:08 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     int n[8]={30,31,33,32,31,35,28,29};
  7.     string c[8]={"忠","孝","仁","愛","信","義","和","平"};
  8.     for(int i=0; i<8; i++)
  9.          cout<<"5年"<<c[i]<<"班有"<<n[i]<<"人"<<endl;
  10.      system("pause");
  11.      return 0;   
  12. }
複製代碼

TOP

Rank: 1
8#
黃宥華發表於 2019-11-29 20:08 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {   
  6.     string s[8]={"忠","孝","仁","愛","信","義","和","平"};  
  7.     int n[8]={30,31,33,32,31,35,28,29};
  8.     for(int i=0; i<8; i++)
  9.         cout<<"5年"<<s[i]<<"班有"<<n[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;   
  12. }
複製代碼
hahahahahahahaha

TOP

Rank: 1
9#
董宸佑發表於 2019-11-29 20:08 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {
  6.     string t[]={"忠","孝","仁","愛","信","義","和","平"};
  7.     int n[]={30,31,33,32,31,35,28,29};
  8.     for(int i=0; i<8; i++)
  9.         cout<<"五年"<<t[i]<<"班有"<<n[i]<<"人"<<endl;
  10.     system("pause");
  11.     return 0;   
  12. }
複製代碼

TOP

Rank: 1
10#
陳宥穎發表於 2019-11-29 20:09 | 只看該作者
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main()
  5. {   
  6.     string y[8]={"忠","孝","仁","愛","信","義","和","平"};
  7.     int r[8]={30,31,33,32,31,35,28,29};
  8.     for(int i=0; i<8; i++)
  9.     {
  10.       cout<<"五年"<<y[i]<<"班有"<<r[i]<<"人"<<endl;               
  11.     }
  12.     system("pause");
  13.     return 0;   
  14. }
複製代碼

TOP

返回列表