博文
pku3219(2007-08-18 20:13:00)
摘要：#include <stdio.h>
int F(int n)
{ //n! = 2^k * k! * a
//k = n / 2, a不含因子2
int sum = 0;
while(n >= 2)
{
sum += n / 2;
n /= 2;
}
return sum;
}
int main(void)
{
int n, k;
while(EOF != scanf("%d%d", &n, &k))
{
if(F(n) > F(n - k) + F(k))
printf("0\n");
else
printf("1\n");
}
return 0;
}......
pku2242(2007-08-18 20:12:00)
摘要：#include<iostream>
#include<cmath>
using namespace std;
#define pi 3.141592653589793
int main()
{
double x1,y1,x2,y2,x3,y3,a,b,c,l,s,r,L;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3)
{
a=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
b=sqrt((x3-x1)*(x3-x1)+(y3-y1)*(y3-y1));
c=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
l=(a+b+c)/2;
s=sqrt(l*(l-a)*(l-b)*(l-c));
r=(a*b*c)/(4*s);
L=2*pi*r;
printf("%.2f\n",L);
}
return 0;
}......
pku2027(2007-08-18 20:11:00)
摘要：#include<iostream>
using namespace std;
int main()
{
int n,x,y;
cin>>n;
while(n>0)
{
n--;
cin>>x>>y;
if(x>=y)
cout<<"MMM BRAINS\n";
else
cout<<"NO BRAINS\n";
}
return 0;
}......
pku2017(2007-08-18 20:11:00)
摘要：#include<iostream>
using namespace std;
int main()
{
int n,s,t,t0,i,sum;
while(cin>>n)
{
if(n==-1)
break;
sum=0;
t0=0;
for(i=0;i<n;i++)
{
cin>>s>>t;
sum+=s*(t-t0);
t0=t;
}
cout<<sum<<" miles\n";
}
return 0;
}......
pku1731(2007-08-18 20:10:00)
摘要：#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string s;
while(cin>>s)
{
sort(s.begin(),s.end());
cout<<s<<endl;
while(next_permutation(s.begin(),s.end())) {
cout<<s<<endl;
}
}
return 0;
}
......
pku1844(2007-08-17 23:39:00)
摘要：#include<stdio.h>
#include<math.h>
int main()
{
int n,i,sum;
while(scanf("%d",&n)!=EOF)
{
i=(sqrt(1+8*n)-1)/2;
sum=(i+1)*i/2;
while(sum<n) sum+=++i;
if((sum-n)%2==0) printf("%d\n",i);
else printf("%d\n",i&1?i+2:i+1);
}
return 0;
}
或者：#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int s,n,t;
while(cin>>s)
{
n=sqrt(s*2);
t=(n+1)*n/2;
if(t<s)
{
n++;
t+=n;
}
if((t-s)%2==0)
{
cout<<n<<endl;
}
else
{
if(n%2==0)
cout<<n+1<<endl;
else
cout<<n+2<<endl;
}
}
return 0;
}......
pku3325(2007-08-17 23:38:00)
摘要：#include<iostream>
using namespace std;
int main()
{
int n,s,sum,ave,max,min,i;
while(cin>>n)
{
if(n==0)
break;
cin>>s;
sum=max=min=s;
for(i=1;i<n;i++)
{
cin>>s;
sum+=s;
if(max<s)
max=s;
else if(min>s)
min=s;
}
ave=(sum-max-min)/(n-2);
cout<<ave<<endl;
}
return 0;
}......
pku1163(2007-08-17 23:37:00)
摘要：#include<iostream>
using namespace std;
int main()
{
int n,t[101][101],i,j,max;
while(cin>>n)
{
max=0;
for(i=0;i<n;i++)
for(j=0;j<=i;j++)
cin>>t[i][j];
for(i=1;i<n;i++)
{
t[i][0]=t[i-1][0]+t[i][0];
t[i][i]=t[i-1][i-1]+t[i][i];
}
for(i=2;i<n;i++)
{
for(j=1;j<i;j++)
{
if(t[i-1][j-1]>t[i-1][j])
t[i][j]=t[i-1][j-1]+t[i][j];
else
t[i][j]=t[i-1][j]+t[i][j];
}
}
for(i=0;i<n;i++)
if(max<t[n-1][i])
max=t[n-1][i];
cout<<max<<endl;
}
return 0;
}......
pku1028(2007-08-17 23:36:00)
摘要：#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char command[8],url[101][75]={"http://www.acm.org/"};
int k=0,n;
while(cin>>command)
{
if(command[0]=='Q')
break;
else if(command[0]=='V')
{
k++;
cin>>url[k];
cout<<url[k]<<endl;
n=k;
}
else if(command[0]=='B')
{
k--;
if(k<0)
{
cout<<"Ignored\n";
k=0;
}
else
cout<<url[k]<<endl;
}
else
{
k++;
if(k>n)
{
cout<<"Ignored\n";
k=n;
}
else
cout<<url[k]<<endl;
}
}
return 0;
}......
pku1007(2007-08-17 23:35:00)
摘要：#include<iostream>
using namespace std;
int main()
{
int m,n,j=0,i=0,*s,min;
char **c;
cin>>n>>m;
s=new int[m];
c=new char *[m];
for(int k=0;k<m;k++)
{
c[k]=new char[n];
cin>>c[k];
s[k]=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
if((c[k][i]-c[k][j])>0)
s[k]++;
}
}
for(j=0;j<m;j++)
{
min=s[0];
k=0;
for(i=0;i<m;i++)
{
if(s[i]<min)
{
k=i;min=s[i];
}
}
s[k]=1000;
cout<<c[k]<<endl;
}
return 0;
}......