代码搜索：printf
找到约 10,000 项符合「printf」的源代码
代码结果 10,000
www.eeworm.com/read/490828/6443094
cpp 8-4.cpp
#include
void main()
{int f(int a,int b);
int i=2,p;
p=f(i,++i);
printf("%d\n",p);
}
int f(int a,int b)
{int c;
if(
www.eeworm.com/read/490982/6446838
cpp 1055-oh,those achin'feet.cpp
#include
#include
using namespace std;
int N,M;
//dep表示最短路径的长度,而total表示最短路径的条数
int dep,total;
char map[20][20],source,dest;
//表示被最短路径经过多少次,p用来纪录路径
int num[20][20],p_x[80],p_y[80
www.eeworm.com/read/490520/6446978
cpp 7-2.cpp
#include
void main()
{
int i;
int f[20]={1,1};
for(i=2;i
www.eeworm.com/read/490520/6446981
cpp 7-6.cpp
#include
void main()
{char c[10]={'I',' ','a','m',' ','a',' ','b','o','y'};
int i;
for(i=0;i
www.eeworm.com/read/490520/6446982
cpp 7-7.cpp
#include
void main()
{char diamond[][5]={{' ',' ','*'},{' ','*',' ','*'},{'*',' ',' ',' ','*'},{' ','*',' ','*'},{' ',' ','*'}};
int i,j;
for (i=0;i
www.eeworm.com/read/490520/6447000
cpp 5-5.cpp
#include
void main()
{
int year, leap;
scanf("%d",&year);
if (year%4==0)
{if (year%100==0)
{if (year%400==0)
leap=1;
else leap=0;}
else
www.eeworm.com/read/490520/6447002
cpp 5-1.cpp
#include
void main()
{
float a,b,t;
scanf("%f,%f",&a,&b);
if(a>b)
{t=a;a=b;b=t;}
printf("%5.2f,%5.2f\n",a,b);
}
www.eeworm.com/read/490520/6447003
cpp 5-3a.cpp
#include
void main ()
{int x,y;
scanf("%d",&x);
if (x>=0)
if (x>0) y= 1;
else y= 0;
else y=-1;
printf("x=%d,y=%d\n",x,y);
}
www.eeworm.com/read/490520/6447004
cpp 5-2.cpp
#include
void main ( )
{
float a,b,c,t;
scanf("%f,%f,%f",&a,&b,&c);
if(a>b)
{t=a;a=b;b=t;}
if(a>c)