제출 #859971

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859971		aykhn	홀-짝 수열 (IZhO11_oddeven)	C++14	컴파일 에러	0 ms	0 KiB

oddeven

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

// author : aykhn

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;

#define pb push_back
#define ins insert
#define mpr make_pair
#define all(v) v.begin(), v.end()
#define bpc __builtin_popcount
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define int ll
#define infll 0x3F3F3F3F3F3F3F3F
#define inf 0x3F3F3F3F
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

__int128 read() {
    __int128 x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}
void print(__int128 x) {
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    if (x > 9) print(x / 10);
    putchar(x % 10 + '0');
}


signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    __int128 n;
    n = read();
  	__int128 lim = 1e18;
  	assert(n <= lim);
    __int128 l = 1; 
    __int128 r = 1e9;
    while (l < r)
    {
        __int128 mid = (l + r) >> 1;
        if (mid * (mid + 1) / 2 >= n) r = mid;
        else l = mid + 1;
    }
    __int128 x = l - 1;
    __int128 y = n - 1;
    print((y - x) * 2 + x + 1) << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

oddeven.cpp: In function 'int main()':
oddeven.cpp:66:32: error: invalid operands of types 'void' and 'char' to binary 'operator<<'
   66 |     print((y - x) * 2 + x + 1) << '\n';
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~ ^~ ~~~~
      |          |                        |
      |          void                     char