제출 #267156

#제출 시각아이디문제언어결과실행 시간메모리
267156peuchFibonacci representations (CEOI18_fib)C++17
5 / 100
68 ms632 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN = 20; int n; int f[MAXN]; int sum; int ans[2000000]; int main(){ f[1] = 1; f[2] = 2; for(int i = 3; i <= 20; i++){ f[i] = f[i - 1] + f[i - 2]; } for(int i = 0; i < (1<<20); i++){ int aux = 0; for(int k = 0; k < 20; k++) if(i & (1<<k)) aux += f[k + 1]; ans[aux]++; } scanf("%d", &n); for(int i = 1; i <= n; i++){ int aux; scanf("%d", &aux); sum += f[aux]; printf("%d\n", ans[sum]); } }

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

fib.cpp: In function 'int main()':
fib.cpp:23:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
fib.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |   scanf("%d", &aux);
      |   ~~~~~^~~~~~~~~~~~
fib.cpp:15:8: warning: iteration 17 invokes undefined behavior [-Waggressive-loop-optimizations]
   15 |   f[i] = f[i - 1] + f[i - 2];
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~
fib.cpp:14:19: note: within this loop
   14 |  for(int i = 3; i <= 20; i++){
      |                 ~~^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...