[백준] 입출력 문제 - 2557, 1000, 2558, 10950, 10951, 10952, 10953, 11021, 11022, 11718, 11719, 11720, 11721, 2741, 2742, 2739, 1924, 8393, 10818, 2438, 2439, 2440, 2441, 2442, 2445, 2522, 2446, 10991, 10992

2557번 – Hello world

#include <iostream>

using namespace std;

 

int main()

{

        printf("Hello World!");

        return 0;

}

1000번- A+B, 2558번 - A+B2

#include <iostream>

using namespace std;

 

int main()

{

        int a, b;

        cin >> a >> b;

        cout << a + b << endl;

        return 0;

}

10950번 - A+B3

#include <iostream>

using namespace std;

 

int main()

{

        int T;

        cin >> T;

        while (T--)

        {

               int a, b;

               cin >> a >> b;

               cout << a + b << endl;

        }

        return 0;

}

10951번 - A+B4

#include <iostream>

using namespace std;

 

int main()

{

        int a, b;

        while (cin >> a >> b) cout << a + b << endl;

        return 0;

}

10952번 - A+B5

#include <iostream>

using namespace std;

 

int main()

{

        while (1)

        {

               int a, b;

               cin >> a >> b;

               if (a == 0 && b == 0) break;

               else cout << a + b << endl;

        }

        return 0;

}

10953번 - A+B6

#include <iostream>

using namespace std;

 

int main()

{

        int T;

        cin >> T;

        for(int i = 0 ; i < T ; i++)

        {

               int a=0, b=0;

               char c;

               cin >> a >> c >> b;

               if (a + b == 0) break;

               else cout << a + b << endl;

        }

        return 0;

}

11021번 - A+B7

#include <iostream>

using namespace std;

 

int main()

{

        int T;

        cin >> T;

        for (int i = 0; i < T; i++)

        {

               int a, b;

               cin >> a >> b;

               cout << "Case #" << i + 1 << ": " << a + b << endl;

        }

        return 0;

}

11022번 - A+B8

#include <iostream>

using namespace std;

 

int main()

{

        int T;

        cin >> T;

        for (int i = 0; i < T; i++)

        {

               int a, b;

               cin >> a >> b;

               cout << "Case #" << i + 1 << ": " << a <<" + " << b << " = " << a + b << endl;

        }

        return 0;

}

11718,11719번 – 그대로 출력하기

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

        int T;

        string t;

        while (getline(cin,t)) cout << t << endl;

        return 0;

}

11720번 – 숫자의 합

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

        int N,sum=0;

        string s;

        cin >> N >> s;

        for (int i = 0; i < N; i++) sum += s.at(i) - '0';

        cout << sum << endl;

        return 0;

}

11721번 – 열개씩 끊어 출력하기

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

        string s;

        int p = 0;

        getline(cin, s);

        while (p < s.length())

        {

               cout << s.substr(p, 10) << endl;

               p += 10;

        }

        return 0;

}

2741번 – N 찍기

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

        int N,m=1;

        cin >> N;

        while (m <= N)

               printf("%d\n", m++);

        return 0;

}

2742번 - 기찍 N

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        while (N--)

               printf("%d\n", N+1);

        return 0;

}

2739번 – 구구단

#include <iostream>

#include <string>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 1; i <= 9; i++)

               cout << N << " * " << i << " = " << N * i << endl;

        return 0;

}

1924번 – 2007년

#include <iostream>

#include <string>

using namespace std;

 

string days[] = {"MON","TUE", "WED", "THU", "FRI", "SAT", "SUN"};

int lastdays[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int main()

{

        int m, d, answer=0;

        cin >> m >> d;

 

        for (int i = 0 ; i < m-1; i++) answer += lastdays[i];

        answer += d;

        if ((answer % 7) - 1 < 0) answer = 6;

        else answer = (answer % 7) - 1;

        cout << days[answer] << endl;

 

        return 0;

}

8393번 – 합

#include <iostream>

using namespace std;

 

int main()

{

        int n;

        long long ret = 0;

        cin >> n;

        for (int i = 1; i <= n ; i++) ret += i;

        cout << ret << endl;

        return 0;

}

10818번 – 최소, 최대

#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

 

int main()

{

        long long N, low= 1000001, high= -1000001;

        vector<long long> v;

        cin >> N;

        for(long long i = 0 ; i < N ; i++)

        {

               long long t;

               cin >> t;

               v.push_back(t);

        }

 

        for (long long i = 0; i < N; i++)

        {

               if (!v.empty())

               {

                       low = min(low, v[i]);

                       high = max(high, v[i]);

               }

        }

        cout << low << " " << high << endl;

        return 0;

}

2438번 – 별찍기1

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 0; i < N; i++)

        {

               for (int j = 0; j <= i; j++) cout << "*";

               cout << endl;

        }

        return 0;

}

2439번 – 별찍기2

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 1; i <= N; i++)

        {

               for (int j = N - i; j > 0; j--) cout << " ";

               for (int j = 0; j < i; j++) cout << "*";

               cout << endl;

        }

        return 0;

}

2440번 – 별찍기3

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 1; i <= N; i++)

        {

               for (int j = N - i; j >= 0; j--) cout << "*";

               cout << endl;

        }

        return 0;

}

2441번 – 별찍기4

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 0; i < N; i++)

        {

               for (int j = 0; j < i; j++) cout << " ";

               for (int j = N-i ; j >0 ; j--) cout << "*";

               cout << endl;

        }

        return 0;

}

2442번 – 별찍기5

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 0; i < N; i++)

        {

               for (int j = 0; j < N - i - 1; j++) cout << " ";

               for (int j = 0; j < i * 2 + 1; j++) cout << "*";

               cout << endl;

        }

        return 0;

}

2445번 – 별찍기8

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = -(N-1) ; i < N ; i++)

        {

               for (int j = 0; j < N - abs(i); j++) cout << "*";

               for (int j = 0; j < abs(i)*2; j++) cout << " ";

               for (int j = 0; j < N - abs(i); j++) cout << "*";

               cout << endl;

        }

        return 0;

}

2522번 – 별찍기12

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = -(N-1) ; i < N ; i++)

        {

               for (int j = 0; j < abs(i); j++) cout << " ";

               for (int j = 0; j < N - abs(i); j++) cout << "*";

               cout << endl;

        }

        return 0;

}

2446번 – 별찍기9

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = -(N-1) ; i < N ; i++)

        {

               for (int j = 0; j < N - abs(i) -1 ; j++) cout << " ";

               for (int j = 0; j < abs(i)*2+1; j++) cout << "*";

               cout << endl;

        }

        return 0;

}

10991번 – 별찍기16

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 1; i <= N; i++)

        {

               for (int j = 0; j < (N - i); j++) cout << " ";

               for (int j = (N - i); j < N; j++)

               {

                       cout << "*" << " ";

               }

               cout << endl;

        }

        return 0;

}

10992번 – 별찍기17

#include <iostream>

using namespace std;

 

int main()

{

        int N;

        cin >> N;

        for (int i = 0; i < N; i++)

        {

               for (int j = 0; j < N - i - 1; j++) cout << " ";

               if (i == (N - 1))

               {

                       for (int j = 0; j < i * 2 + 1; j++) cout << "*";

               }

               else

               {

                       for (int j = 0; j < i * 2 + 1; j++)

                       {

                              if (j == 0 || j == (i * 2)) cout << "*";

                              else cout << " ";

                       }

               }

              

               cout << endl;

        }

        return 0;

}