text
stringlengths 49
983k
|
|---|
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (A <= 9 && B <= 9 ? A * B : -1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << ((a<10&&b<10)?a*b:-1)<< endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a <= 9 && b <= 9 ? a * b : -1) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if((a>9)||(b>9))
cout<<"-1";
else
cout<<a*b;
}
|
#include<iostream>
using namespace std;
int main(){
int n ,m;
cin>>n>>m;
if(n >9 || m > 9)
cout<<-1;
else cout<<n*m;
return 0;
}
|
#include <cstdio>
int a,b;
int main()
{
scanf("%d%d",&a,&b);
if(a>=1&&a<=9&&b>=1&&b<=9) printf("%d",a*b);
else printf("-1");
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;cin>>x>>y;
(x>9||y>9)?cout<<-1:cout<<x*y;
return 0;
}
|
#include<stdio.h>
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a>9||b>9)
printf("-1");
else
printf("%d",a*b);
}
|
#include <iostream>
int main(){int A,B;std::cin>>A>>B;printf("%d",(A>9|B>9)?-1:A*B);}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b; cin>>a>>b;
if(a>9 || b>9)
{
cout<<-1; return 0;
}
cout<<a*b;
}
|
#include<bits/stdc++.h>
int main()
{
int a,b;
std::cin>>a>>b;
std::cout<<(a<10&&b<10?a*b:-1)<<std::endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a <= 9 && b <= 9)
cout << a * b;
else
cout << -1;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a<10 && b<10) cout<<a*b;
else cout<<-1;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a<=9&&b<=9) cout<<a*b;
else cout<<-1;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a,b;
int kq;
int main(){
cin>>a>>b;
if (a>9 || b>9) kq=-1;
else kq=a*b;
cout<<kq;
}
|
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
(a>9||b>9)?(cout<<"-1\n"):(cout<<a*b<<"\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,ans;
cin>>a>>b;
if(a>9||b>9)
ans=-1;
else
ans=a*b;
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin>>a>>b;
cout<<((1<=a&&a<=9&&1<=b&&b<=9)?a*b:-1);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,M,a,MOD=1e9+7;
cin >> N >> M;
vector<ll> X(N+5,0);
for(int i=0;i<M;i++){
cin >> a;
X[a]=-1;
}
X[0] = 1;
if(X[1]!=-1)X[1] = 1;
for(int i=2;i<N+1;i++){
if(X[i]==-1)continue;
X[i] = ( (X[i-1]!=-1)*X[i-1] + (X[i-2]!=-1)*X[i-2] ) % MOD;
}
cout << X[N] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int32_t main() {
int n, m; cin>>n>>m;
vector<int> dp(n + 1);
map<int, int> broken;
for(int i = 0; i < m; i++){
int x; cin>>x;
broken[x] = 1;
}
dp[0] = 1;
dp[1] = (broken[1] ? 0 : 1);
for(int i = 2; i <= n; ++i){
if(broken[i]) dp[i] = 0;
else dp[i] = (dp[i-1] + dp[i-2]) % mod;
}
cout<<dp[n]<<endl;
}
|
#include <iostream>
using namespace std;
int main () {
int n, m, temp, N = 1000000007;
cin >> n >> m;
int a[100001] = {0};
for (int i = 1; i <= m; i++) {cin >> temp; a[temp] = -1;}
a[1] = a[1] == -1 ? 0 : 1;
a[2] = a[2] == -1 ? 0 : a[1] == 0 ? 1 : 2;
for (int i = 3; i <= n; i++) {
if (a[i] == -1) a[i] = 0;
else a[i] = (a[i-1] % N + a[i-2] % N) % N;
}
cout << a[n] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int twx=1000000007;
long long n,m,a,dp[100010];
bool pan[100010];
int main() {
scanf("%lld %lld",&n,&m);
for(int i=1;i<=m;i++) {
scanf("%lld",&a);
pan[a]=1;
}
dp[0]=1;
for(int i=1;i<=n;i++)
if(!pan[i])
if(i==1)
dp[i]=dp[0];
else
dp[i]=((dp[i]+dp[i-1])%twx+dp[i-2])%twx;
printf("%d\n",dp[n]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
map<int,int> mp;
vector<long long int>count(n+1,0);
for(int i=0;i<m;i++){
int a;
cin >> a;
mp[a]=1;
}
count[0]=1;
count[1]=mp[1]==0;
for(int i=2;i<=n;i++){
if(mp[i]==1)count[i]=0;
else count[i]=(count[i-1]+count[i-2])%1000000007;
}
cout << count[n];
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n , m;
cin>>n>>m;
map<int,int>mp;
for(int i=0;i<m;i++){
int tt;cin>>tt;
mp[tt] = 1;
}
vector<int>dp(n+3);
dp[n] = 1;
for(int i=n-1;i>=0;i--){
if(mp[i]){dp[i] = 0;}
else dp[i] = (dp[i+1]+dp[i+2])% 1000000007;
}
cout<<dp[0]<<endl;
}
|
#include <iostream>
using namespace std;
const int p = 1000000007;
int n, m, f[100005];
bool bad[100005];
int main()
{
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int a;
cin >> a;
bad[a] = 1;
}
f[0] = 1;
f[1] = 1;
for (int i = 2; i <= n; i++)
{
if (!bad[i - 2]) f[i] += f[i - 2];
if (!bad[i - 1]) f[i] += f[i - 1];
f[i] %= p;
}
cout << f[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int i,n,m,fib[100002],kotae=1;
fib[0]=0;
fib[1]=1;
for(i=2;i<100002;i++){
fib[i]=(fib[i-1]+fib[i-2])%1000000007;
}
cin>>n>>m;
int a[m+1];
a[0]=-1;
for(i=1;i<m+1;i++){
cin>>a[i];
kotae=(kotae*(fib[a[i]-a[i-1]-1]))%1000000007;
}
kotae*=fib[n-a[m]];
cout<<kotae%1000000007;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int N, M, a, MOD = 1e9 + 7;
cin >> N >> M;
vector<int> dp(N + 1, 1);
rep(i, M) {
cin >> a;
dp[a] = 0;
}
for (int i = 2; i <= N; i++) {
if (dp[i] != 0) dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
cout << dp[N] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
vector <bool> B;
vector <long long> dp;
int main()
{
int n,m;
cin>>n>>m;
B.resize(n+1,true);
dp.resize(n+1);
dp[0]=1;
for (int i=0;i<m;i++){
int a;
cin>>a;
B[a]=false;
}
dp[1]=B[1]*1;
for (int i=2;i<=n;i++){
dp[i]=(dp[i-1]+dp[i-2])*B[i];
dp[i]%=mod;
}
cout<<dp[n]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a;
cin >> n >> m;
vector<int> dp(n+1);
vector<bool> h(n+1,true);
for(int i=0;i<m;i++){
cin >> a;
h.at(a)=false;
}
dp.at(0)=1;dp.at(1)=h.at(1);
for(int i=2;i<=n;i++){
dp.at(i)=(dp.at(i-2)*h.at(i-2)+dp.at(i-1)*h.at(i-1))%1000000007;
}
cout << dp.at(n) << endl;
return 0;
}
|
#include<bits/stdc++.h>
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 <iostream>
using namespace std;
int main() {
int n, m;
cin >> n;
cin >> m;
int dp[n+1];
for (int i = 0; i < n+1; ++i) {
dp[i] = 1;
}
dp[n+1] = 0;
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
dp[a] = 0;
}
for (int i = n-1; i >= 0; --i) {
if (dp[i] > 0) {
dp[i] = (dp[i+1] + dp[i+2]) % 1000000007;
}
}
cout << dp[0] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100001];
long long f[100001];
int main()
{
int n,m,u,i;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d",&u);
a[u]=1;
}
f[0]=1;
f[1]=(a[1]?0:1);
for(i=2;i<=n;i++)
{
if(a[i])
continue;
f[i]=(f[i-2]+f[i-1])%1000000007;
}
printf("%lld",f[n]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[1000001],n,b[1000001],m,x;
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>x;
b[x]=1;
}
a[0]=1;
for(int i=1;i<=n;i++)
{
if(b[i-1]==0)a[i]+=a[i-1];
if(b[i-2]==0)a[i]+=a[i-2];
a[i]=a[i]%1000000007;
}
cout<<a[n];
}
|
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
int main(){
int n,m; cin>>n >>m;
vector<bool>k(n+1,true);
vector<long long int>dp(n+2);dp[0]=1;
for(int i=0;i<m;i++){
int a; cin>>a;
k[a]=false;
}
for(int i=0;i<n;i++){
if(k[i]){
dp[i+1]+=dp[i];
dp[i+1]%=mod;
dp[i+2]+=dp[i];
dp[i+2]%=mod;
}
}
cout<<dp[n]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int s[100005];
int dp[100005];
int main(void){
int N,M;
cin >> N >> M;
for(int i=0;i<M;i++){
int a;cin >> a;
s[a]=1;
}
dp[0]=1;
for(int i=1;i<=N;i++){
if(s[i]!=1){
if(i==1){ dp[i] = dp[i-1];}
else {
dp[i]=dp[i-1]+dp[i-2];
dp[i]%=mod;
}
}else{
dp[i]=0;
}
}
cout << dp[N] << endl;
}
|
#include <cstdio>
int main ()
{
int n, m, a[100005], in;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
a[i] = -1;
for (int i = 1; i <= m; i++)
{
scanf("%d", &in);
a[in] = 0;
}
if (a[1] != 0)
a[1] = 1;
if (a[2] != 0)
a[2] = 1 + a[1];
for (int i = 3; i <= n; i++)
if (a[i] == -1)
a[i] = (a[i - 2] + a[i - 1]) % 1000000007;
printf("%d", a[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin >> N >> M;
bool broken[100010] = {};
for(int i = 0; i < M; i++){
int a; cin >> a;
broken[a] = true;
}
long long P = 1000000007;
long long dp[100010] = {};
dp[0] = 1;
if(!broken[1]) dp[1] = 1;
for(int i = 2; i <= N; i++){
if(!broken[i]) dp[i] = (dp[i-2] + dp[i-1]) % P;
}
cout << dp[N] << endl;
}
|
#include<bits/stdc++.h>
const int MOD = 1000000007;
int n, m, pr=-1, t, i, a[100000], fib[1000100];
int main(){
fib[0] = 0;
fib[1] = 1;
for(i=2;i<100010;i++) fib[i] = (fib[i-1]+fib[i-2])%MOD;
int_fast64_t ans = 1;
scanf("%d %d", &n, &m);
for(i=0; i<m; i++){
scanf("%d", &t);
ans = ans * fib[t-pr-1] % MOD;
pr = t;
}
printf("%ld\n", ans * fib[n-pr] % MOD);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int f[100003];
int n,m,x;
int main()
{
scanf("%d %d", &n,&m);
f[0]=1;
f[1]=1;
for (int i=1;i<=m;++i)
{
scanf("%d",&x);
f[x]=-1;
}
if (f[1]==-1) f[1]=0;
for (int i=2;i<=n;++i)
{
if (f[i]==-1)f[i]=0;else f[i]=(f[i-1]+f[i-2])%1000000007;
}
printf("%d\n",f[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
vector<int> a(m);
vector<long long> dp(n+100);
vector<bool> dd(n+100,true);
for(int i=0;i<m;i++){
cin>>a[i];
dd[a[i]]=false;
}
dp[0]=1;
if(dd[1]) dp[1]=1;
else dp[1]=0;
for(int i=1;i<n+3;i++){
if(dd[i+1]) dp[i+1]=dp[i]+dp[i-1];
dp[i+1]%=(1000000000+7);
}
cout<<dp[n]<<endl;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int n, m, a, d[100005]={1,1}, v[100005], M = 1e9+7;
int main() {
int i;
cin>>n>>m;
while(m--) {
scanf("%d", &a);
v[a] = 1;
d[a] = 0;
}
for(i=2; i<=n; i++) {
if(!v[i]) d[i] = (d[i-1] + d[i-2]) % M;
}
cout<<d[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef vector<long> vec;
int main(){
long n,m;cin>>n>>m;
long st[n+5];
vec a(m);
rep(i,m)cin>>a[i];
st[0]=1;
for(int i=0;i<n;i++)st[i+1]=1;
for(auto x:a)st[x]=0;
for(int i=0;i<n;i++){
if(st[i+2]==0)continue;
st[i+2]=(st[i+1]+st[i])%1000000007;
}
cout<<st[n]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main(){
int i,j,cnt=0;
int n,m;
cin>>n>>m;
int a[m];
for(i=0;i<m;i++)cin>>a[i];
ll p[n+1];
for(i=0;i<=n;i++)p[i]=1;
for(i=0;i<m;i++)p[a[i]]=0;
for(i=1;i<=n;i++){
if(p[i]!=0){
if(i!=1)p[i]=(p[i-1]+p[i-2])%MOD;
else p[i]=p[i-1];
}
}
cout<<p[n];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, B = 1e9+7;
scanf("%d %d", &N,&M);
vector<int> vec(N + 1, -1);
vec.at(0) = 1;
vec.at(1) = 1;
for (int i = 0; i < M; i++) {
scanf("%d", &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;
}
printf("%d\n",vec.at(N));
}
|
#include<iostream>
using namespace std;
int main(){
int n,m,i,j = 0;cin >> n >> m;
int x[m];long long dp[n+1];dp[0] = 1;
for(i=0;i<m;i++) cin >> x[i];
for(i=1;i<=n;i++){
if(x[j]==i){
dp[i] = 0;j++;
} else if(i==1) dp[i] = 1;
else dp[i] = dp[i-2]+dp[i-1];
dp[i] %= 1000000007;
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main(){
int n, m;
cin >> n >> m;
int a;
vector<int> dp(n+1,1);
for(int i=0; i<m; ++i){
cin >> a;
dp[a]=0;
}
for(int i=2; i<=n; ++i) dp[i] = dp[i]*(dp[i-1]+dp[i-2])%mod;
cout << dp[n] << endl;
}
|
#include <iostream>
using namespace std;
int main(void){
long long N,M,i,j,mod;
mod=1e9+7;
cin>>N>>M;
long long a[N+1],b[N+1];
for(i=0;i<N+1;i++){
a[i]=1;
}
for(i=0;i<M;i++){
cin>>j;
a[j]=0;
}
b[0]=1;b[1]=a[1];
for(i=2;i<N+1;i++){
b[i]=((b[i-2]+b[i-1])*a[i])%mod;
}
cout<<b[N]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=1e5+10;
int n, m, x;
int vis[N];
ll dp[N];
int main() {
cin>>n>>m;
for(int i=1; i<=m; i++) {
cin>>x;
vis[x]=1;
}
dp[0]=1;
for(int i=1; i<=n; i++) {
if (vis[i]) continue;
dp[i]=dp[i-1];
if (i>=2) dp[i]+=dp[i-2];
dp[i]%=mod;
}
cout<<dp[n]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, M; cin >> N >> M;
vector<bool> bs(N + 2);
while (M--)
{int a; cin >> a;
bs[a] = true;}
vector<long long> dp(N + 2);
dp[0] = 1;
for (int i = 0; i < N; ++i)
{for (int j = 1; j <= 2; ++j)
{if (!bs[i + j]) dp[i + j] = (dp[i + j] + dp[i]) % 1000000007;}}
cout << dp[N] << endl;}
|
#include <cstdio>
#define MOD 1000000007
int f[100005],t[100005],n,m;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
t[x]=1;
}
f[0]=1;
if(!t[1])f[1]=1;
for(int i=2;i<=n;i++)
if(!t[i])f[i]=(f[i-1]+f[i-2])%MOD;
printf("%d\n",f[n]);
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;
}
}
cout<<a[n]%1000000007;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
unordered_set<int> a;
for(int i=0;i<M;i++){
int j;
cin>>j;
a.insert(j);
}
int j=0,k=1;
for(int i=0;i<N;i++){
k+=j;
j=k-j;
if(a.count(i+1))
k=0;
if(k/1000000007)
k%=1000000007;
if(j/1000000007)
j%=1000000007;
}
cout<<k<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod=1000000007;
long long dp[100005];
bool a[100005];
int n,m,x;
int main()
{
scanf(" %d %d",&n,&m);
for(int i=0;i<m;i++){
scanf(" %d",&x);
a[x]=1;
}
dp[0]=1;dp[1]=(a[1]==1?0:1);
for(int i=2;i<=n;i++)
dp[i]=(a[i]==1?0:dp[i-1]+dp[i-2])%mod;
cout<<dp[n]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD=1000000007;
int main(){
int N,M;
cin >> N >> M;
vector<long long> dp(N+1,0LL);
vector<int> a(M);
for(auto &i:a)cin >> i;
dp[0]=1;
for(int i=0;i<=N;i++){
if(binary_search(a.begin(),a.end(),i))dp[i]=0LL;
if(dp[i]>=MOD)dp[i]%=MOD;
if(i<N-1)dp[i+2]+=dp[i];
if(i<N)dp[i+1]+=dp[i];
}
cout << dp[N] << endl;
return 0;
}
|
#include <cstdio>
const int P = 1000000007;
void add(int &x, int y)
{
x = (x + y) % P;
}
int n, m, F[100005];
bool del[100005];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1, x; i <= m; ++i)
scanf("%d", &x), del[x] = true;
F[0] = 1;
for (int i = 0; i <= n; ++i)
{
if (del[i]) F[i] = 0;
add(F[i + 1], F[i]);
add(F[i + 2], F[i]);
}
printf("%d\n", F[n]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
const int P=1e9+7;
int n,m,a[N],ans[N],tot;
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)cin>>a[i];
ans[0]=1;
for(int i=1;i<=n;i++){
if(a[tot]==i){tot++;continue;}
ans[i]=i>1?(ans[i-1]+ans[i-2])%P:ans[i-1];
}
cout<<ans[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll d[100005],mod=1e9+7;
map<ll,ll> p;
int main(){
ll n,m,x;
cin>>n>>m;
for(ll i=1;i<=m;i++){
cin>>x;
p[x]=1;
}
d[0]=1;
if(p[1]==1) d[1]=0;
else d[1]=1;
for(ll i=2;i<=n;i++){
if(p[i]==1) continue;
d[i]=(d[i-1]%mod+d[i-2]%mod)%mod;
}
cout<<d[n]%mod<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n+1, 0);
vector<int> flg(n+1, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
flg[i] = (flg[i-1] + flg[i-2]) % mod;
}
cout << flg[n] << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n,m; cin >> n >> m; vector<ll> A(n+1,0); int a;
for (int i=0;i<m;i++)
{ cin >> a;
A[a]=-1;
}
vector<ll> dp(n+1,0);
ll mod=1e9+7;
dp[0]=1; dp[1]=(A[1]==0);
for (int i=2;i<=n;i++)
{
if (A[i]==-1) dp[i]=0;
else
{
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
}
cout << dp[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
int main(){
int N,M;
cin>>N>>M;
vector<int>A(N+1,1);
for(int i=0;i<M;++i){
int l;
cin>>l;
A[l]=0;
}
vector<long long int>dp(N+1);
dp[0]=1;
for(int x=0;x<N;x++){
for(int y=x+1;y<=min(N,x+2);y++){
if(A[y]){
dp[y]+=dp[x];
dp[y]%=mod;
}
}
}
cout<<dp[N]<<endl;
}
|
#include <bits/stdc++.h>
#define N 1000005
#define mod 1000000007
using namespace std;
int n,m;
int f[N];
bool vis[N];
int main(){
cin >> n >> m;f[0] = 1;
for(int i = 1; i <= m; ++i){
int a;cin >> a;
vis[a] = true;
}
for(int i = 0; i <= n; ++i){
if(!vis[i + 1]) (f[i + 1] += f[i]) %= mod;
if(!vis[i + 2]) (f[i + 2] += f[i]) %= mod;
}
cout << f[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
int n,m;
std::cin >> n>>m;
std::vector<int> a (n,-1);
int i;
int b;
a[0]=1;
for (i=0;i<m;i++){std::cin >> b;a[b-1]=0;}
if(a[1]!=0)a[1]=a[0]+1;
for (i=2;i<n;i++){
if(a[i]!=0)a[i]=(a[i-2]+a[i-1])%1000000007;
}
std::cout << a[n-1]%1000000007 << std::endl;
}
|
#include <cstdio>
using namespace std;
const int L = 1000000007;
int N, M, t, a[100001], dp[100001];
int main() {
scanf("%d %d", &N, &M);
for(int i = 0; i < M; i++) {scanf("%d", &t); a[t] = 1;};
dp[0] = 1, dp[1] = !a[1];
for(int i = 2; i <= N; i++) {
if(a[i]) {dp[i] = 0; continue;}
dp[i] = (dp[i-1]+dp[i-2])%L;
}
printf("%d", dp[N]);
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int n,m,tmp;
bool cant[1000010];
long long dp[1000010];
int main(){
cin>>n>>m;
while(m--){
scanf("%d",&tmp);
cant[tmp]=1;
}
dp[0]=1;
if(!cant[1]) dp[1]=1;
for(int i=2;i<=n;i++){
if(!cant[i]) dp[i]=(dp[i-1]+dp[i-2])%mod;
}
cout<<dp[n];
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod=1000000007;
int main(){
int n,m;
cin>>n>>m;
int a[m+1];
int d[n+1];
memset(d,-1,sizeof(d));
d[0]=d[1]=1;
for(int i=1;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;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int mn=1e5+7,mod=1e9+7;
int vis[mn],f[mn],n,m,a;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;++i) {scanf("%d",&a);a++;vis[a]=1;}
f[1]=1;
for(int i=2;i<=n+1;++i) {
if(!vis[i-1]) f[i]+=f[i-1];
f[i]%=mod;
if(!vis[i-2]) f[i]+=f[i-2];
f[i]%=mod;
}
printf("%d",f[n+1]);
}
|
#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] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1e9+7;
using P=pair<ll,ll>;
int main(){
ll N,M,dp[100020];
cin>>N>>M;
unordered_map<ll,ll> mp;
for(ll i=0;i<M;i++){
ll a;
cin>>a;
mp[a]=-1;
}
dp[0]=1;
for(ll i=1;i<=N;i++){
if(mp[i]!=-1){dp[i]=(dp[i-1]+dp[i-2])%MOD;}
else{dp[i]=0;}
}
cout<<dp[N]%MOD<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m;
long long a[100010];
int main(){
cin>>n>>m;
a[0]=1;
for(int i=0;i<m;i++){
int x;
cin>>x;
a[x]=-1;
}
for(int 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;
}
}
cout<<a[n]%1000000007;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(m);
for(int i=0; i<m; ++i) cin >> a[i];
vector<int> dp(n+1,1);
for(int i=0; i<m; ++i) dp[a[i]]=0;
for(int i=2; i<=n; ++i) dp[i] = dp[i]*(dp[i-1]+dp[i-2])%mod;
cout << dp[n] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const long long mod = 1e9+7;
int main(){
int N, M;
cin >> N >> M;
vector<int>oks(N+1, true);
for(int i=0; i<M; ++i){
int a;
cin >> a;
oks[a] = false;
}
vector<long long int>dp(N+1, 0);
dp[0] = 1;
if(oks[1]==true) dp[1] = 1;
for(int i=2; i <=N; i++){
if(oks[i]==true){
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
}
cout << dp[N] << endl;
}
|
#include<cstdio>
#define mod 1000000007
typedef long long ll;
const int MAXN=100000+10;
int n,m;
int a[MAXN];
int dp[MAXN];
bool vis[MAXN];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d",&a[i]);
vis[a[i]]=1;
}
dp[0]=1;
for(int i=1;i<=n;i++){
if(vis[i]) continue;
dp[i]=dp[i-1]+dp[i-2];
dp[i]%=mod;
}
printf("%d\n",dp[n]%mod);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+100;
typedef long long ll;
const ll mod = 1000000007;
ll f[N];
bool vis[N];
int main(){
ll n,m,x;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>x;vis[x]=1;
}
f[0]=1;
f[1]=1;
if(vis[1]) f[1]=0;
for(int i=2;i<=n;i++){
if(vis[i]) f[i]=0;
else f[i]=(f[i-1]%mod+f[i-2]%mod)%mod;
}
cout<<f[n]%mod<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M,tmp;
const int at = pow(10,9)+7;
cin >> N >> M;
vector<int>dp(N+1),br(N+1,1);
for (size_t i = 0; i < M; i++)
{
cin >> tmp;
br.at(tmp) = 0;
}
dp.at(0) = 1;
dp.at(1) = 1 * br.at(1);
for (size_t i = 2; i < N+1; i++)
{
dp.at(i) = (dp.at(i - 2) % at + dp.at(i - 1) % at)%at * br.at(i);
}
cout << dp.at(N);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >>N>>M;
vector<bool> bad(N+1);
vector<int> vec(N+2);
for(int i=0;i<M;i++){
int a;cin>>a;
bad[a]= true;
}
const int mod = 1000000007;
vec[N]=1;
for(int i=N-1;i>=0;i--){
if(bad[i]) {
vec[i]=0;
continue;
}
vec[i] = (vec [i+1]+vec[i+2])%mod;
}
cout << vec[0]<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
const ll mod=1e9+7;
int n,m;
cin>>n>>m;
vector<ll>dp(n+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])%mod;
}
cout<<dp[n]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i, n, m, x, mod1=1000000007;
cin >> n >> m;
int ans[n+1];
for(i=0; i<=n; i+=1)
ans[i]=1;
for(i=0; i<m; i+=1)
{
cin >> x;
ans[x]=0;
}
for(i=2; i<=n; i+=1)
{
if(ans[i]!=0)
ans[i]=(ans[i-1]+ans[i-2])%mod1;
}
cout << ans[n] << endl;
}
|
#include<iostream>
using namespace std;
int dp[100001] = {0};
int main(){
int n,m,tmp;
cin >> n >> m;
for(int i=0;i<m;++i){
cin >> tmp;
dp[tmp] = -1;
}
dp[0] = 1;
for(int i=0;i<n;++i){
for(int j=1;j<=2;++j){
int next = i+j;
if(next > n || dp[next] == -1 || dp[i] == -1) continue;
dp[next] = (dp[next] +dp[i])%1000000007;
}
}
cout << dp[n] <<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N,M,a;
cin >>N>>M; unsigned long long int S[N+2];
for(long long int i=1;i<N+1;i++){
S[i]=1;
}
S[2]=2;
for(long long int i=0;i<M;i++){
cin >> a;
S[a]=0;
}
if(S[1]==0&&S[2]!=0)S[2]=1;
for(long long int i=1;i<N-1;i++){
if(S[i+2]!=0)S[i+2]=S[i+1]+S[i];
S[i+2]%=1000000007;
}
cout <<S[N];
}
|
#include <bits/stdc++.h>
using namespace std;
long long dp[100002];
int main() {
int n, m; cin >> n >> m;
int a;
for(int i=0; i<m; ++i){
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
for(int i=0; i<n; ++i){
if(dp[i] == -1) continue;
if(dp[i+2] != -1) dp[i+2] += dp[i] % 1000000007;
if(dp[i+1] != -1) dp[i+1] += dp[i] % 1000000007;
}
cout << dp[n] % 1000000007 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,a,mod=1e9+7,dp[114514];
bool f[114514];
int main() {
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a;
f[a]=1;
}
dp[0]=1;
if(!f[1])dp[1]=1;
for(int i=2;i<=n;i++)if(!f[i]){
dp[i]=dp[i-1]+dp[i-2];
dp[i]%=mod;
}
cout<<dp[n];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7,mod=1e9+7;
int n,m,a[N],f[N];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1,x;i<=m;i++)scanf("%d",&x),a[x]=1;
f[0]=1;
for(int i=1;i<=n;i++)if(!a[i])f[i]=(f[i-1]+f[i-2])%mod;
printf("%d\n",f[n]);
}
|
#include <bits/stdc++.h>
using namespace std;
long long dp[100002];
int a[100002];
long long MOD = 1e9 + 7;
map<int,int> ma;
int main() {
int n, m;
cin>>n>>m;
int i;
dp[0] = 1;
for(i=1;i<=n;i++) cin >> a[i], ma[a[i]]++;
for(i=1;i<=n;i++) {
if(ma[i]) continue;
if(i-2>=0)
dp[i]+=dp[i-2];
dp[i]+=dp[i-1];
dp[i]%=MOD;
}
cout<<dp[n];
return 0;
}
|
#include<cstdio>
const int N=1e5+10;
const int mod=1000000007;
int n,a[N],m,k;
long long f[N];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
scanf("%d",&k);
a[k]=1;
}
f[0]=1;
if(!a[1])f[1]=1;
for(int i=2;i<=n;i++)
if(!a[i])
{
if(!a[i-1])f[i]=(f[i]+f[i-1])%mod;
if(!a[i-2])f[i]=(f[i]+f[i-2])%mod;
}
printf("%lld",f[n]);
return 0;
}
|
#include<iostream>
using namespace std;
int N;
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;
#define MOD 1000000007
int N, M;
long long dp[100005];
bool a[100005];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int b;
cin >> b;
a[b] = true;
}
dp[0] = 1;
dp[1] = (!a[1]) ? 1 : 0;
for (int i = 2; i <= N; i++) {
if (!a[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<int> a(N+1);
for(int i=0;i<M;i++){
int j;
cin>>j;
a[j]++;
}
vector<long long> dp(N+1);
dp[0]=1;
for(int i=0;i<N;i++) {
for(int j=i+1;j<=min(i+2,N);j++){
if(a[j]==0) {
dp[j]+=dp[i];
dp[j]%=1000000007;
}
}
}
long long ans=dp[N];
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
int M = 1e9 + 7;
int n, m, d[N] = {0, 1};
bool v[N];
int main()
{
int i, t;
cin >> n >> m;
while (m--) scanf("%d", &t), v[t + 1] = 1;
for (i = 2; i <= n + 1; i++) {
if (!v[i]) d[i] = (d[i - 1] + d[i - 2]) % M;
}
cout << d[n + 1] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int d[100005],a[100005],n,m;
void add(int &a,int b){
a = (a + b)%mod;
}
signed main(){
d[0] = 1;
cin >> n >> m;
for(int i = 0 ; i < m ; i ++){
int x; cin >> x;
a[x] = 1;
}
for(int i = 0 ; i < n ; i ++){
if(!a[i + 1]) add(d[i + 1], d[i]);
if(!a[i + 2]) add(d[i + 2], d[i]);
}
cout << d[n];
}
|
#include <iostream>
using namespace std;
const int Nmax = int(1e5 + 5),MOD = 1e9 + 7;
int dp[Nmax];
int N,M,X;
int main() {
cin >> N >> M;
while(M--) {
cin >> X;
dp[X] = -1;
}
dp[N] = 1;
for(int i = N - 1; i >= 0; --i)
if(dp[i] == -1)
dp[i] = 0;
else
dp[i] = (dp[i + 1] + dp[i + 2]) % MOD;
cout <<dp[0];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<bool> used;
int main(){
int n, m;
cin>>n>>m;
int d0 = 0, d1 = 1, d2;
int i = 1;
for(int j = 0; j <= m; ++j){
int i1;
if(j < m)cin>>i1;
else i1 = n + 1;
for(; i < i1 ;++i){
d2 = d0 + d1;
if(d2 >= MOD)d2 -= MOD;
d0 = d1; d1 = d2;
}
d0 = d1;
d1 = 0;
i++;
}
cout<<d0<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(){
int n,m; cin>>n>>m;
vector<long long> v(n+1);
set<int> a;
for(int i=0;i<m;i++) { int ai;cin>>ai;a.insert(ai); }
v[0]=1;
v[1]=a.count(1)?0:1;
for(int i=2;i<=n;i++){
v[i]=a.count(i)?0:(v[i-1]+v[i-2])%1000000007;
}
cout<<v[n]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,i,b;
long long int a[100005];
int main ()
{
for ( i = 0 ; i <= 100004 ; ++ i )
a[i] = 1;
cin >> n >> m;
for ( i = 1 ; i <= m ; ++ i )
{
cin >> b;
a[b] = 0;
}
for ( i = 2 ; i <= n ; ++ i )
a[i] = ( a[i-1] + a[i-2] ) * a[i] % 1000000007;
cout << a[n] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
bool b[100005];
int f[100005];
int main(){
int m,n;
cin>>m>>n;
for(int i=1,k;i<=n;i++)
{cin>>k;
b[k]=1;
}
if(!b[1])f[1]=1;
if(!b[2])f[2]=f[1]+1;
for(int i=3;i<=m;i++)
{if(b[i])continue;
f[i]=(f[i-1]+f[i-2])%1000000007;
}
cout<<f[m]<<endl;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int M=1000000007;
int a[100003];
int main()
{
int n,m;
cin>>n>>m; a[0]=1;
for (int i=1; i<=m; i++)
{
int x;
cin>>x; a[x]=-1;
}
if (a[1]==0) a[1]=1;
for (int i=2; i<=n; i++)
{
if (a[i]==-1) continue;
int res=0;
if (a[i-1]!=-1) res+=a[i-1];
if (a[i-2]!=-1) res+=a[i-2];
a[i]=res%M;
}
cout << a[n];
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int32_t main() {
int n, m; cin>>n>>m;
vector<int> dp(n + 1);
set<int> broken;
for(int i = 0; i < m; i++){
int x; cin>>x;
broken.insert(x);
}
dp[0] = 1;
dp[1] = (broken.count(1) ? 0 : 1);
for(int i = 2; i <= n; ++i){
dp[i] = (broken.count(i) ? 0 : (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<bool> bs(N + 1);
while (M--)
{int a; cin >> a;
bs[a] = true;}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int i = 1; i <= N; ++i)
{if (!bs[i]) dp[i] = (dp[i - 1] + (i < 2 ? 0 : dp[i - 2])) % 1000000007;}
cout << dp[N] << endl;}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, M; cin >> N >> M;
vector<bool> bs(N);
while (M--) {int a; cin >> a; bs[--a] = true;}
vector<int64_t> dp(N + 1); dp[0] = 1;
for (int i = 0; i < N; ++i) if (!bs[i]) dp[i + 1] = (dp[i] + (i >= 1 ? dp[i - 1] : 0)) % 1000000007;
cout << dp[N] << endl;}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
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<bits/stdc++.h>
using namespace std;
const int N=100005,mod=1000000007;
int a[N],b[N],dp[N];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
b[x]=1;
}
dp[0]=1;
dp[1]=b[1]^1;
for(int i=2;i<=n;i++)
{
if(b[i])
continue;
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
printf("%d\n",dp[n]);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.