Submission #585133

#	Time	Username	Problem	Language	Result	Execution time	Memory
585133		krit3379	Fibonacci representations (CEOI18_fib)	C++17	5 / 100	133 ms	1736 KiB

fib

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 25

int f[N];
map<int,int> mp;

int main(){
    int n,i,j,sum,x;
    scanf("%d",&n);
    assert(n<=15);
    f[0]=1;
    f[1]=2;
    for(i=2;i<=20;i++)f[i]=f[i-1]+f[i-2];
    for(i=0;i<(1<<20);i++){
        sum=0;
        for(j=0;j<20;j++)if(i&(1<<j))sum+=f[j];
        mp[sum]++;
    }
    sum=0;
    while(n--){
        scanf("%d",&x);
        sum+=f[x-1];
        printf("%d\n",mp[sum]);
    }
    return 0;
}

Compilation message (stderr)

fib.cpp: In function 'int main()':
fib.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
fib.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d",&x);
      |         ~~~~~^~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 15
• Subtask 4: 0 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 35