http://www.marcool.net/home/index.htm

代码刷分的同学可以抄

1 #include<iostream>
2 using namespace std;
3 main()
4 {
5 int a,b;
6 cin>>a>>b;
7 cout<<a+b;
8 return 0;
9 }
0001

1 #include<iostream>
2 using namespace std;
3 main()
4 {
5 cout<<"Hello World!";
6 return 0;
7 }
0002

1 #include<iostream>
2 using namespace std;
3 main()
4 {
5 cout<<" *"<<endl;
6 cout<<" ***"<<endl;
7 cout<<"*****";
8 return 0;
9 }
0003

01 #include<iostream>
02 using namespace std;
03 main()
04 {
05 int a[8],y,i,d=13;
06 cin>>y;
07 for(i=0;i<7;i++)
08 {
09 a[i]=0;
10 }
11 y+=1900;
12 for(i=1900;i<y;i++)
13 {
14 a[d%7]++;
15 d+=31;
16 a[d%7]++;
17 if((i%4==0&&i%100!=0)||i%400==0)
18 d+=29;
19 else
20 d+=28;
21 a[d%7]++;
22 d+=31;
23 a[d%7]++;
24 d+=30;
25 a[d%7]++;
26 d+=31;
27 a[d%7]++;
28 d+=30;
29 a[d%7]++;
30 d+=31;
31 a[d%7]++;
32 d+=31;
33 a[d%7]++;
34 d+=30;
35 a[d%7]++;
36 d+=31;
37 a[d%7]++;
38 d+=30;
39 a[d%7]++;
40 d+=31;
41 }
42 a[7]=a[0];
43 cout<<a[1];
44 for(i=2;i<=7;i++)
45 cout<<" "<<a[i];
46 return 0;
47 }
0004

查看代码 打印 01 #include<iostream>
02 using namespace std;
03 main()
04 {
05 int l,i,t;
06 char a[15];
07 cin.getline(a,15);
08 l=strlen(a);
09 if(a[0]!='-')
10 {
11 t=l-1;
12 while(a[t]=='0')t--;
13 for(i=t;i>=0;i--)
14 cout<<a[i];
15 }
16 else
17 {
18 cout<<"-";
19 t=l-1;
20 while(a[t]=='0')t--;
21 for(i=t;i>0;i--)
22 cout<<a[i];
23 }
24 return 0;
25 }
0221

01 #include<iostream>
02 //#include<fstream>
03 using namespace std;
04 //ifstream cin("in1.in");
05 //ofstream cout("out1.out");
06 main()
07 {
08 char cSub[15],c,cAll[1000001];
09 int iCnt=0,iSpos=0,iLen,iLenAll;
10 int i,j=0;
11 int iSub=0;
12 bool bFind=false,bSub=false,bFirst=false;
13
14 cin.getline(cSub,14);
15 iLen=strlen(cSub);
16 for(i=0;i<iLen;i++)
17 {
18 if(cSub[i]<'a')
19 cSub[i]+=32;
20 }
21
22 cin.getline(cAll,1000000);
23 iLenAll=strlen(cAll);
24
25
26 for(;j<iLenAll;j++)
27 {
28 c=cAll[j];
29 if(c==' ')
30 {
31 if ((iSub==iLen)&&(bSub==true))
32 { iCnt++;
33 bFirst=true;
34 }
35 bSub=false;
36 iSub=0;
37 }else{
38 if((iSub==0)||(bSub==true)){
39 if(c<'a')
40 {
41 c+=32;
42 }
43 if((c==cSub[iSub])&&(iSub<iLen))
44 {
45 bSub=true;
46 if ((bFirst==false)&&(iSub==0))
47 iSpos = j;
48 }else{
49 bSub =false;
50 if(bFirst==false)
51 iSpos = 0;
52 }
53 iSub++;
54 }
55 }
56 }
57
58 if ((iSub==iLen)&&(bSub==true))
59 {
60 iCnt++;
61 }else
62 {
63 if(bFirst==false)
64 iSpos = 0;
65 }
66
67 if(iCnt==0)
68 cout<<-1;
69 else
70 cout<<iCnt<<" "<<iSpos;
71 //system("pause");
72 return 0;
73 }
0222

我失望了！！金坷拉的制作正确答案居然是错的！

#include<stdio.h>
#include<iostream.h>
#include<math.h>
#define PI 3.1415926535897932384626433832795028841971653993751
struct COMPLEX
{
double r,i;
COMPLEX()
{
r=0;
i=0;
}
COMPLEX(double a,double b)
{
r=a;
i=b;
}
};
COMPLEX multi(COMPLEX a,COMPLEX b)
{
COMPLEX c;
c.r=a.r*b.r-a.i*b.i;
c.i=a.i*b.r+a.r*b.i;
if(c.r<0.00004&&c.r>-0.00005)
c.r=0;
if(c.i<0.00004&&c.i>-0.00005)
c.i=0;
if(c.r==-0)c.r=0;
if(c.i==-0)c.i=0;
return c;
}
void Print(int i,COMPLEX a)
{
printf("x[%d]=(%.3lf,%.3lfi);\n",i,a.r,a.i);
return ;
}
void swap(COMPLEX &a,COMPLEX &b)
{
COMPLEX c=a;
a=b;
b=c;
return;
}
int main()
{
double ang = 360;
int n;
COMPLEX equ[77];
scanf("%d",&n);
ang = 360.0/n;
equ[1]=COMPLEX(1,0);
equ[2]=COMPLEX(cos(ang*PI/180.0),sin(ang*PI/180.0));
for(int i=3;i<=n;i++)
{
equ[i]=equ[2];
for(int j=1;j<=i-2;j++)
equ[i]=multi(equ[i],equ[2]);
}
for(int i=1;i<=n-1;i++)
for(int j=i+1;j<=n;j++)
if(equ[i].r>equ[j].r)
swap(equ[i],equ[j]);
else if(equ[i].r==equ[j].r&&equ[i].i>equ[j].i)
swap(equ[i],equ[j]);
for(int i=1;i<=n;i++)
Print(i,equ[i]);
system("pause");
return 0;
}

求高精减

好复杂，能简化点吗？

呵呵你就不要掺和了吧。。。
求高精减、高精乘

#include <cstdlib> #include <iostream> using namespace std; char a[1050], b[1050], s[1050], c; int l1, l2, i, l, jie, x, f; int main() { cin >> a >> b; l1 = strlen(a); l2 = strlen(b); for (i = 0; i < l1 / 2; i++) swap(a[i], a[l1 - i - 1]); for (i = 0; i < l2 / 2; i++) swap(b[i], b[l2 - i - 1]); if (l1 < l2) { l = l2; for (i = l1; i < l2; i++) a[i] = '0'; a[i] = '\0'; } else { l = l1; for (i = l2; i < l1; i++) b[i] = '0'; b[i] = '\0'; } for (i = l - 1; i >= 0; i--) { if (a[i] > b[i]) {f = -1; break;} if (a[i] < b[i]) {f = 1; break;} } if (f == 0) {cout << 0; return 0;} if (f == 1) { cout << "-"; for (i = 0; i < l; i++) swap(a[i], b[i]); } for (i = 0; i < l; i++) { x = a[i] - b[i] - jie; if (x < 0) { jie = 1; x = x + 10; } else jie = 0; s[i] = x + '0'; } l = l - 1; while (s[l] == '0') { s[l] = '\0'; l--; } l++; for (i = 0; i < l / 2; i++) swap(s[i], s[l - i - 1]); cout << s << endl; return 0; }