백준 1568번: 새

https://www.acmicpc.net/problem/1568

1. 문제

2. 알고리즘

키워드 - 구현, 탐색

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
    
    int song = 1;
    int count = 0;
    while (true) {
 
        int cand = n;
        
        if (song > n || n == 1) {
            song = 1;
        }
 
        cand -= song;
 
        song++;
        count++;
        n = cand;
        if (n == 0) {
            break;
        }
    }
 
    cout << count << CENDL;
    return 0;
}