入门题北大oj.doc

1000
#include<>
int main()
{
int a,b,c;
while(scanf("%d%d",&a,&b)!=EOF)
{
c=a+b;
printf("%d\n",c);
}
}
1067
#include<>
#include<>
#include<>
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
{
if(a>b)
{
int t=a;
a=b;
b=t;
}
int k=b-a;
int a0=(int)(k*(1+sqrt())/2);
if(a0==a) printf("0\n");
else printf("1\n");
}
}
1080
#include<>
#include<>
int a[5][5]={5,-1,-2,-1,-3,-1,5,-3,-2,-4,-2,-3,5,-2,-2,-1,-2,-2,5,
-1,-3,-4,-2,-1,0};
int main()
{
int ca;
scanf("%d",&ca);
while(ca--)
{
int n,m,i,j,max[105][105],b[105],d[105];
char s[105],c[105];
scanf("%d%s",&n,s);
scanf("%d%s",&m,c);
for(i=1;i<=n;i++)
{
if(s[i-1]=='A') b[i]=0;
if(s[i-1]=='C') b[i]=1;
if(s[i-1]=='G') b[i]=2;
if(s[i-1]=='T') b[i]=3;
}
for(i=1;i<=m;i++)
{
if(c[i-1]=='A') d[i]=0;
if(c[i-1]=='C') d[i]=1;
if(c[i-1]=='G') d[i]=2;
if(c[i-1]=='T') d[i]=3;
}
max[0][0]=0;
for(i=1;i<=n;i++)
max[i][0]=max[i-1][0]+a[b[i]][4];
for(i=1;i<=m;i++)
max[0][i]=max[0][i-1]+a[4][d[i]];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
max[i][j]=max[i-1][j-1]+a[b[i]][d[j]];
if(max[i-1][j]+a[b[i]][4]>max[i][j])
max[i][j]=max[i-1][j]+a[b[i]][4];
if(max[i][j-1]+a[4][d[j]]>max[i][j])
max[i][j]=max[i][j-1]+a[4][d[j]];
}
printf("%d\n",max[n][m]);
}
}
1013
#include<>
#include<algorithm>
#include<>
#include<>
#define PI
using namespace std;
struct point
{
double x;
double y;
}p[30005],res[30005];
int cmp(point p1,point p2)
{
return <||(==&&<);
}
bool ral(point p1,point p2,point p3)
{
if((-)*(-)<=(-)*(-)) return true;
return false;
}
double dis(point p1,point p2)
{
return sqrt((-)*(-)+(-)*(-));
}
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
int i,j;
for(i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].