백준 1단계 C 풀이
1 - 1단계 (2557번)
#include<stdio.h>
int main(){
printf("Hello World!");
return 0;
}
1 - 2단계 (1000번)
#include<stdio.h>
int main(){
int a, b;
scanf("%d%d",&a,&b);
printf("%d",a+b);
return 0;
}
1 - 3단계 (1001번)
#include<stdio.h>
int main(){
int a, b;
scanf("%d%d",&a,&b);
printf("%d",a-b);
return 0;
}
1 - 4단계 (10998번)
#include<stdio.h>
int main(){
int a, b;
scanf("%d%d",&a,&b);
printf("%d",a*b);
return 0;
}
1 - 5단계 (1008번)
#include<stdio.h>
int main(){
int a, b;
scanf("%d%d",&a,&b);
printf("%.9f",(double)a/b);
return 0;
}
1 - 6단계 (10869번)
#include<stdio.h>
int main(){
int a, b;
scanf("%d%d",&a,&b);
printf("%d\n%d\n%d\n%d\n%d",a+b,a-b,a*b,a/b,a%b);
return 0;
}
1 - 7단계 (10926번)
#include<stdio.h>
int main(){
char n[50]={};
scanf("%s",n);
printf("%s",n);
printf("??!");
return 0;
}
1 - 8단계 (18108번)
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
printf("%d",n-543);
return 0;
}
1 - 9단계 (3003번)
#include<stdio.h>
int main(){
int n[6]={1,1,2,2,2,8};
int a[6]={};
for(int i=0;i<6;i++){
scanf("%d",&a[i]);
if(a[i]!=n[i]) a[i]=n[i]-a[i];
else a[i]=0;
printf("%d ",a[i]);
}
return 0;
}
1 - 10단계 (10430번)
#include<stdio.h>
int main(){
int a, b, c;
scanf("%d%d%d",&a,&b,&c);
printf("%d\n%d\n%d\n%d",(a+b)%c,((a%c)+(b%c))%c,(a*b)%c,((a%c)*(b%c))%c);
return 0;
}
1 - 11단계 (2588번)
#include<stdio.h>
int main(){
int a, b,c,d,e;
scanf("%d%d",&a,&b);
c=a*(b%10);
d=a*((b/10)%10);
e=a*(b/100);
printf("%d\n%d\n%d\n%d",c,d,e,a*b);
return 0;
}
1 - 12단계 (10171번)
#include<stdio.h>
int main(){
printf("\\ /\\\n ) ( \')\n( / )\n \\(__)|");
return 0;
}
1 - 13단계 (10172번)
#include<stdio.h>
int main(){
printf("|\\_/|\n|q p| /}\n( 0 )\"\"\"\\\n|\"^\"\` |\n||_/=\\\\__|");
return 0;
}
1 - 14단계 (25083번)
#include<stdio.h>
int main(){
printf(" ,r\'\"7\nr`-_ ,\' ,/\n \\. \". L_r\'\n `~\\/\n |\n |");
return 0;
}