프로그래밍 이모저모/프로그래밍2019. 8. 8. 21:31

#include using namespace std; int main() { // one two three four five six seven eight nine // eight five four nine one seven six three two zero int N, M; cin >> N >> M; bool chk[10] = { false }; int r = 8; int c = 8; int count = 0; int prevR = 0; while (count != M - N + 1) { if (prevR != r && chk[r]==false && r>=N && r

프로그래밍 이모저모/프로그래밍2019. 8. 8. 19:31

#include using namespace std; int main() { int N; cin >> N; int fivecount = 0; int twocount = 0; for (int i = 5; 0 < (N / i); i *= 5) { fivecount += N / i; } for (int i = 2; 0 < (N / i); i *= 2) { twocount += N / i; } if (twocount < fivecount) cout

프로그래밍 이모저모/프로그래밍2019. 8. 7. 22:30

#include using namespace std; int fivecount(int N) { int count = 0; for (long long int i = 5; 1 n >> m; int five = fivecount(n); int two = twocount(n); if (m != 0) five -= fivecount(m); if (m != n) five -= fivecount(n - m); if (m != 0) two -= twocount(m); if (m != n) two -= twocount(n - m); if (five > two) cout

프로그래밍 이모저모/프로그래밍2019. 8. 7. 21:09

#include #include using namespace std; int main() { string input; cin >> input; int temp = 0; int res = 0; for (int i = input.length() - 1; i >= 0; i--) { switch (input[i]) { case&#39;0&#39; : temp = 0; break; case &#39;1&#39;: temp = 1; break; case &#39;2&#39;: temp = 2; break; case &#39;3&#39;: temp = 3; break; case &#39;4&#39;: temp = 4; break; case &#39;5&#39;: temp = 5; break; case &#39;6&#..

프로그래밍 이모저모/프로그래밍2019. 8. 7. 20:54

#include using namespace std; int main() { char input; int count = 0; for (int i = 0; i > input; if (input == &#39;F&#39;) { if ((i % 2 == 0 && j % 2 == 0) || (i % 2 == 1 && j % 2 == 1)) count++; } } } cout

카테고리 없음2019. 8. 6. 21:28

#include using namespace std; int main() { int A, B; cin >> A >> B; int count = 1; int stack = 0; int acc = 0; while (stack+count < A-1) { stack += count; acc += count * count; count++; } acc += count * (A-1 - stack); int count2 = 1; int stack2 = 0; int acc2 = 0; while (stack2+count2 < B) { stack2 += count2; acc2 += count2 * count2; count2++; } acc2 += count2 * (B - stack2); cout

프로그래밍 이모저모/프로그래밍2019. 8. 6. 20:44

#include using namespace std; int main() { int N; float Arr[1000]; float max = 0; cin >> N; for (int i = 0; i > Arr[i]; if (Arr[i] > max) max = Arr[i]; } float acc = 0; for (int i = 0; i < N; i++) { acc += Arr[i] / max * 100; } cout

프로그래밍 이모저모/프로그래밍2019. 8. 6. 20:29

#include #include using namespace std; int main() { int N; cin >> N; int Arr[2]; Arr[0] = N % 10; Arr[1] = (N / 10) % 10; int count = 0; int res = 100; while (res != N) { int temp = Arr[1] + Arr[0]; if (temp > 9) temp = temp % 10; res = Arr[0] * 10 + temp; Arr[0] = res % 10; Arr[1] = (res / 10) % 10; count++; } cout