ACM_算法竞赛入门_源程序

最新推荐文章于 2021-09-24 20:42:07 发布

北冥的备忘录

最新推荐文章于 2021-09-24 20:42:07 发布

阅读量900

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/essencelite/article/details/11820655

strat from 8.15
不断完善中～～～～

/*
//   1-6 san wei shu fan zhuan
#include "stdio.h"
int main()
{
    int n;
    scanf("%d",&n);
    printf("%d%d%d\n",n%10,n/10%10,n/100);
    return (0);
}
*/

/*
//1-7
#include "stdio.h"
int main()
{
    int n,m;
    scanf("%d",&n);
    m=(n%10*100+(n/10%10)*10+n/100);
    printf("%03d\n",m);
    return (0);
}
*/

/*
//1-9
#include "stdio.h"
int main()
{
    int m,n;
    scanf("%d%d",&n,&m);
    n=m+n;
    m=n-m;
    n=n-m;
    printf("%d %d",n,m);
    return (0);
}
*/

/*
//1-11
#include "stdio.h"
int main()
{
    int a,b,n,m;
    scanf("%d%d",&n,&m);
    a=(4*n-m)/2;
    b=n-a;
    if(m%2==1||a<0||b<0)
       printf("No answer\n");
       else printf("%d %d\n",a,b);
return (0);
}
*/

/*
//1-15
#include "stdio.h"
int main()
{
    int a,b,c,x,y,z;
    scanf("%d%d%d",&a,&b,&c);
    x=a;if(b<x) x=b;if(c<x) x=c;
    z=a;if(b>x) z=b;if(c>x) z=c;
    y=a+b+c-x-z;
    printf("%d %d %d",x,y,z);
    return (0);
}
*/

/*
//da yin bai fen hao %
#include "stdio.h"
int main()
{
    printf("%%");
    printf("%c",'%');
    return (0);
}
*/

/*
//7744 wen ti
#include "stdio.h"
#include "math.h"
int main()
{
    int a,b,n;
    double m;
   for(a=1;a<9;a++)
      for(b=0;b<9;b++)
      {
          n=a*1100+b*11;
          m=sqrt(n);
          if(floor(m+0.5)==m) printf("%d\n",n);
      }
      return (0);
}
*/

/*
//7744 wen ti (2)
#include "stdio.h"
int main()
{
    int x,n,hi,lo;
    for(x=1;;x++)
       {
           n=x*x;
           if(n<1000) continue;
           if(n>9999) break;
           hi=n/100;
           lo=n%100;
           if(hi/10==hi%10&&lo/10==lo%10) printf("%d\n",n);
       }
return (0);
}
*/

/*
//3n+1 wen ti
#include "stdio.h"
int main()
{
    int n,count=0;
    scanf("%d",&n);
    while(n>1)
    {
        if(n%2==1) n=3*n+1;
        else n/=2;
        count++;
    }
    printf("%d\n",count);
    return (0);
}
*/

/*
//jie cheng zhi he
#include "stdio.h"
int main()
{
    int i,j,n,s=0,factorial;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
      {
          factorial=1;
          for(j=1;j<=i;j++)
            factorial*=j;
          s+=factorial;
      }
    printf("%d\n",s%1000000);
    return (0);
}
*/

/*
#include "stdio.h"
#include "time.h"
int main()
{
    const int MOD=1000000;
    int i,j,n,s=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
       {
           int factorial=1;
           for(j=1;j<i;j++)
              factorial=(factorial*j%MOD);
              s=(s+factorial)%MOD;
       }
       printf("%d\n",s);
       printf("Time used =%.2lf\n",(double)clock()/CLOCK_PER_SEC);
       return 0;
}
*/

浮点数陷阱：
#include "stdio.h"
int main()
{
    double i;
    for(i=1;i!=10.0;i+=0.1)   //改进：i-10<0.1;
         printf("%.1lf\n",i);
return 0;
}