Submission #123173

#	Time	Username	Problem	Language	Result	Execution time	Memory
123173		davitmarg	Fibonacci representations (CEOI18_fib)	C++17	5 / 100	83 ms	704 KiB

fib

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n,p[100005],f[100005],cnt[100005],sum;
int main()
{
    cin>>n;
    f[0]=1;
    f[1]=1;
    for(int i=2;i<=20;i++)
		f[i]=f[i-1]+f[i-2];
    for(int mask=0;mask<(1<<20);mask++)
    {
        for(int i=1;i<=20;i++)
            if(mask&(1<<(i-1)))
				sum+=f[i];
        cnt[sum]++;
    	sum=0;
    }


    for(int i=1;i<=n;i++)
	{
		cin>>p[i];
        sum+=f[p[i]];
        cout<<cnt[sum]<<endl;
	}

	return 0;
}


/*


*/

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