- 博客(11)
- 收藏
- 关注
RSS订阅原创 2019
#includemain(){ int n,m,a[100],b[100],i,j,k,s,w,d; scanf("%d%d",&n,&m); while(!(n==0&&m==0)) { w=0; for(i=0;i scanf("%d",&a[i]); s=a[0];
2014-02-15 19:51:37
499
原创 2015
#includemain(){ int n,m,a,b,i,j,k,w,l,e,s,d,r; while(scanf("%d%d",&n,&m)!=EOF) { s=0; e=0; l=0; if(n { for(i=0;i
2014-02-15 19:49:36
368
原创 数据的交换输出
#includeint main(){ int n,i,j,temp,atp,a[100],s[100]; while((scanf("%d",&n)!=EOF)&&n!=0) { for(i=0;i { scanf("%d",&a[i]);
2014-02-15 19:43:29
381
原创 发工资
#includeint main(){ int i,j,z,n,s[100]; while((scanf("%d",&n)!=EOF)&&n!=0) { int a[]={100,50,10,5,2,1}; z=0; for(j=0;j {scanf("%d",&s[j]);}
2014-02-15 19:42:51
404
原创 五次方
#includeint a[100000000];int main(){ int i,j; long n,temp,z; scanf("%d",&n); for(i=0;i {scanf("%d",&a[i]);} for(i=0;i for(j
2014-02-15 19:37:51
904
原创 水仙花
#includeint main(){ int i,a,b,c,m,n,v,s[1000],t; while(scanf("%d%d",&m,&n)!=EOF) { v=0; for(i=m;i { a=i/100;b=((i/10)%10);c=i%10;
2014-02-15 19:35:36
354
原创 绝对值排序
#includeint main(){ int a[100],k[100]; int n,i,j,temp,atp; while((scanf("%d",&n)!=EOF)&&n!=0) { for(i=0;i {scanf("%d",&a[i]);} for(i=0;i {k[
2014-02-15 19:30:02
432
原创 c++格式
#include#includeusing namespace std;int main(){ int x,y,i,temp; long long a,b; while(scanf("%d%d",&x,&y)!=EOF) { if(x>y) { temp=x;x=y;y=temp;
2014-02-15 19:28:00
666
原创 冒泡排序
#includeint main(){ int n,i,j,z,temp,k[50],a[50],atp,x; while((scanf("%d",&n)!=EOF)&&n!=0) { for(i=0;i {scanf("%d",&a[i]);} for(i=0;i {
2014-02-15 19:27:14
308
原创 山理工acm各位数相加
#includeint main(){ int n,i,j,z,temp,k[50],a[50],atp,x; while((scanf("%d",&n)!=EOF)&&n!=0) { for(i=0;i {scanf("%d",&a[i]);} for(i=0;i {
2014-02-15 19:26:29
513
原创 soft排序
#include#include#includeint main(){ int i,n,a[1000]; while(scanf("%d",&n)!=EOF) { for(i=0;i {scanf("%d",&a[i]);} sort(a,a+1000,less()); for(
2014-02-15 19:25:14
725
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人