Codeforces Round #520 (Div. 2)

A Prank

//A Prank

#include<bits/stdc++.h>
using namespace std;
const int N=105;
int main(){
	int n,ans=0;
	int a[N];
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	a[0]=0;
	a[n+1]=1001;
	int s=0;
	for(int i=1;i<=n;i++){
		if(a[i]-a[i-1]==1&&a[i+1]-a[i]==1){
			s++;
			ans=max(s,ans);
		}
		else s=0;	
	}
	printf("%d\n",ans);
}

B. Math

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,ans=0,f=0;
	scanf("%d",&n);
	while(int(sqrt(n))==sqrt(n)&&n>1){
		ans++;
		n=sqrt(n);
	}  
	for(int i=sqrt(n);i>1;i--){
		while(n%(i*i)==0){
			ans++;
			n/=i;
			f=1;
		}
	}
	printf("%d %d\n",n,ans+f);
}

C. Banh-mi

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100005;
const int mod=1e9+7;
ll o[maxn],p[maxn],q1[maxn],k;
int main(){
	int n,q;
	memset(o,0,sizeof(o));
	memset(p,0,sizeof(p));
	memset(q1,0,sizeof(q1));
		scanf("%d%d",&n,&q);
		for(int i=1;i<=n;i++){
			scanf("%1lld",&k);
			p[i]=p[i-1]*2%mod+1;
			o[i]=o[i-1]+k;
			q1[i]=i-o[i];
		}
		ll l,r,a,b;
		while(q--){
			scanf("%lld%lld",&l,&r);
			a=o[r]-o[l-1];
			b=q1[r]-q1[l-1];
			printf("%lld\n",p[a]*(p[b]+1)%mod);
		}	
	
}