top of page
게시판 게시물
kb120318
2024년 5월 18일
In 소스 코드 제출
#include<cstdio>
#define MOD 7
int main(){
int one, two, three, four, five, six, seven, eight, nine, ten;
scanf("%1d%1d%1d%1d%1d%1d%1d%1d%1d%1d", &one, &two, &three, &four, &five, &six, &seven, &eight, &nine, &ten);
int sum;
sum = one + two + three + four + five + six + seven + eight + nine + ten;
if(sum % MOD == 4){
printf("Bad");}else{printf("Good");}
return 0;
}
a = input()
a = int(a)
f = 1
while(a != 0) :
f = f * a
a -= 1
print(f)
s = input()
print(len(s))
n = input()
n = int(n)
print(n '')
a, b = input().split()
a = int(a)
b = int(b)
while a % b != 0 :
a, b = b, a % b
print(b)
n = ord(input())
print(n)
c = int(input())
print(chr(c))
n = input()
n = int(n)
print(-n)
0
0
1
kb120318
2024년 5월 05일
In 소스 코드 제출
n = int(input())
if n > 0 :
print(n)
else :
print(n * - 1)
n = int(input())
print('*' * n)
n = int(input())
for i in range(n) :
print('love')
'''
음수이면서 짝수이면, A
음수이면서 홀수이면, B
양수이면서 짝수이면, C
양수이면서 홀수이면, D'''
a = int(input())
if a < 0 and a % 2 == 0 :
print('A')
elif a < 0 and a % 2 == 1 :
print('B')
elif a > 0 and a % 2 == 0:
print('C')
else :
print('D')
s1 = input()
s2 = input()
s3 = input()
s11 = len(s1)
s22 = len(s2)
s33 = len(s3)
if s1[s11-1] == s2[0] and s2[s22-1] == s3[0] and s3[s33-1] == s1[0]:
print('good')
else :
print('bad')for _ in range(int(input())) :
x, y = map(int, input().split())
for x, y in range(_) :
if x > y :
print('-1')
else :
print(min(y-x))
#include<cstdio>
#define MAX 100
#define _CRT_SECURE_NO_WARNING
int no, cnt = 0, nocnt = 0;
int main(){
int N, K, P;
scanf("%d %d %d", &N, &K, &P);
for(int i = 1; i <= N; i++){
// i번째 묶음 받기
nocnt=0;
for(int j = 1; j <= K; j++){
scanf("%d", &no);
if(no == 0)
nocnt+=1;
}
// 한 묶음에 no크림이 몇개인지?=nocnt
if(nocnt < P)
{
cnt+=1;
}
}
printf("%d", cnt);
return 0;
}
0
0
1
kb120318
2024년 5월 04일
In 소스 코드 제출
N = int(input())
list1 = []
for i in range(N) :
command = input()
if command[0] == 'p' and command[1] == 'u':
a, b, c = command.split()
list1.append(int(b))
elif command[0] =='s' :
print(len(list1))
elif command[0] == 'p' and command[1] == 'o' :
if len(list1) != 0 :
list1.pop()
elif command[0] == 'e' :
if len(list1) != 0 :
print('false')
else :
print('true')
elif command[0] == 't' :
if len(list1) == 0 :
print('-1')
else :
print(list1[-1])
# 특강 떄
w1, w2 = input().split()
print(w1+w2)
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if a % 2 == 0 :
print('even')
else :
print('odd')
if b % 2 == 0 :
print('even')
else :
print('odd')
if c % 2 == 0 :
print('even')
else :
print('odd')
a, b = input().split()
print(bool(int(a)) and bool(int(b)))
a = int(input())
print(a*2)
a = bool(int(input()))
print(a)
a = bool(int(input()))
print(not a)
a, b = input().split()
a = int(a)
b = int(b)
if a < b :
print(b)
else :
print(a)
a, b = input().split()
a = int(a)
b = int(b)
print(a^b)
a, b = input().split()
a = int(a)
b = int(b)
print(a|b)
a, b = input().split()
a = int(a)
b = int(b)
print(a&b)
a, b = input().split()
a = int(a)
b = int(b)
print(a//b)
a, b = input().split()
a = float(a)
b = float(b)
print(a**b)
a, b = input().split()
a = int(a)
b = int(b)
print(a**b)
w = int(input())
n = input()
print(n * w)
n, w = input().split()
w = int(w)
print(n * w)
0
0
1
kb120318
2024년 4월 28일
In 소스 코드 제출
#include <stdio.h>
#include<stack>
#define CRTSECURE_NO_WARNING_
char stack[500]={};
int top=-1, a;
int c=0;
int main(){
char num[201]={};
scanf("%d", &a);
scanf("%s", num);
for(int i = a-1; i>=0; i--){
top++;
stack[top]=num[i];
c++; // 숫자가 몇번 push 되었는지 세기
if(c % 3 == 0 && i!=0){
top++;
stack[top]=',';
}
}
while(top!=-1)
{
printf("%c", stack[top]);
top--;
}
}
0
0
1
kb120318
2024년 4월 21일
In 소스 코드 제출
n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))
n = input()
sum1=0
list = list(map(int,input().split()))
for i in range(len(list)) :
if list[i] % 5 == 0 :
sum1 += list[i]
print(sum1)n = input()
sum1=0
list = list(map(int,input().split()))
for i in range(len(list)) :
if list[i] % 5 == 0 :
sum1 += list[i]
print(sum1)
n = input()
sum1=0
list = list(map(int,input().split()))
for i in range(len(list)) :
if list[i] % 5 == 0 :
sum1 += list[i]
print(sum1)n = input()
sum1=0
list = list(map(int,input().split()))
for i in range(len(list)) :
if list[i] % 5 == 0 :
sum1 += list[i]
print(sum1)
n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))n = int(input())
list1 = []
for i in range(n) :
a = int(input())
if a==0 :
list1.pop()
else :
list1.append(a)
print(sum(list1))
0
0
1
kb120318
2024년 4월 14일
In 소스 코드 제출
s = input()
print(s.count('62'))
#include<cstdio>
int main(){
int x, y, x1, y1, x2, y2, x3, y3;
scanf("%d %d %d %d", &x, &y, &x1, &y1);
scanf("%d %d %d %d", &x2, &y2, &x3, &y3);
if((x1==x2 && y1==y2) || (x==x3 && y==y3) || (x==x3 && y1==y2) || (y==y3 && x1==x2)){
printf("POINT");
}else if( ( ( x1==x2 || x==x3) && y3>y && y1>y2) || ( ( y1==y2 || y==y3) && x1>x2 && x<x3) ){
printf("LINE");
}else if(((x1<x2 || x>x3) ) || (y1<y2 || y>y3)){
printf("NULL");
}else{
printf("FACE");
}
}
a, b = input().split()
a = int(a)
b = int(b)
if a>b :
print(b, a)
else :
print(a, b)
0
0
1
kb120318
2024년 4월 13일
In 소스 코드 제출
#include<cstdio>
int main(){
double a, b;
scanf("%lf%lf", &a, &b);
double k = (a - 100) * 0.9;
double ans = (b - k) * 100 / k;
if(ans>20){
printf("비만");
}else if(ans<=10){
printf("정상");
}else{
printf("과체중");
}
return 0;
}
0
0
1
kb120318
2024년 4월 07일
In 소스 코드 제출
/*#include<cstdio>
int main(){
int y, m, d;
scanf("%d%d%d", &y, &m, &d);
if((y + m + d) / 100 % 10 % 2 == 0)
printf("대박");
else
printf("그럭저럭");
}*/
/*#include<cstdio>
int main(){
double a, b;
scanf("%lf%lf", &a, &b);
double res;
res = (a - 100) * (9/10);
double ans;
ans = ((b - res) * 100) / res;
if(ans<=10)
printf("정상");
else if(10<ans<=20)
printf("과체중");
else if(ans>20)
printf("비만");
}
import math
a, b = input().split('x')
if int(b) < 0:
b = -int(b)
a = -int(a)
x = round(-int(b) / int(a), 2)
print("%.2f" %x)
*/
int
0
0
1
kb120318
2024년 4월 06일
In 소스 코드 제출
#include<bits/stdc++.h>
int main(){
int a;
scanf("%d", &a);
if(100>=a && a>=90)
printf("A");
else if(89>=a && a>=70)
printf("B");
else if(69>=a && a>=40)
printf("C");
else
printf("D");
}
#include <stdio.h>
int main() {
int n;
int ans5, ans4, ans3, ans2, ans1;
scanf("%d", &n);
ans5 = n / 10;
n %= 10;
ans4 = n / 5;
n %= 5;
ans3 = n / 3;
n %= 3;
ans2 = n / 1;
n %= 1;
ans1 = n;
printf("%d\n", ans5 + ans4 + ans3 + ans2 + ans1);
return 0;
}
#include<cstdio>
int main(){
int a, b, c, d, e, f, g, h, i, j, k, l, n;
scanf("%01d%01d%01d%01d%01d%01d-%01d%01d%01d%01d%01d%01d%01d", &a, &b, &c, &d, &e, &f, &g, &h, &i, &j, &k, &l, &n);
if(g==1)
goto is1000;
else
goto is2000;
int year;
is1000:
year = 2000 + (10*a) + b;
is2000:
year = 1900 + (10 * a) + b;
int month;
month = (10*c) + d;
int day;
day = (10*e) + f;
char gender;
if(g%2==0)
goto F;
else if(g%2!=0)
goto M;
M:{
printf("%04d/%02d/%02d M", year, month, day);
return 0;}
F:{
printf("%04d/%02d/%02d F", year, month, day);
return 0;}
}
#include<cstdio>
int main(){
char a;
scanf("%c",&a);
if(a=='A')
printf("best!!!");
else if(a=='B')
printf("good!!");
else if(a=='C')
printf("run!");
else if(a=='D')
printf("slowly~");
else
printf("what?");
}
#include<cstdio>
int main(){
int a;
scanf("%d", &a);
if(a==12 | a==1 | a==2)
printf("winter");
else if(a==3 | a == 4 | a==5)
printf("spring");
else if(a==6 | a==7| a==8)
printf("summer");
else if(a==9 | a==10 | a==11)
printf("fall");
}
#include<cstdio>
int main(){
int a, b;
scanf("%d%d", &a, &b);
if(a%2==0){
printf("짝수+");
}else{
printf("홀수+");
}
if(b%2==0){
printf("짝수=");
}else{
printf("홀수=");
}
if((a+b)%2==0){
printf("짝수");
}else{
printf("홀수");
}
}
#include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a > b) {
if (b > c) {
printf("%d\n", b);
} else if (a > c) {
printf("%d\n", c);
} else {
printf("%d\n", a);
}
} else if (b > c) {
if (a > c) {
printf("%d\n", a);
} else {
printf("%d\n", c);
}
} else {
printf("%d\n", b);
}
return 0;
}
#include<cstdio>
int main(){
int a, b;
scanf("%d%d", &a, &b);
if(b%a==0)
printf("%d*%d=%d", a, b/a, b);
else
printf("none");
}
#include<cstdio>
#include<cmath>
int main(){
double a, b;
scanf("%lf %lf", &a, &b);
double sum, cha, cha1, gop, res, res1, a1, a2;
sum = a + b;
cha = a - b;
cha1 = b - a;
gop = a * b;
res = b / a;
res1 = a / b;
a1 = pow(a, b);
a2 = pow(b, a);
double max = a1;
if (a2 > max) max = a2;
if (sum > max) max = sum;
if (cha > max) max = cha;
if (cha1 > max) max = cha1;
if (gop > max) max = gop;
if (res > max) max = res;
if (res1 > max) max = res1;
printf("%.6lf\n", max);
}
#include<cstdio>
int main(){
int a;
scanf("%d", &a);
if(a>=90){
printf("A");
return 0;
}
if(a>=80){
printf("B");
return 0;
}
if(a>=70){
printf("C");
return 0;
}
if(a>=60){
printf("D");
return 0;
}
if(a<60){
printf("F");
return 0;
}
}
0
0
1
kb120318
2024년 3월 31일
In 소스 코드 제출
#include<bits/stdc++.h>
using namespace std;
int f(int k)
{
if (k <= 1) return 1;
else return k*f(k-1);
}
main()
{
int n,r;
scanf("%d%d", &n, &r);
printf("%d", f(n) / f(r) / f(n-r) );
return 0;
}
#include<cstdio>
#include<cmath>
int main(){
int n;
scanf("%d", &n);
long long int ans = pow(2, n) - 1;
printf("%lld\n", ans);
}
#include<cstdio>
int main(){
float m,b,a;
scanf("%f", &m);
scanf("%f", &b);
a= -b/m;
printf("%.4f\n",a);
}
#include<cstdio>
int n, ans;
int f(int num){
int a = 0, b = num;
while(b){
if(b%10 == 3 || b%10 == 6 || b%10 == 9) a++;
b/=10;
}
return a;}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) ans += f(i);
printf("%d", ans);}
#include<cstdio>(5각수 small)
int main(){
int i,j,k,s;
scanf("%d",&i);
i+=1;
k = ((i*3 -1) * i) / 2;
printf("%d",k);
}
#include<cstdio>(5각수 large)
int main(){
unsigned long long int i,j,k,s;
scanf("%lu",&i);
i+=1;
k = ((i*3 -1) * i) / 2;
printf("%lu",k%1000000004);
}
0
0
1
kb120318
2024년 3월 30일
In 소스 코드 제출
/*#include<cstdio>
int main() {
long long int a, b;
scanf("%lld %lld", &a, &b);
long long int k = a + b;
long long int f = a - b;
long long int r = a * b;
long long int max = k;
if (f > max) max = f;
if (r > max) max = r;
long long int min = k;
if (f < min) min = f;
if (r < min) min = r;
long long int mid;
if (k != max && k != min) mid = k;
else if (f != max && f != min) mid = f;
else mid = r;
printf("%lld", mid);
return 0;
a = int(input())
if a % 3 == 0:
print('1')
else:
print('0')
#include<cstdio>
#include<cmath>
int main(){
double a, b;
scanf("%lf %lf", &a, &b);
printf("%.1lf\n", a / b);
printf("%g\n", floor(a / b));
printf("%g\n", pow(a, b));
return 0;
}
}*/
0
0
1
kb120318
2024년 3월 23일
In 소스 코드 제출
/****************************************
#include <stdio.h>
int n;
void f(int k){
if(k % 2 == 0)
printf("even\n");
else if(k % 2 == 1)
printf("odd\n");
else
printf("\n");
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
#include <stdio.h>
int n;
void f(int k){
if(k == 1)
printf("hello\n");
else if(k == 2)
printf("world\n");
else
printf("\n");
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
#include <stdio.h>
int n;
void f(int k){
if(k != 0)
printf("true\n");
else
printf("false\n");
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
#include <stdio.h>
int n;
void f(int k){
if(k != 0)
printf("non zero");
else
printf("zero");
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
#include<cstdio>
#include<cmath>
int main(){
int a, b;
scanf("%d%d", &a, &b);
unsigned long int res;
res = pow(a, b);
printf("%ld", res);
}
#include <stdio.h>
int n;
void f(int k){
if(k == 0)
printf("zero");
else if(k < 0)
printf("negative");
else
printf("positive");
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
#include<cstdio>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int min = a < b ? (a < c ? a : c) : (b < c ? b : c);
printf("%d\n", min);
return 0;
}
*/
0
0
1
kb120318
더보기
bottom of page