NOIP2008_2012年12月16号农历是

#include<bits/stdc++.h>
char a[105],b[1005],ans[1005];
int len1,len2,h=1,p;
int c[105];
using namespace std;
int main(){
//	freopen("vigenere.in","r",stdin);
	//freopen("vigenere.out","w",stdout);
    scanf("%s%s",a+1,b+1);
    len1=strlen(a+1);
	len2=strlen(b+1);
    for(int i=1;i<=len1;i++){
        if(a[i]>='a') a[i]=a[i]-('a'-'A');
        c[i]=a[i]-130;
    }
  /*  for(int i=1;i<=len1;i++){
    	cout<<c[i];
	}*/
    for(int i=1;i<=len2;i++,h++){
        if(h>len1) h=1;
        if(b[i]>='a'){
        	p=b[i]-('a'-'A');
		}
		else p=b[i];
        p-='A';
        for(int x='A';x<='Z';x++){
		if((x+c[h])%26==p){
		ans[i]=x;
		break;
		}
	}
        if(b[i]>='a') ans[i]+='a'-'A';
}
    for(int i=1;i<=len2;i++)
	cout<<ans[i];
}

#include<bits/stdc++.h>
using namespace std;
struct node{
	long long l;
	long long r;
	long long t;
}a[1000001]; 
long long cmp(node a,node b){
	return a.t<b.t;
}
long long ans=-9999999999,suml,n;
int main(){
	//freopen("game.in","r",stdin);
	//freopen("game.out","w",stdout);
	cin>>n;
	for(int i=0;i<=n;i++){
		cin>>a[i].l>>a[i].r;
		a[i].t=a[i].l*a[i].r;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=0;i<=n;i++){
		suml=1;
		for(int j=0;j<i;j++){
			suml*=a[j].l;
		}
		if(suml/a[i].r>ans) ans=suml/a[i].r;
	} 
	cout<<ans;
}

在这里插入代码片

#include<bits/stdc++.h>
using namespace std;
long long a,b,x,y;
void gcd(long long a,long long b,long long &x,long long &y){
    if(!b){
        x=1;y=0;
        return;
    }
    gcd(b,a%b,x,y);
    long long c=x;
    x=y;
    y=c-a/b*y;
}
int main(){
	//freopen("mod.in","r",stdin);
//	freopen("mod.out","w",stdout);
    cin>>a>>b;
    gcd(a,b,x,y);
    x=(x%b+b)%b;
    cout<<x;
}

#include<bits/stdc++.h>
using namespace std;
struct node{
	int x,y,z;
}b[1000005];
int a[1000005],c[1000005];
int n,m,ans,sum,l,r;
bool check(int k){	
	memset(c,0,sizeof(c));
	sum=0;
	for(int i=1;i<=k;++i){
	c[b[i].y]+=b[i].x;
	c[b[i].z+1]-=b[i].x;
}
	for(int i=1;i<=n;++i)
	{
	   sum+=c[i];
	   if(sum>a[i]) return false;（然而考试的时候这里打错了）
    }
    return true;
}
int main(){
//	freopen("classroom.in","r",stdin);
//	freopen("classroom.out","w",stdout);
	cin>>n>>m; 
	for(int i=1;i<=n;++i)
	scanf("%d",&a[i]);
	for(int i=1;i<=m;++i)
	scanf("%d%d%d",&b[i].x,&b[i].y,&b[i].z);
	r=m,l=1;
	while(l<=r)
	{
		int mid=(l+r)>>1;
		if(!check(mid)){
		ans=mid;
		r=mid-1;
		}
		else l=mid+1;
	}
	if(!ans) cout<<0;
	else cout<<-1<<endl<<ans;
}

在这里插入代码片