2018.02.02【NOIP普及组】模拟赛D组

JZOJ NO.1【2014.8.17NOIP普及组模拟】公牛数学

高精乘代码

#include <cstdio>
#include <cctype>
using namespace std;
unsigned short a[51],b[51],len1,len2,c[101];
void in1(){
	char x=getchar();
	while (!isdigit(x)) x=getchar();
	while (isdigit(x)) a[++len1]=x-48,x=getchar();
}
void in2(){
	char x=getchar();
	while (!isdigit(x)) x=getchar();
	while (isdigit(x)) b[++len2]=x-48,x=getchar();
}
int main(){
	freopen("bullmath.in","r",stdin);
	freopen("bullmath.out","w",stdout);
	in1();in2();
	for (int i=1;i<=len1;i++)
	for (int j=1;j<=len2;j++) c[i+j-1]+=a[i]*b[j];
	for (int i=len1+len2-1;i>=1;i--) c[i-1]+=c[i]/10,c[i]%=10;
	for (int i=(c[0]==0);i<=len1+len2-1;i++) putchar(c[i]+48);
} 

---

JZOJ NO.2【2014.8.17NOIP普及组模拟】愤怒的牛

---

JZOJ NO.3 【2012.03.09普及组】约数和

纯模拟

#include <cstdio>
#include <cmath>
using namespace std; int t,n,a[5000001];
int main(){scanf("%d",&t);
	while (t--){
	scanf("%d",&n);
	if (a[n]) {printf("%d\n",a[n]);continue;}
	int ans=0;
	for (int i=1;i<=floor(sqrt(n));i++) if (!(n%i)) ans+=i+n/i;
	if (sqrt(n)==floor(sqrt(n))) ans-=floor(sqrt(n));
	printf("%d\n",ans); a[n]=ans;//保存更省时
	}
}

JZOJ NO.4 【2012.03.09普及组】旅行

深搜

#include <cstdio>
using namespace std;
unsigned short n,ans,a[35]; int c,r;
void dfs(int dep){
	if (dep==n) ans++;
	for (int i=dep+1;i<=n;i++)
	if ((a[i]-a[dep])>=c&&(a[i]-a[dep])<=r) dfs(i); 
	else if ((a[i]-a[dep])>r) break;
}
int main(){
	a[1]=990; a[2]=1010; a[3]=1970; a[4]=2030; a[5]=2940;
	a[6]=3060; a[7]=3930; a[8]=4060; a[9]=4970;
    a[10]=5030;a[11]=5990; a[12]=6010; a[13]=7000;
	scanf("%d%d%d",&c,&r,&n); n+=13; int t;  
	for (int i=14;i<=n;i++) scanf("%d",&a[i]);
	for (int i=1;i<=n-1;i++)
	for (int j=i+1;j<=n;j++)
	if (a[i]>a[j]) t=a[i],a[i]=a[j],a[j]=t;
	dfs(0);
	printf("%d",ans);
	return 0;
}

---

JZOJ NO.5 【2012.03.09普及组】逆序统计

分析

DP
状态转移方程：
$f[i][j]=f[i-1][j]+f[i][j-1]$
$(j>=i)f[i][j]-=f[i-1][j-i]$

---

代码

#include <cstdio>
using namespace std;
short n,k,f[2][5001];
int main(){
	scanf("%d%d",&n,&k);
	f[0][0]=f[1][0]=1;
	for (int i=1;i<=n;i++)
	for (int j=1;j<=k;j++){
		f[i&1][j]=(f[i&1][j-1]+f[1-i&1][j])%10000;
		if (j>=i) f[i&1][j]=(f[i&1][j]-f[1-i&1][j-i])%10000;
	}
	printf("%d",(f[n&1][k]%10000+10000)%10000);
}