Byungmeo (75) 썸네일형 리스트형 [3d] 11720 : 숫자의 합 123456789101112131415161718#include int main () { int N; char array[100]; int sum = 0; scanf("%d",&N); scanf("%s",array); for(int i = 0; i [2d] 10952 : A+B - 5 12345678910111213#include int main () { int A,B; scanf("%d %d", &A, &B); while(A+B!=0){ printf("%d\n",A+B); scanf("%d %d", &A, &B); } return 0;}cs https://www.acmicpc.net/problem/10952 [2d] 10950 : A+B - 3 1234567891011121314#include int main () { int T; int A,B; scanf("%d",&T); for(int i=1; i [2d] 2439 : 별찍기 - 2 12345678910111213141516171819#include int main () { int N; scanf("%d",&N); for(int i=1; i [2d] 2438 : 별찍기 - 1 1234567891011121314#include int main () { int N; scanf("%d",&N); for(int i = 1; i [2d] 2739 : 구구단 12345678910#include int main () { int N; scanf("%d",&N); for(int i = 1; i [1d] 10430 : 나머지 12345678910111213#include int main () { int A,B,C; scanf("%d %d %d",&A,&B,&C); printf("%d\n",(A+B)%C); printf("%d\n",(A%C + B%C)%C); printf("%d\n",(A*B)%C); printf("%d",(A%C * B%C)%C); return 0;}cs https://www.acmicpc.net/problem/10430 [1d] 10869 : 사칙연산 1234567891011121314#include int main () { int A,B; scanf("%d %d",&A,&B); printf("%d\n",A+B); printf("%d\n",A-B); printf("%d\n",A*B); printf("%d\n",A/B); printf("%d\n",A%B); return 0;}cs https://www.acmicpc.net/problem/10869 이전 1 2 3 4 5 6 ··· 10 다음