#include using namespace std; int main(){ int N; cin >> N; int dp[1001]={0}; for(int i=1; i> dp[i]; if (i==1) dp[i]=dp[i]; for(int x=i; x>=i/2; x--) {if(dp[i](5,0)(4,1)(3,2)(2,3)(1,4)(0,5)-> int는 나누기를 한 결과가 소수일 경우 나머지를 버림!-> for(int x=i; x>=i/2; x--) for문 반복 조건
#include bool SN[10001];int d(int n){ int dn=n; if(n>=10000) { dn += n/10000; n %= 10000;} if(n>=1000) { dn += n/1000; n %= 1000;} if(n>=100) { dn += n/100; n %= 100;} if(n>=10) {dn += n/10; n %= 10;} return dn += n;}int main(){ for(int i=1; i=10000) { dn += n/10000; n %= 10000;} if(n>=1000) { dn += n/1000; n %= 1000;} if(n>=100) { dn += n/100; n %= 100;} if(n>=10) {dn += n/10; n %= 10;} return ..
#include using namespace std;int min(int a, int b){return a>=b? b:a;}int min(int a, int b, int c, int d){return min(min(a,b),min(c,d));}int main(){ int x,y,w,h=0; int l=0; cin >> x >> y >> w >> h; l=min(x,y,w-x,h-y); cout
#include using namespace std;int max(int a, int b){return a >= b ? a : b;} int main(){ int N=0; int wine[10001]={0}; int dp[10001]={0}; cin >> N; for(int i=1; i> wine[i]; } dp[1]=wine[1]; dp[2]=wine[1]+wine[2]; if(N>2){ for(int i=3; i
