| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19824 |
2016-02-25T06:01:35 Z |
emppu |
동전 (kriii4_E) |
C++14 |
|
52 ms |
2072 KB |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <bitset>
#include <tuple>
using namespace std;
#define f0(_X,_Y) for(int (_X)=0;(_X)<(_Y);++(_X))
#define f1(_X,_Y) for(int (_X)=1;(_X)<=(_Y);++(_X))
#define ff(_X,_Y,_Z) for(int (_X)=(_Y);(_X)<=(_Z);++(_X))
#define fF(_X,_Y,_Z) for(int (_X)=(_Y);(_X)<(_Z);++(_X))
#define rf0(_X,_Y) for(int _X=(_Y)-1;(_X)>=0;--(_X))
#define rf1(_X,_Y) for(int _X=(_Y);(_X)>0;--(_X))
#define rff(_X,_Y,_Z) for(int _X=(_Y);(_X)>=(_Z);--(_X))
#define rfF(_X,_Y,_Z) for(int _X=(_Y);(_X)>(_Z);--(_X))
#define PRT(_X) std::cout<< #_X ": "<<_X<<std::endl;
#define scan1(_X) scanf("%d",&_X);
#define scan2(_X,_Y) scanf("%d%d",&_X,&_Y);
#define scan3(_X,_Y,_Z) scanf("%d%d%d",&_X,&_Y,&_Z);
#define define1(_1) int _1; scan1(_1)
#define define2(_1,_2) int _1,_2; scan2(_1,_2)
#define define3(_1,_2,_3) int _1,_2,_3; scan3(_1,_2,_3)
#define EXPAND(_1) _1
#define SELECT(_1,_2,_3,_4,NAME,...) NAME
#define scan(...) EXPAND(SELECT(__VA_ARGS__, scan4, scan3, scan2, scan1)(__VA_ARGS__))
#define define(...) EXPAND(SELECT(__VA_ARGS__, define4, define3, define2, define1)(__VA_ARGS__))
#define print(_X) printf("%d\n",_X)
#define PAIR_STRUCT(_T,_X,_Y,...) struct _T{int _X,_Y,##__VA_ARGS__; bool friend operator < (const _T &p, const _T &q){if(p._X!=q._X) return p._X<q._X; return p._Y<q._Y;}}
typedef long long ll;
int d[300][300];
const int MOD = 1000000007;
ll mul(ll a, ll b){return a*b%MOD;}
ll add(ll a, ll b){return (a+b)%MOD;}
ll inv(ll a, ll b=MOD)
{
ll s = 0; ll old_s = 1;
ll r = b; ll old_r = a;
while (r!=0)
{
ll quotient = old_r / r;
tie(old_r, r) = make_tuple(r, old_r - quotient * r);
tie(old_s, s) = make_tuple(s, old_s - quotient * s);
}
ll inv = old_s%MOD;
if(inv<0) inv += MOD;
return inv;
}
int main()
{
define(n);
d[0][0]=1;
f1(i,n)
{
ff(j,0,255)
{
d[i][j] = (i==j);
ff(k,1,i) // [1,k)[k,i]
{
int prev_mask = j^(i-k);
d[i][j] = add(d[i][j],d[k-1][prev_mask]);
}
}
}
ll ans = 0;
printf("%d\n",d[n][0]);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2072 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
2072 KB |
Output is correct |
| 2 |
Correct |
24 ms |
2072 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 4 |
Correct |
6 ms |
2072 KB |
Output is correct |
| 5 |
Correct |
4 ms |
2072 KB |
Output is correct |
| 6 |
Correct |
9 ms |
2072 KB |
Output is correct |
| 7 |
Correct |
36 ms |
2072 KB |
Output is correct |
| 8 |
Correct |
44 ms |
2072 KB |
Output is correct |
| 9 |
Correct |
13 ms |
2072 KB |
Output is correct |
| 10 |
Correct |
42 ms |
2072 KB |
Output is correct |
| 11 |
Correct |
7 ms |
2072 KB |
Output is correct |
| 12 |
Correct |
7 ms |
2072 KB |
Output is correct |
| 13 |
Correct |
40 ms |
2072 KB |
Output is correct |
| 14 |
Correct |
26 ms |
2072 KB |
Output is correct |
| 15 |
Correct |
13 ms |
2072 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 17 |
Correct |
51 ms |
2072 KB |
Output is correct |
| 18 |
Correct |
2 ms |
2072 KB |
Output is correct |
| 19 |
Correct |
23 ms |
2072 KB |
Output is correct |
| 20 |
Correct |
4 ms |
2072 KB |
Output is correct |
| 21 |
Correct |
32 ms |
2072 KB |
Output is correct |
| 22 |
Correct |
25 ms |
2072 KB |
Output is correct |
| 23 |
Correct |
14 ms |
2072 KB |
Output is correct |
| 24 |
Correct |
10 ms |
2072 KB |
Output is correct |
| 25 |
Correct |
6 ms |
2072 KB |
Output is correct |
| 26 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 27 |
Correct |
39 ms |
2072 KB |
Output is correct |
| 28 |
Correct |
0 ms |
2072 KB |
Output is correct |
| 29 |
Correct |
39 ms |
2072 KB |
Output is correct |
| 30 |
Correct |
52 ms |
2072 KB |
Output is correct |
