博文
输出三位小数（C++)(2005-08-18 16:47:00)
摘要：#include<iomanip.h>
cout.setf(ios::fixed);
cout<<setprecision(3)<<Msum<<endl; ......
pku(1936)(2005-08-18 16:36:00)
摘要：#include <string.h>
#include <iostream.h>
int main()
{
char a[1000000],b[1000000];
while(cin>>a>>b)
{
int flag=0;
long pos1=strlen(a)-1;
long pos2=strlen(b)-1;
while(1)
{
if(a[pos1]==b[pos2])
{
pos1--;
pos2--;
}
&n......
jnu(all in all)(2005-08-18 16:22:00)
摘要：#include <iostream.h>
#include <string.h>
#include <fstream.h>
ifstream f("all.in");
#define cin f
int main()
{
char a[10000],b[10000];
while(cin>>a>>b)
{
int flag=0;
int pos1=strlen(a)-1;
int pos2=strlen(b)-1;
while(1)
{
if(a[pos1]==b[pos2])
{
pos1--;
pos2--;
&nb......
jnu(FatMouse' Trade)(2005-08-18 16:05:00)
摘要：#include <iostream.h>
#include <stdlib.h>
#include <stdio.h>
#include <fstream.h>
ifstream f("mouse.in");
#define cin f
int comp(const void *m,const void *n)
{
return ((int *)n)[0]/((int *)n)[1]-((int *)m)[0]/((int *)m)[1];
}
int main()
{
int m,n;
int a[1000][2];
int i,j;
while(cin>>m>>n)
{
if (m==-1 && n==-1)
return 0;
for(i=0;i<n;i++)
cin>>a[i][0]>>a[i][1];
qsort(a,n,2*sizeof(int),comp);
float k=(float)m;
i=0;
&nb......
jnu(FatMouse' Trade)(2005-08-18 16:03:00)
摘要：#include <iostream.h>
#include <stdlib.h>
#include <stdio.h>
#include <fstream.h>
ifstream f("mouse.in");
#define cin f
int comp(const void *m,const void *n)
{
return ((int *)n)[0]/((int *)n)[1]-((int *)m)[0]/((int *)m)[1];
}
int main()
{
int m,n;
int a[1000][2];
int i,j;
while(cin>>m>>n)
{
if (m==-1 && n==-1)
return 0;
for(i=0;i<n;i++)
cin>>a[i][0]>>a[i][1];
qsort(a,n,2*sizeof(int),comp);
float k=(float)m;
i=0;
&nb......
jnu(A Equation)(2005-08-18 16:02:00)
摘要：#include <iostream.h>
#include <stdio.h>
#include <fstream.h>
ifstream f("equa.in");
#define cin f
int main()
{
int c;
int i;
float x;
int max;
while(cin>>c)
{
max=(5000>(int)(100000/c)) ? (int)(100000/c) : 5000;
for(i=0;i<=max;i++)
{
float j=(float)i/1000;
if(j*j*j+j*c==100 )
break;
}
x=(float)((float)i/1000);
......
jnu(Ugly numbers)(2005-08-18 15:59:00)
摘要：#include <iostream.h>
int main()
{
long n=1;
int sum=0;
while(sum<1500)
{
long m=n;
while(m%2==0)
{
m/=2;
}
while(m%3==0)
{
m/=3;
}
while(m%5==0)
{
m/=5;
}
&......
jnu(pi)(2005-08-18 15:59:00)
摘要：#include <iostream.h>
#include <stdio.h>
#include <fstream.h>
#include <math.h>
ifstream f("pi.in");
#define cin f
int fun(int m,int n)
{
int q;
q=m%n;
while(q!=0)
{
m=n;
n=q;
q=m%n;
}
return n;
}
int main()
{
int n,i,j;
int a[51];
while(cin>>n)
{
int sum=0;
if (n==0) return 0;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
int x=a[i];
int y=a[j]......
pku(2371)(2005-08-18 00:56:00)
摘要：#include <iostream.h>
#include <stdlib.h>
int comp(const void *a,const void *b)
{
int *x=(int *)a;
int *y=(int *)b;
return *y-*x;
}
int main()
{
int a[100000];
int n,k,i,op;
long j;
char s[4];
cin>>n;
for (j=0;j<n;j++)
cin>>a[j];
cin>>s;
cin>>k;
qsort(a,n,sizeof(int),comp);
for (i=0;i<k;i++)
{
cin>>op;
cout<<a[op-1]<<endl;
}
}......
浮点数转换成字符串函数(自编函数)(2005-08-18 00:29:00)
摘要：#include<stdio.h>
#include <math.h>
int float2str(char *s,float a,int len1,int len2)
{
int b,d;
int i;
b=(int)a;
for(i=0;i<len1;i++)
s[i]='0'+(b/(int)pow(10,len1-i-1))%10;
s[len1]='.';
d=(int)((a-b)*(int)pow(10,len2));
for(i=0;i<len2;i++)
s[i+len1+1]='0'+(d/(int)pow(10,len2-i-1))%10;
s[len1+len2+1]='\0';
}
int main()
{
char s[20];
float a=39.2331;
float2str(s,a,2,4);
printf("%s\n",s);
getch();
}......