text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, T;
cin >> N >> M;
vector<int> A(N, -1);
A[0] = 1, A[1] = 2;
while(M--)
{
cin >> T;
A[T-1] = 0;
}
if(A[0] == 0 && A[1] != 0) A[1] = 1;
for(int i = 2; i < N; i++)
{
if(A[i] != 0)
A[i] = (A[i-1] + A[i-2]) % 1000000007;
}
cout << A[N-1] << endl;
}
|
//dp発想
#include <iostream>
using namespace std;
const int mo = 1e9 + 7;
int main()
{
int m,n,f[100010];
cin >> n >> m;
bool a[100010];
for( int i = 0, x; i < m; i++ )
{
cin >> x; a[x] = 1;
}
f[0] = 1;
for( int i = 1; i <= n; i++ )
{
f[i] = ( f[i - 1] + f[i - 2] ) % mo;
if( a[i] ) f[i] = 0;
}
cout << f[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll MOD = 1e9 + 7;
int main()
{
int n,k; cin>>n>>k;
vector<ll> dp(n+1,0);
map<int,int> mp;
for(int i=0;i<k;i++){
int x; cin>>x; mp[x]++;
}
dp[0]=1;
for(int i=1;i<=n;i++){
if(mp[i]) continue;
dp[i] += dp[i-1];
if(i-2>=0) dp[i] += dp[i-2];
dp[i] %= MOD;
}
cout<<dp[n];
}
|
#include <bits/stdc++.h>
using namespace std;
const int N=100005,Mod=1e9+7;
bool bk[N];int dp[N];
int main (){
int n,m;scanf ("%d%d",&n,&m);
for (int i=1;i<=m;i++){
int x;scanf ("%d",&x);
bk[x]=true;
}
dp[0]=1;
for (int i=0;i<=n;i++){
if (bk[i]) dp[i]=0;
dp[i+1]=(dp[i+1]+dp[i])%Mod;
dp[i+2]=(dp[i+2]+dp[i])%Mod;
}
printf ("%d",dp[n]);
return 0;
}
|
#include <stdio.h>
long long mod=1e9+7;
long long vis[100005],a[100005]={1,1,2};
int main()
{
long long i,x,n,k;
scanf("%lld%lld",&n,&k);
for(i=1; i<=k; i++)
{
scanf("%lld",&x);
vis[x]=1;
}
if(vis[1]) a[1]=0;
for(i=2; i<=n; i++)
{
if(vis[i]) a[i]=0;
else a[i]=(a[i-1]%mod+a[i-2]%mod)%mod;
}
printf("%lld\n",a[n]);
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
const ll mod = 10e9+7;
int main(){
int n,m; cin>>n>>m;
vector<ll> dp(n+1, -1);
dp[0]=1;
dp[1]=1;
rep(i,m){
int a; cin>>a;
dp[a]=0;
}
for (int i=2; i<=n; i++){
if(dp[i] != 0) dp[i] = (dp[i-1] + dp[i-2]) % 1000000007;
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int P=1e9+7;
int main(){
int N,M;
cin >> N >> M;
set<int> A;
for(int i=0;i<M;i++){
int a;
cin >> a;
A.insert(a);
}
vector<int> dp(100005,0);
dp[0]=1;
for(int i=0;i<=N;i++){
if(!A.count(i)){
dp[i+1]=(dp[i+1]+dp[i])%P;
dp[i+2]=(dp[i+2]+dp[i])%P;
}
}
cout << dp[N] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >>n >>m;
vector<int>broken(n+1);
for(int i=0; i<m; i++){
int a;
cin >>a;
broken[a]=1;
}
vector<int>dp(n+2);
dp[n]=1;
int x=1000000007;
for(int i=n-1; i>=0; i--){
if(broken[i]==1){
dp[i]=0;
continue;
}
dp[i]=(dp[i+1]+dp[i+2])%x;
}
cout <<dp[0] <<endl;
}
|
#include<iostream>
#include<set>
using namespace std;
int n,m,x,i;
set<int>s;
int dp[100010];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(i=0;i<m;++i){
cin>>x;
s.insert(x);
}
dp[0]=1;
for(int i=1;i<=n;++i){
if(s.find(i)!=s.end())
continue;
for(int j=i-1;j>=i-2;--j)
dp[i]+=dp[j];
dp[i]%=1000000007;
}
cout<<dp[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
long long int dp[1000001];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin>>n>>m;
memset(dp,-1,sizeof dp);
dp[0]=1;
for(int i=1,x;i<=m;i++){
cin>>x;
dp[x]=0;
}
if(dp[1]!=0)
dp[1]=1;
for(int i=2;i<=n;i++)
if(dp[i]==-1)
dp[i]=(dp[i-1]+dp[i-2])%mod;
cout<<dp[n]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MAX 1000000007
int main(){
long long int N,M,x;
cin>>N>>M;
int arr[N+1];
unsigned long long int sum[N+1];
memset(arr,1,sizeof arr);memset(sum,0,sizeof sum);
while(M--) {cin>>x;arr[x]=0;}
sum[0]=1;
if(arr[1]) sum[1]=1;
for(long long int i=2;i<=N;i++)
if(arr[i]) sum[i]=(sum[i-1]+sum[i-2])%MAX;
cout<<sum[N]%MAX;
}
|
#include<cstdio>
int n,m,a[100005],f[100005];
int main()
{
scanf("%d%d",&n,&m);
f[0]=1;
for (int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
a[x]=1;
}
if(!a[1]) f[1]=1;
for (int i=2;i<=n;i++) if (!a[i]) f[i]=(f[i-1]+f[i-2])%1000000007;
printf("%d\n",f[n]);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;cin>>N>>M;
const int mod=1e9+7;
int A[M];
for(int i=0;i<M;i++){
cin>>A[i];
}
int dp[N+1];dp[0]=1;
int j;
if(A[0]==1){
j=1;
dp[1]=0;
}else{
j=0;
dp[1]=1;
}for(int i=2;i<=N;i++){
if(i==A[j]){
dp[i]=0;
if(j<M-1) j++;
}else{
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
}cout<<dp[N]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10, mod = 1e9 + 7;
int n, m, ar[N], dp[N];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
ar[x] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++)
if (!ar[i])
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
cout << dp[n];
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main(){
int n,m,a;
bool safe[100001];
cin>>n>>m;
fill(safe,safe+100001,true);
while(cin>>a)
safe[a]=false;
int dp[100001];
dp[0]=1;
for(int i=1;i<=n;i++){
if(i==1)
dp[i]=dp[i-1];
else
dp[i]=(dp[i-1]+dp[i-2])%mod;
if(!safe[i])
dp[i]=0;
}
cout<<dp[n]<<endl;
}
|
#include<iostream>
using namespace std;
int main()
{
long i,n,m,ans=1,a=0,aa=-1,mod=1e9+7,f[114514];
cin>>n>>m;
f[0]=f[1]=1;
for(i=2;i<114514;i++)f[i]=(f[i-1]+f[i-2])%mod;
for(i=0;i<m;i++)
{
cin>>a;
if(a-aa==1)
{
cout<<0<<endl;
return 0;
}
ans=(ans*f[a-aa-2])%mod;
aa=a;
}
a=n;
ans=(ans*f[a-aa-1])%mod;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,A=0;
cin>>N>>K;
vector<int> p(K+1);
for(int i=0;i<K;i++){
cin>>p.at(i);
}
vector<int> q(N+1);
q.at(0)=1;
q.at(1)=1;
if(p.at(A)==1){
A++;
q.at(1)=0;
}
for(int i=2;i<=N;i++){
if(p.at(A)==i){
A++;
}
else{
q.at(i)=(q.at(i-1)+q.at(i-2))%1000000007;
}
}
cout<<q.at(N)<<endl;
}
|
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n,m;
int a[100005],x;
int dp[100005];
int main(){
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d",&x);
a[x]=1;
}
dp[0]=1;
for(int i=1;i<=n;i++){
if(a[i]==0){
if(i<2) dp[i]=dp[i-1];
else dp[i]=(dp[i-1]+dp[i-2])%mod;
}
}
printf("%d\n",dp[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n, m; cin >> n >> m;
vector<ll> dp(n, 0);
for (ll i = 0; i < m; i++)
{
ll e; cin >> e;
dp[e - 1] = 1;
}
dp[0] = (dp[0] ? 0 : 1);
dp[1] = (dp[1] ? 0 : dp[0] + 1);
for (ll i = 2; i < n; i++)
if (dp[i])
dp[i] = 0;
else
dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
cout << dp[n - 1];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
int n,k,x; cin>>n>>k;
vector<int>dp(n+1,0);
set<int>sy;
dp[0]=1;
for(int i=0;i<k;i++) {
cin>>x; sy.insert(x);
}
if(!sy.count(1)) dp[1]=1;
for(int i=2;i<=n;i++) {
if(!sy.count(i)) dp[i]=((dp[i-1]%mod)+(dp[i-2]%mod))%mod;
}
cout<<dp[n]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
set<int>S;
for(int i=0;i<M;i++){
int x;
cin>>x;
S.insert(x);
}int ans=0;
int ans1=1;
for(int i=1;i<=N;i++){
int x=ans1;
if(S.count(i))
ans1=0;
else
ans1=(ans1+ans)%1000000007;
ans=x;
}cout<<ans1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,i,temp;
scanf("%d%d",&n,&m);
int a[100009];
memset(a,-1,sizeof(a));
a[0]=1;
a[1]=1;
for (i=0;i<m;i++)
{
scanf("%d",&temp);
a[temp]=0;
}
for (i=2;i<=n;i++)
{
if (a[i]!=0) a[i]=(a[i-1]+a[i-2])%1000000007;
}
printf("%d\n",a[n]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<int> dp(N+1, true);
int tmp;
for (int i = 0; i < M; i++){
cin >> tmp;
dp[tmp] = false;
}
for (int i = 2; i <= N; i++){
if (dp[i] == false)
continue;
dp[i] = dp[i-1] + dp[i-2];
dp[i] %= 1000000007;
}
cout << dp[N] << endl;
return 0;
}
|
#include<iostream>
using namespace std;
const int MAX_N=1e5+5;
const int MOD=1e9+7;
int a[MAX_N];
int dp[MAX_N];
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)cin>>a[i];
int cnt=0;
dp[0]=1;
for(int i=1;i<=n;i++){
if(a[cnt]==i){
cnt++;
continue;
}
else{
if(i>1)dp[i]=(dp[i-1]+dp[i-2])%MOD;
else dp[i]=1;
}
}
cout<<dp[n]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
int mod = 1000000007;
cin>>n>>m;
int a[m],i;
vector<int> v(n+1,-1);
v[0]=1;
v[1]=1;
for(i=0;i<m;i++)
{
cin>>a[i];
v[a[i]]=0;
}
for(i=2;i<=n;i++)
{
if(v[i])
{
v[i]=(v[i-1]+v[i-2])%mod;
}
}
// for(i=0;i<=n;i++) cout<<v[i]<<" ";
cout<<v[n];
return 0;
}
|
#include <iostream>
#include <set>
using namespace std;
long long dp[100010],mod = 1000000007;
set<int> s;
int main(){
int i,n,m;
cin >> n >> m;
for(i=0;i<m;i++){
int a; cin >> a;
s.insert(a);
}
dp[0] = 1;
for(i=0;i<=n;i++){
if(s.count(i)) dp[i] = 0;
(dp[i+1] += dp[i]) %= mod;
(dp[i+2] += dp[i]) %= mod;
}
cout << dp[n] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;cin>>N>>M;
vector<long long>DP(N,-1);
DP[0]=1;DP[1]=2;
for(int X=0;X<M;X++){
int G;cin>>G;DP[G-1]=0;
}
if(DP[0]==0&&DP[1]!=0)DP[1]=1;
for(int X=2;X<N;X++){
if(DP[X]!=0){
DP[X]=DP[X-1]+DP[X-2];
DP[X]%=1000000007;
}
}
cout<<DP[N-1]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool z[100011];
int ans[100011];
int n,m;
int main()
{
cin >>n>>m;
for(int i=0;i<m;i++)
{
int a;
cin >>a;
z[a]=true;
}
ans[0]=1;
ans[1]=(int)(!z[1])*1;
for(int i=2;i<=n;i++)
if(!z[i])
ans[i]=(ans[i-1]+ans[i-2])%1000000007;
cout <<ans[n]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >>N>>M;
vector<int> A(M);
vector<bool> row(N+1,1);
for (int i=0;i<M;i++){
cin >> A[i];
row[A[i]] = 0;
}
vector<long long> ans(N+1,1);
for (long long i=N-2;i>=0;i--){
ans[i] = row[i+1]*ans[i+1] + row[i+2]*ans[i+2];
ans[i] %= 1000000007;
}
cout << ans[0] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,m,a,i;
cin >> n >> m;
vector<int> broken(n+1,1);
for(i=0;i<m;i++){
cin >> a;
broken.at(a)=0;
}
vector<ll> s(n+1,0);
ll p=1000000007;
s.at(0)=1;
s.at(1)=1*broken.at(1);
for(i=2;i<=n;i++){
s.at(i)=(s.at(i-1)+s.at(i-2))%p*broken.at(i);
}
cout << s.at(n) << endl;
}
|
// abca29c.cpp : Typical Stairs
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(){
int n,m; cin>>n>>m;
vector<bool> ok(n+1,true);
for(int i=0;i<m;i++){
int a; cin>>a;
ok[a] = false;
}
vector<int> dp(n+1);
dp[0] = 1;
if(ok[1]) dp[1] = 1;
for(int i=2; i<=n; i++)
if(ok[i]) dp[i] = (dp[i-1] + dp[i-2]) % MOD;
cout<< dp[n] <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<long long>A(N+1, 1);
for(int i=0; i<M; i++){
int a;
cin >> a;
A[a]=0;
}
for(int i=0; i<N-1; i++){
if(A[i+2]==0) continue;
A[i+2]=A[i]+A[i+1];
A[i+2]%=1000000007;
}
cout << A[N] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int N,M;
using ll=long long;
ll dp[100010];
const int MOD=1000000007;
int main(){
cin >> N >> M;
set<int> S;
for(int i=0;i<M;i++){
int x;
cin >> x;
S.insert(x);
}
dp[0]=1;
for(int i=0;i<N;i++){
if (S.count(i)) continue;
dp[i+2]=(dp[i+2]+dp[i])%MOD;
dp[i+1]=(dp[i+1]+dp[i])%MOD;
}
cout << dp[N] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int mod=1000000007;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m);
vector<int> d(n+1,-1);
d[0]=1;
d[1]=1;
for(int i=0;i<m;i++){
cin >> a[i];
d[a[i]]=0;
}
for(int i=2;i<=n;i++){
if(d[i]!=0){
d[i]=(d[i-1]+d[i-2])%mod;
}
}
cout << d[n] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int MOD=1000000007;
int main(){
int fib[100002];
fib[0]=0;
fib[1]=1;
rep(i,100000) fib[i+2]=(fib[i+1]+fib[i])%MOD;
int n,m; cin>>n>>m;
int ans=1,pre=-1;
rep(i,m+1){
int a;
if(i<m) cin>>a;
else a=n+1;
ans=1LL*ans*fib[a-pre-1]%MOD;
pre=a;
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
int n,m; cin>>n>>m;
vector<int> a(n+1,0),dp(n+2,0);
for(int i=0;i<m;i++){
int t; cin>>t;
a[t]=1;
}
dp[n]=1;
for(int i=n-1;i>=0;i--){
if(a[i]) dp[i]=0;
else dp[i]=(dp[i+1]+dp[i+2])%1000000007;
}
cout<<dp[0]<<endl;
}
|
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
const int mod=1000000007;
int a[100005];
int dp[100005];
int main(){
int n,m;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++) scanf("%d",&a[i]);
int k=1;
dp[0]=1;
for(int i=1;i<=n;i++){
if(i==a[k]){
k++;
dp[i]=0;
continue;
}
dp[i]=(dp[i-1]%mod+dp[i-2]%mod)%mod;
}
printf("%d",dp[n]%mod);
return 0;
}
|
#include <bits/stdc++.h>
long long a[1000000],f[1000000];
using namespace std;
int main(){
long long n,m,num,base=1000000007;
cin>>n>>m;
for (int i=0;i<=n;i++) a[i]=0;
for (int i=0;i<m;i++){
cin>>num;
a[num]=1;
}
f[0]=1;
if (a[1]==0) f[1]=1;
else f[1]=0;
for (int i=2;i<=n;i++)
if (a[i]==0)
f[i]=(f[i-1]+f[i-2])%base;
cout<<f[n];
return 0;
}
|
#include <iostream>
using namespace std;
int const N = 1e5+5;
long long const MOD = 1e9+7;
long long dp[N];
bool b[N];
int n,m,i,j;
int main() {
// your code goes here
cin>>n>>m;
for(i=0;i<m;i++){
cin>>j;
b[j] = true;
}
dp[0] = 1;
dp[1] = (b[1]==false);
for(i=2;i<=n;i++){
if(b[i]==true) continue;
dp[i] = dp[i-1]+dp[i-2];
dp[i] %= MOD;
}
cout<<dp[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M, i;
cin >> N >> M;
vector<long long> st(N + 1, -1);
st[0] = 1; st[1] = 1;
for(i = 0; i < M; i++){
int a;
cin >> a;
st[a] = 0;
}
for(i = 2; i < N + 1; i++){
if(st[i] != 0) st[i] = (st[i - 1] + st[i - 2]) % 1000000007;
}
cout << st[N] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A;
cin >> N >> M;
vector<int> vec(N + 1, -1);
vec.at(0) = 1;
vec.at(1) = 1;
for (int i = 0; i < M; i++) {
cin >> A;
vec.at(A) = 0;
}
for (int i = 2; i < N + 1; i++) {
if (vec.at(i) != 0) vec.at(i) = (vec.at(i - 2) + vec.at(i - 1)) % 1000000007;
}
cout << vec.at(N) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long n,m,i,cur,mod=1000000007;
cin >> n >> m;
vector<long> ans(n+1);
for(i=0; i<m; i++){
cin >> cur;
ans[cur]=-1;
}
ans[0]=1;
ans[1]+=1;
for(i=2; i<=n; i++){
if(ans[i]<0){
ans[i]=0;
}else{
ans[i]=(ans[i-1]+ans[i-2])%mod;
}
}
cout << ans[n];
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
long long int p=1e9+7;
cin>>n>>m;
int a;
vector<long long int> dp(n+1,-1);
for (int i = 0; i < m; i++) {
cin>>a;
dp[a]=0;
}
dp[0]=1;
if (dp[1]==-1) {
dp[1]=1;
}
for (int i = 0; i < n-1; i++) {
if (dp[i+2]==-1) {
dp[i+2]=dp[i]+dp[i+1];
dp[i+2]%=p;
}
}
cout<<dp[n]<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int>broken(n+1);
rep(i,m){
int a; cin>>a;
broken[a]=1;
}
vector<int>dp(n+2);
const int mod=1000000007;
dp[n]=1;
for(int i=n-1;i>=0;i--){
if(broken[i]){
dp[i]=0;
continue;
}
dp[i]=(dp[i+1]+dp[i+2])%mod;
}
cout<<dp[0]<<endl;
}
|
#include<iostream>
using namespace std;
const int MOD = 1000000007;
int N,M,A,ans[100001];
bool a[100001]={0};
int solve(int n){
if(n<0||a[n])return 0;
if(ans[n]==-1)ans[n]=(solve(n-1)+solve(n-2))%MOD;
return ans[n];
}
int main(){
cin>>N>>M;
for(int i=0;i<M;i++){cin>>A;a[A]=true;}
fill(ans,ans+N+1,-1);
ans[0]=1;
cout<<solve(N);
return 0;
}
|
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(){
int n,m;
cin>>n>>m;
unordered_map<int,int>arr;
for(int i=0;i<m;i++){
int temp;
cin>>temp;
arr[temp]++;
}
vector<int>dp(n+1,0);
dp[0]=1;
if(arr.find(1)==arr.end())
dp[1]=1;
for(int i=2;i<=n;i++){
if(arr.find(i)==arr.end()){
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
}
cout<<dp[n];
return 0;
}
|
//JSD
#include<iostream>
#define Mod 1000000007
#include<cmath>
#include<limits.h>
#define ll long long
using namespace std;
int main(){
ll n,m;
cin>>n>>m;
ll a[m];
ll dp[n+1];
for(int i=0;i<=n;i++ ) dp[i]=-1;
dp[0]=1,dp[1]=1;
for(int i=0;i<m;i++){
cin>>a[i];
dp[a[i]]=0;
}
for(int i=2;i<=n;i++){
if(dp[i]==-1){
dp[i]=(dp[i-1]+dp[i-2])%Mod;
}
}
cout<<dp[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,m;
long long dp[100005];
int main()
{
memset(dp,-1,sizeof(dp));
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int a;
cin>>a;
dp[a]=0;
}
dp[0]=1;
for(int i=1;i<=n;i++)
{
if(dp[i]==0) continue;
if(i==1) dp[i]=dp[i-1];
else dp[i]=dp[i-1]+dp[i-2];
dp[i]%=1000000007;
}
cout<<dp[n]<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int N;
long long mod = 1e9 + 7, dp[1<<17];
bool out[1<<17];
int main() {
int M;
cin >> N >> M;
for(int i=0; i<M; i++) {
int a;
cin >> a;
out[a] = 1;
}
dp[0] = 1;
for(int i=0; i<N; i++) {
if(!out[i+1]) (dp[i+1]+=dp[i]) %= mod;
if(!out[i+2]) (dp[i+2]+=dp[i]) %= mod;
}
cout << dp[N] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin>>N>>M;
vector<bool> stair(N+1,true);
for(int i=0;i<M;i++){
int a; cin>>a;
stair[a]=false;
}
vector<long long> dp(N+1,0);
dp[0]=1;
for(int i=0;i<N;i++){
for(int j=i+1;j<=min(N,i+2);j++){
if(stair[j]){
dp[j]+=dp[i];
dp[j]%=1000000007;
}
}
}cout<<dp[N]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[100005],f[100005];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= m; i++){
int x;
cin >> x;
a[x]=1;
}
f[0]=1;
if(!a[1])f[1]=1;
for(int i = 2; i <= n; i++){
if(a[i]==0) f[i]=(f[i-1]+f[i-2]) % 1000000007;
}
cout << f[n] << "\n";
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,dp[100001],a[100001],b;
int main() {
cin >> n >> m;
for(int i=0; i<m; i++) {
cin >> b;
a[b]=1;
}
dp[0]=1;
for(int i=1; i<=n; i++) {
if(a[i-1]==0) {
dp[i]+=dp[i-1];
}
if(a[i-2]==0) {
dp[i]+=dp[i-2];
}
dp[i]%=1000000007;
}
cout << dp[n] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,m,vis[100005],f[100005];
int main()
{
scanf("%d%d",&n,&m);
f[0]=1;
for (int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
vis[x]=1;
}
if (!vis[1]) f[1]=1;
for (int i=2;i<=n;i++) if (!vis[i]) f[i]=(f[i-1]+f[i-2])%1000000007;
printf("%d\n",f[n]);
return 0;
}
|
#include<iostream>
using namespace std;
int s[100005];
int main(){
int n,m,tmp;
long long f[100006];
cin>>n>>m;
for(int i=1;i<=m;++i){
cin>>tmp;
s[tmp]=1;
}
f[1]=1;f[0]=1;
if(s[1]==1) f[1]=0;
for(int i=2;i<=n;++i){
if(s[i]==1) f[i]=0;
else f[i]=(f[i-1]+f[i-2])%1000000007;
}
cout<<f[n];
}
|
#include <bits/stdc++.h>
#define MOD 1000000007
#define rep(i,x,n) for(int i=x; i<n; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);cin.tie(nullptr);
int N, M;
cin>>N>>M;
vector<int> D(N+1);
rep(i, 0, M) {
int x;
cin>>x;
D[x]=-1;
}
D[0]++, D[1]++;
rep(i, 2, N+1) D[i]=~D[i] ? (D[i-1]+D[i-2])%MOD : 0;
cout<<D[N];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int j = 1, d[3] = { 1 }, p = 1e9 + 7;
for (int i = 0; i <= m; i++) {
int a = n + 1;
if (i < m)
scanf("%d", &a);
for (; j < a; j++)
(d[j % 3] = d[(j + 1) % 3] + d[(j + 2) % 3]) %= p;
d[a % 3] = 0;
j = a + 1;
}
cout << d[n % 3] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m;
long long a[100010];
int main(){
cin>>n>>m;
a[0]=1;
for(long long i=0;i<m;i++){
int x;
cin>>x;
a[x]=-1;
}
for(long long i=1;i<=n;i++){
if(a[i]!=-1){
if(a[i-1]!=-1)
a[i]+=a[i-1]%1000000007;
if(a[i-2]!=-1)
a[i]+=a[i-2]%1000000007;
}
}
if(a[n]==-1)
cout<<0;
else
cout<<a[n]%1000000007;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, B = 1e9+7;
cin >> N >> M;
vector<int> vec(N + 1, -1);
vec.at(0) = 1;
vec.at(1) = 1;
for (int i = 0; i < M; i++) {
cin >> A;
vec.at(A) = 0;
}
for (int i = 2; i < N + 1; i++) {
if (vec.at(i) != 0) vec.at(i) = (vec.at(i - 2) + vec.at(i - 1)) % B;
}
cout << vec.at(N) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,a[123456],d[123456];
int main(){
cin>>n>>m;
for(int i=0;i<n+1;i++)d[i]=100000;
for(int i=0;i<m;i++){
cin>>a[i];
d[a[i]]=0;
}
d[0]=1;
if(a[0]!=1)d[1]=1;
for(int i=2;i<=n;i++){
if(d[i]==0);
else{
d[i]=d[(i-1)]+d[(i-2)];
d[i]%=1000000007;
}
}
cout<<d[n]<<endl;
}
|
#include<iostream>
using namespace std;
const int N=1e5+10,M=1e9+7;
int a[N],n,m;
long long b[N];
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int x;
cin>>x;
a[x]=1;
}
b[0]=1;
for(int i=1;i<=n;i++){
if(!a[i-1]) b[i]=(b[i]+b[i-1])%M;
if(i>=2&&!a[i-2]) b[i]=(b[i]+b[i-2])%M;
}
cout<<b[n];
return 0;
}
|
#include <iostream>
using namespace std;
const int MAXN = 1e6 + 10, MOD = 1e9 + 7;
long long dp[MAXN];
bool O[MAXN];
int n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
O[a] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++) {
if (O[i])
continue;
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n];
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+100;
typedef long long ll;
const int mod=1e9+7;
ll a[maxn],dp[maxn];
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
ll w;
cin>>w;
a[w]=1;
}
dp[0]=1;dp[1]=a[1]?0:1;
for(int i=2;i<=n;i++)
{
if(!a[i])
{
dp[i]=(dp[i]+dp[i-1])%mod;
dp[i]=(dp[i]+dp[i-2])%mod;
}
}
cout<<dp[n]%mod;
return 0;
}
|
#include<bits/stdc++.h>
#define MOD 1000000007
#define int long long
using namespace std;
int n,m;
int a[100010];
int f[100010];
bool h[100010];
signed main(){
cin>>n>>m;
for(int i=1;i<=m;i++)cin>>a[i],h[a[i]]=1;
f[0]=1;
f[1]=(a[1]!=1);
for(int i=1;i<=n;i++)if(!h[i]){
f[i]=f[i-1]+f[i-2];
f[i]%=MOD;
}
cout<<f[n]<<endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
long long unsigned int n,m,i,j;
cin>>n>>m;
long long unsigned int broken[n+1],dp[n+1],modu=1000000007;
for(i=0;i<n+1;i++)broken[i]=false;
for(i=0;i<m;i++){cin>>j;broken[j]=true;}
dp[0]=1;
for(i=1;i<=n;i++)
{
if(broken[i])dp[i]=0;
else
{
if(i==1)
dp[i]=(dp[i-1])%modu;
else
dp[i]=(dp[i-1]+dp[i-2])%modu;
}
}
cout<<dp[n];
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
const int N=1e6+5;
int n,m,x,b[N],f[N];
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
scanf("%d",&x);
b[x]=1;
}
f[0]=1;
for(int i=1;i<=n;i++)
{
if(b[i])continue;
f[i]=(f[i-1]+f[i-2])%mod;
}
cout<<f[n];
}
|
#import<bits/stdc++.h>
using namespace std;
int i,k,m,n,c[100005],b[100005];
int main()
{
scanf("%d%d",&n,&m);
for(;m--;b[k]=1)scanf("%d",&k);
for(*c=1;i++<n;)c[i]=b[i]?0:((i>1?c[i-2]:0)+c[i-1])%1000000007;
printf("%d",c[n]);
}
|
#include <iostream>
#include <set>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int N, M, a;
cin >> N >> M;
set<int> s;
while(cin >> a) {
s.insert(a);
}
ll dp[2] {1,0};
for (int i = 1; i <= N; ++i) {
dp[i%2] = s.count(i) ? 0 : (dp[0]+dp[1])%MOD;
}
cout << dp[N%2] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MOD (1000000007)
int main(){
#define int long
int n,m,a=-1;
cin>>n>>m;
vector<int> dp(n+1,0);
dp[0]=1;
for(int i=1;i<=n;++i){
if(a==-1)cin>>a;
if(i==a){
dp[a]=-1;
a=-1;
}
else{
dp[i]=((i-1>=0&&dp[i-1]>=0?dp[i-1]:0)%MOD+(i-2>=0&&dp[i-2]>=0?dp[i-2]:0)%MOD)%MOD;
}
}
cout<<dp[n];
}
|
#include<bits/stdc++.h>
using namespace std;
int const MAXN=110000, MOD=1e9+7;
int n, m, dp[MAXN];
bool broken[MAXN];
int main(){
cin>>n>>m;
int temp;
for(int i=0;i<m;i++){
cin>>temp;
broken[temp]=true;
}
dp[n]=1;
for(int i=n-1;i>=0;i--)
if(!broken[i])
dp[i]=(dp[i+1]+dp[i+2])%MOD;
cout<<dp[0];
}
|
#include<cstdio>
bool a[100005];
long long b[100005];
long long MOD = 1e9+7;
int main(void)
{
long long n,m,t;
scanf("%lld %lld" ,&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%lld" ,&t);
a[t]=true;
}
b[0]=1;
if(!a[1]) b[1]=1;
for(int i=2;i<=n;i++)
{
if(!a[i])
b[i]=(b[i-1]+b[i-2])%MOD;
}
printf("%lld" ,b[n]);
return 0;
}
|
#include <iostream>
using namespace std;
int n,m;
long long dp[100009];
int a;
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)dp[i]=-1;
dp[0]=1;
for(int i=0;i<m;i++){
cin>>a;
dp[a]=0;
}
if(dp[1]!=0)dp[1]=1;
for(int i=2;i<=n;i++){
if(dp[i]==0)continue;
dp[i]=(dp[i-1]+dp[i-2])%1000000007;
}
cout<<dp[n];
return 0;
}
|
#include <iostream>
using namespace std;
#define MOD 1000000007
long n, m, a[100010], dp[100010];
int j;
int main(){
cin >> n >> m;
for (int i = 0; i < m; ++i) cin >> a[i];
dp[0] = 1;
dp[1] = (a[0] == 1) ? 0 : 1;
j = (a[0] == 1) ? 1: 0;
for (int i = 2; i <= n; ++i){
if (a[j] == i){
dp[i] = 0;
j++;
}
else{
dp[i] = (dp[i-1] + dp[i-2]) % MOD;
}
}
cout << dp[n];
}
|
#include <bits/stdc++.h>
#define MOD ((int)1e9+7)
using namespace std;
int mem[100005],br[100005];
int n,m;
int go(int x)
{
if(x==n) return 1;
if(x>n||br[x]) return 0;
if(mem[x]!=-1) return mem[x];
return mem[x]=(go(x+1)+go(x+2))%MOD;
}
int main()
{
cin >> n >> m;
for(int i=0;i<m;i++)
{
int x; cin >> x;
br[x]=1;
}
memset(mem,-1,sizeof mem);
cout << go(0) << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int mod=1000000007;
int main(){
int n, m;
cin >> n >> m;
vector<int>dp(n+1, -1);
dp[0]=1;
dp[1]=1;
for(int i=0; i<m; i++){
int tmp;
cin >> tmp;
dp[tmp]=0;
}
for(int i=2; i<=n; i++){
if(dp[i]==0)continue;
dp[i]=(dp[i-2]+dp[i-1])%mod;
}
cout << dp[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
map<int,int> blo;
int A[100005];
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a;
cin>>a;
blo[a] = 1;
}
A[0] = 1;
for(int i=1;i<=n;i++)
{
if(!blo[i-1])
{
A[i] += A[i-1];
}
if(i-2>=0&&!blo[i-2])
A[i] += A[i-2];
A[i] = A[i]%(1000000007);
}
cout<<A[n]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
int main()
{
bool vis[100009]={};
ll a[100009]={1,1,2};
ll n,k,x;
cin>>k>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
vis[x]=true;
}
for(int i=1;i<=k;i++)
{
if(vis[i]) a[i]=0;
else a[i]=(a[i-1]%mod+(i>=2?a[i-2]:0)%mod)%mod;
}
cout<<a[k];
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
long long int a[n+1];
for(int i=0;i<n+1;i++)
a[i]=1;
for(int i=0;i<m;i++)
{
int x;
cin>>x;
a[x]=0;
if(a[x-1]==0 || a[x+1]==0)
return cout<<"0",0;
}
for(int i=n-2;i>=0;i--)
{
if(a[i]==1)
a[i]=(a[i+1]+a[i+2])%1000000007;
}
cout<<a[0];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int inf=1000000007;
int n,m;
cin >> n >> m;
int a;
cin >> a;
vector<int> step(n+1);
step[0] = 1;
if(a != 1)step[1] = 1;
else cin >> a;
for(int i=2; i<=n; i++){
if(a == i){
cin >> a;
continue;
}
step[i] = (step[i-1] + step[i-2])%inf;
}
cout << step[n]%inf;
}
|
#include<iostream>
using namespace std;
int main() {
int DIV = 1e+9 + 7;
int N, M; cin >> N >> M;
int A[N]; for (int i = 0; i < N; i++) cin >> A[i];
bool s[N]; for (int i = 0; i < N; i++) s[i] = true;
for (int i = 0; i < M; i++) s[A[i]-1] = false;
long d[N+1]; d[0] = 1; d[1] = s[0];
for (int i = 2; i <= N; i++) d[i] = s[i-1] * (d[i-1] + d[i-2]) % DIV;
cout << d[N] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll moder = 1000000007;
ll dp[100005];
ll f(int curr){
if(curr>n) return 0;
ll&ret = dp[curr];
if(~ret) return ret;
ret = 0;
ret+=f(curr+1)+f(curr+2);
return ret%=moder;
}
int main(){
memset(dp,-1,sizeof(dp));
int m;
cin>>n>>m;
dp[n] = 1;
while(m--){
int a;
cin>>a;
dp[a] = 0;
}
cout<<f(0);
}
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
long long dp[100009];
bool f[100009];
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a;
cin>>a;
f[a]=true;
}
dp[0]=1;
if(f[1]==false)dp[1]=dp[0];
for(int i=2;i<=n;i++){
if(f[i]==false){
dp[i]=dp[i-1]+dp[i-2];
dp[i]%=mod;
}
}
cout<<dp[n]<<endl;
return(0);
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[100005],dp[100005],x;
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
cin>>x;
a[x]=1;
}
dp[0]=1;
if(a[1]) dp[1]=0;
else dp[1]=1;
for(int i=2;i<=n;i++)
{
if(a[i]) dp[i]=0;
else dp[i]=(dp[i-1]+dp[i-2])%1000000007;
}
cout<<dp[n]<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int a[100001] = {0}, b[100001] = {0};
int main () {
int n, m, temp;
cin >> n >> m;
for (int i = 1; i <= m; i++) {cin >> temp; b[temp]++;}
a[1] = b[1] == 0 ? 1 : 0;
a[2] = b[2] == 0 ? (b[1] == 0 ? 2 : 1) : 0;
for (int i = 3; i <= n; i++) if (!b[i]) a[i] = (a[i-1] + a[i-2]) % 1000000007;
cout << a[n] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MAXN=110000, MOD=1e9+7;
int n, m, dp[MAXN];
bool broken[MAXN];
int main()
{
cin>>n>>m;
int temp;
for(int i=0;i<m;i++)
{
cin>>temp;
broken[temp]=true;
}
dp[n]=1;
for(int i=n-1;i>=0;i--)
if(!broken[i])
dp[i]=(dp[i+1]+dp[i+2])%MOD;
cout<<dp[0];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,k,i;
cin>>n>>m;
vector<int> vec(n+1);
for( i=0; i<n+1; i++){
vec.at(i)=1;
}
for ( i = 0; i < m; i++) {
cin>>k;
vec.at(k)=0;
}
for(i=2; i<n+1; i++){
if(vec.at(i)==0){
}
else{
vec.at(i)=(vec.at(i-1)+vec.at(i-2))%1000000007;
}
}
cout<<vec.at(n);
}
|
#include<stdio.h>
int n,m,a[100001],d[100001],t;
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d",&t);
a[t]=1;
}
if(a[0]){
putchar('0');
return 0;
}
d[0]=1;
if(!a[1])d[1]=1;
for(int i=2;i<=n;i++)if(!a[i])d[i]=(d[i-1]+d[i-2])%1000000007;
printf("%d",d[n]);
return 0;
}
|
#include <stdio.h>
#include <algorithm>
using namespace std;
using ll = long long;
int n, m, a[100010];
ll dp[100010], mod = 1e9 + 7;
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", a + i);
dp[a[i]] = -2e18;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
dp[i] = max(0ll, dp[i]) % mod;
dp[i + 1] += dp[i];
dp[i + 2] += dp[i];
}
printf("%lld\n", dp[n] % mod);
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N,M;
cin >> N >> M;
int f[N+1];
for(int i=0;i<N+1;i++) f[i]=1;
for(int i=0;i<M;i++){
int a; cin >> a; f[a]=0;
}
long long s[N+1];
s[0]=1;
s[1]=f[1];
for(int i=2;i<N+1;i++){
s[i] = ((s[i-1]+s[i-2])*f[i])%MOD;
}
cout << s[N] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int M=1e5+10,MOD=1e9+7;
int n,m,x,a[M],f[M];
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
cin>>x,a[x]=1;
f[0]=1;
f[1]=a[1]?0:1;
for(int i=2;i<=n;i++)
if(!a[i])
f[i]=((ll)f[i-1]+f[i-2])%MOD;
printf("%d\n",f[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
int main() {
ll n,m,a[100010],dp[100010];
cin>>n>>m;
for(int i=0;i<100010;i++){
a[i]=0;
}
for(int i=0;i<m;i++){
int z;
cin>>z;
a[z]=1;
}
dp[0]=1;
if(a[1]!=1){
dp[1]=1;
}
for(int i=2;i<=n;i++){
dp[i]=dp[i-1]+dp[i-2];
dp[i]%=inf;
if(a[i]==1){
dp[i]=0;
}
}
cout << dp[n];
}
|
#include<iostream>
using namespace std;
int s[100005];
int main(){
int n,m,tmp;
long long f[100006];
cin>>n>>m;
for(int i=1;i<=m;++i){
cin>>tmp;
s[tmp]=1;
}
f[1]=1;f[2]=2;
if(s[1]==1) {f[1]=0;f[2]=1;}
if(s[2]==1) f[2]=0;
for(int i=3;i<=n;++i){
if(s[i]==1) f[i]=0;
else f[i]=(f[i-1]+f[i-2])%1000000007;
}
cout<<f[n];
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<bool> b(n+1,0);
for(int i=0;i<m;i++){
int a;
cin>>a;
b.at(a)=1;
}
vector<int> c(n+1);
c[0]=1;
c[1]=(b.at(1)?0:1);
for(int i=2;i<=n;i++)
c[i]=(b.at(i)?0:(c[i-2]+c[i-1])%1000000007);
cout<<c.at(n)<<endl;
}
|
#include <bits/stdc++.h>
#define pi 3.14159
#define MOD 1000000007
using namespace std;
int main()
{
long long int i,n,m;
cin>>n>>m;
int a[m];
for(i=0;i<m;i++)
cin>>a[i];
vector<int>ans(n+1,-1);
ans[0]=1;
ans[1]=1;
ans[2]=2;
for(i=0;i<m;i++)
ans[a[i]]=0;
for(i=2;i<=n;i++)
{
if(ans[i]!=0)
ans[i]=(ans[i-1]+ans[i-2])%MOD;
}
cout<<ans[n]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,t;
cin>>n>>m;
long long int dp[n+1];
fill(dp,dp+n,INT_MAX);
dp[n]=1;
dp[n-1]=1;
for(int i=0;i<m;i++){
cin>>t;
dp[t]=0;
}
for(int i=n-2;i>=0;i--){
if(dp[i]!=0)
dp[i]=dp[i+1]+dp[i+2];
dp[i]=dp[i]%1000000007;
// cout<<dp[i]<<endl;
}
long long int y=dp[0];
y=y%1000000007;
cout<<y;
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std ;
const int N=1e6+10 ;
const int P=1e9+7 ;
int f[N] , ban[N] ;
int n , m ;
int main ()
{
int i , x ;
scanf("%d%d",&n,&m);
for ( i=1 ; i<=m ; i++ ) scanf("%d",&x),ban[x]=1;
f[0]=1;
if ( !ban[1] ) f[1]=1;
for ( i=2 ; i<=n ; i++ )
if ( !ban[i] ) f[i]=(f[i-1]+f[i-2])%P;
printf("%d\n",f[n]);
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;
int n ,m;
map<int,bool>broken;
long long mem[100005];
long long mod =1e9+7;
int main() {
cin>>n>>m;
for(int i = 0; i < m ; i++){
int x ;cin>>x;
broken[x] = true;
}
mem[0] = 1;if(!broken[1])mem[1] = 1;
for(int i = 2 ; i<= n; i++){
if(broken[i])
continue;
mem[i]+=(mem[i-1] + mem[i-2])%mod;
}
cout<<mem[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, t, a[100005], dp[100005];
int main(){
cin >> n >> m;
for(int i = 0; i < m; i++){ cin >> t; a[t] = 1; }
dp[0] = 1;
for(int i = 1; i <= n; i++){
if(!a[i]){
if(i-2 >= 0) dp[i] += dp[i-2];
dp[i] += dp[i-1];
}
dp[i] %= 1000000007LL;
}
cout << dp[n];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,mod=1000000007;
cin >> N >> M;
vector<long long> V(N+1,-1);
for(int i=0;i<M;i++){
int a;
cin >> a;
V[a] = 0;
}
V[0] = 1;
if(V[1]==-1) V[1] = 1;
for(int i=2;i<=N;i++){
if(V[i]==0) continue;
V[i] = V[i-1] + V[i-2];
V[i] %= mod;
}
cout << V[N] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
set<int> a;
for(int i=0; i<m; ++i){int b; cin>>b; a.insert(b);}
long long b=1, c=0, d=0;
if(a.find(1)==a.end())c=1;
for(int i=2; i<=n; ++i){
if(a.find(i)!=a.end())d=0;
else d=(c+b)%(1000000007);
b=c; c=d;
}
cout<<c<<endl;
}
|
#include<cstdio>
int n,m,vis[100005],f[100005];
int main()
{
scanf("%d%d",&n,&m);
f[0]=1;
for (int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
vis[x]=1;
}
if (!vis[1]) f[1]=1;
for (int i=2;i<=n;i++) if (!vis[i]) f[i]=(f[i-1]+f[i-2])%1000000007;
printf("%d\n",f[n]);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.