Commit: bbfaed61c9c636e5fd3ce6a6c6f10273074936ec - VSPRAC (git)

練習用です。いろんなものがごちゃまぜです。

Commit MetaInfo

• Revision: bbfaed61c9c636e5fd3ce6a6c6f10273074936ec (tree)
• Time: 2017-03-13 12:56:48
• Author: bellyoshi <tccwas@gmai...>
• Commiter: bellyoshi

Log Message

prime

Change Summary

• add: CPP/ALDS1_1/gcd.cpp
• add: CPP/ALDS1_1/prime.cpp

Incremental Difference

--- /dev/null
+++ b/CPP/ALDS1_1/gcd.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+
+using namespace std;
+
+int gcd(int a, int b){
+  int mod = !0;
+  while(mod != 0 ){
+    mod = a % b;
+    if (mod > b){
+      a = mod;
+    } else {
+      a = b;
+      b = mod;
+    }
+  }
+  return a;
+}
+int main(int argc, char const *argv[]) {
+  int x, y;
+  cin >> x >> y;
+  cout << gcd(x,y) << endl;
+  return 0;
+}

--- /dev/null
+++ b/CPP/ALDS1_1/prime.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+bool isprime(int number){
+  if (number == 1){
+    return false;
+  }
+
+  if (number == 2){
+    return true;
+  }
+  if (number % 2 == 0){
+    return false;
+  }
+
+  for(int i = 3; i < number; i+=2){
+    if(number % i == 0)return false;
+  }
+  return true;
+}
+
+int main(int argc, char const *argv[]) {
+  int count;
+  cin >> count;
+  int prime_count = 0;
+  for (int i = 0; i < count; i++) {
+    int number;
+    cin >> number;
+    if (isprime(number)){
+      prime_count++;
+    }
+  }
+  cout << prime_count << endl;
+  return 0;
+}