제출 #634255

#제출 시각아이디문제언어결과실행 시간메모리
634255antimirageRack (eJOI19_rack)C++14
40 / 100
10 ms8112 KiB
#include <iostream> #include <algorithm> #include <vector> #include <math.h> #include <set> #include <map> using namespace std; const int N = 1e6 + 5; long long n, k, ans, mod = 1e9 + 7, two[N]; main(){ cin >> n >> k; two[0] = 1; for (int i = 1; i < N; i++) { two[i] = two[i - 1] * 2 % mod; } long long pw = n; for (long long j = 0; j <= n; j++) { if (k <= (1 << j)) { if (j > 0) ans = (ans + two[pw]) % mod; else ans++; k -= (1 << (j - 1)); pw = n; j = -1; } else { pw--; } if (k == 0) break; } cout << ans << endl; }

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

rack.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...