소스코드12345678910111213141516#include using namespace std; int main() { for (int i = 0; i > sh >> sm >> ss >> eh >> em >> es; if (es - ss

소스코드12345678910111213141516171819202122232425#include using namespace std; int main() { int result=1, n, k, destIdx, d[4][1001]; cin >> n >> k; for (int i = 0; i > d[0][i] >> d[1][i] >> d[2][i] >> d[3][i]; if (d[0][i] == k) { destIdx = i; } } for (int i = 0; i

소스코드1234567891011121314151617#include using namespace std; int main() { int i,j,n,a[3],Max=0; cin >> n; for (i = 0; i > a[i]; if (Max

소스코드123456789101112131415161718#include using namespace std; int main() { int a[10],c=0, min=987654321,r; while (c > a[c]; if (c > 0) { a[c] += a[c - 1]; } int compare = a[c] > 100 ? a[c] - 100 : 100 - a[c]; if (min >= compare) { min = compare; r = a[c]; } c++; } cout

소스코드123456789101112131415161718192021222324252627282930313233#include using namespace std;#define swap(a,b,tmp) tmp=a; a=b; b=tmp;int main() { int aLen = 0, bLen=0,tmp; char a[2][101],b; cin >> a[0] >> b >> a[1]; while (a[0][aLen++]!='\0') {} while (a[1][bLen++] != '\0') {} if (b == '*') { cout

소스코드12345678910111213141516171819202122232425#include using namespace std; int n,k, num[1001], cnt=0; int main() { cin >> n >> k; for (int i = 2; i