sheet loops

ICPC Assiut University Community/Sheet #2 (Loops)/A - 1 to N.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;
+    for(int i=1;i<=n;i++)cout<<i<<endl;
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/B - Even Numbers.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;
+    if(n<2){
+        cout<<-1;return 0;
+    }
+    for(int i=1;i<=n;i++){
+        if(i%2==0)
+            cout<<i<<endl;
+    }
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/C - Even, Odd, Positive and Negative.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;
+    int even=0,odd=0,pos=0,neg=0,x;
+    for(int i=1;i<=n;i++){
+        cin>>x;
+        if(x%2==0){
+            even++;
+        }else{
+            odd++;
+        }
+        if(x>0){
+            pos++;
+        }else if(x<0){
+            neg++;
+        }
+    }cout<<"Even: "<<even<<"\n"<<"Odd: "<<odd<<"\n"<<"Positive: "<<pos<<"\n"<<"Negative: "<<neg;
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/D - Fixed Password.cpp

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+
+    for(;;){
+        int n;cin>>n;
+        if(n==1999){
+            cout<<"Correct"<<endl;break;
+        }else cout<<"Wrong"<<endl;
+    }
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/E - Max.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;ll_a maxe=0;
+    for(int i=0;i<n;i++){
+        ll_a x;cin>>x;
+        if(maxe<x){
+            maxe=x;
+        }
+    }cout<<maxe;
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/F - Multiplication table.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;
+    for(int i=1;i<=12;i++){
+        cout<<n<<" * "<<i<<" = "<<n*i<<endl;
+    }
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/G - Factorial.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int test;cin>>test;
+    while(test--){
+        int n;cin>>n;
+        ll_a fact=1;
+        for(int i=1;i<=n;i++){
+            fact*=i;
+        }cout<<fact<<endl;
+    }
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/H - One Prime.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int x;cin>>x;
+    for(int i=2;i<x;i++){
+        if(x%i==0&&x!=i){
+            cout<<"NO";
+            return 0;
+        }
+    }cout<<"YES";
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/I - Palindrome.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    string x,a="";cin>>x;
+    bool test=true;
+    for(int i=0,j=x.length()-1;i<x.length();i++,j--){
+        if(x[i]!=x[j]){
+            test=false;
+        }
+        a+=x[j];
+    }
+    int n;
+    stringstream a1;
+    a1<<a;
+    a1>>n;
+    cout<<n<<endl;
+    if(test){
+        cout<<"YES";
+    }else cout<<"NO";
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/J - Primes from 1 to n.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+int primes(int x){
+    for(int i=2;i<=x;i++){
+        if(x%i==0&&x!=i){
+            return 0;
+        }
+    }return x;
+}
+int main() {
+    fast
+    int x;cin>>x;
+    for(int i=2;i<=x;i++){
+        if(primes(i)!=0){
+            cout<<i<<" ";
+        }
+    }
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/K - Divisors.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int x;cin>>x;
+    for(int i=1;i<=x;i++){
+        if(x%i==0){
+            cout<<i<<endl;
+        }
+    }
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/L - GCD.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int a,b;cin>>a>>b;
+    int g;
+    for(int i=1;i<=min(a,b);i++){
+       if(a%i==0&&b%i==0){
+            g=i;
+       }
+    }cout<<g;
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/N - Numbers Histogram.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    char s;cin>>s;
+    int n;cin>>n;
+    for(int i=0;i<n;i++){
+        int x;cin>>x;
+        for(int j=0;j<x;j++){
+            cout<<s;
+        }cout<<endl;
+    }
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/O - Pyramid.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;
+    for(int i=0;i<n;i++){
+       for(int j=0;j<n;j++){
+            if(i>=j)cout<<"*";
+       }cout<<endl;
+    }
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/P - Shape1.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int n;cin>>n;
+    for(int i=0;i<n;i++){
+       for(int j=0;j<n;j++){
+            if(i<=j)cout<<"*";
+       }cout<<endl;
+    }
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #2 (Loops)/Q - Digits.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#include <typeinfo>
+#include <type_traits>
+using namespace std;
+#define ll_a long long
+#define ll_u unsigned long long
+#define sort_Vector(v) sort(v.begin(),v.end())
+#define sort_Array(a,n) sort(a,a+n)
+#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
+
+int main() {
+    fast
+    int test;cin>>test;
+    while(test--){
+        string n;cin>>n;
+        for(int i=n.length()-1;i>=0;i--){
+            cout<<n[i]<<" ";
+        }cout<<endl;
+    }
+
+    return 0;
+}