final sheet #1

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/B - Basic Data Types.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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;
+    long long b;
+    char c;
+    float d;
+    double e;
+    cin>>a>>b>>c>>d>>e;
+    cout<<a<<"\n"<<b<<"\n"<<c<<"\n"<<d<<"\n"<<e;
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/C - Simple Calculator.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long X,Y;
+    cin>>X>>Y;
+    cout<<X<<" + "<<Y<<" = "<<X+Y<<endl;
+    cout<<X<<" * "<<Y<<" = "<<X*Y<<endl;
+    cout<<X<<" - "<<Y<<" = "<<X-Y;
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/D - Difference.cpp

@@ -0,0 +1,14 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long a,b,c,d;
+    cin>>a>>b>>c>>d;
+    cout<<"Difference = "<<((a*b)-(c*d));
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/E - Area of a Circle.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long double r,pi=3.141592653;
+    cin>>r;
+    cout<<fixed<<setprecision(9);
+    cout<<r*r*pi;
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/F - Digits Summation.cpp

@@ -0,0 +1,14 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long n,m;
+    cin>>n>>m;
+    cout<<(n%10)+(m%10);
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/G - Summation from 1 to N.cpp

@@ -0,0 +1,14 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long n;
+    cin>>n;
+    cout<<n*(1+n)/2;
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/H - Two numbers.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long double n,m;
+    cin>>n>>m;
+    cout<<"floor "<<n<<" / "<<m<<" = "<<floor(n/m)<<endl;
+    cout<<"ceil "<<n<<" / "<<m<<" = "<<ceil(n/m)<<endl;
+    cout<<"round "<<n<<" / "<<m<<" = "<<round(n/m);
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/I - Welcome for you with Conditions.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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;
+    if(a>=b){
+        cout<<"Yes";
+    }else cout<<"No";
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/J - Multiples.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long a,b;
+    cin>>a>>b;
+    if(a%b==0||b%a==0){
+        cout<<"Multiples";
+    }else cout<<"No Multiples";
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/K - Max and Min.cpp

@@ -0,0 +1,14 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long a,b,c;
+    cin>>a>>b>>c;
+    cout<<min(a,min(b,c))<<" "<<max(a,max(b,c));
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/L - The Brothers.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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 a,b,c,d;
+    cin>>a>>b>>c>>d;
+    if(b==d){
+        cout<<"ARE Brothers";
+    }else cout<<"NOT";
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/M - Capital or Small or Digit.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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 a;
+    cin>>a;
+    if(a>=97){
+        cout<<"ALPHA"<<"\n"<<"IS SMALL";
+    }else if(a>=65){
+        cout<<"ALPHA"<<"\n"<<"IS CAPITAL";
+    }else cout<<"IS DIGIT";
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/N - Char.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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 a;
+    cin>>a;
+    if(a>=97){
+        cout<<char(a-32);
+    }else {
+        cout<<char(a+32);
+    }
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/O - Calculator.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    ll_a a,b;
+    char s;
+    cin>>a>>s>>b;
+    switch(s){
+        case '+':cout<<a+b;break;
+        case '-':cout<<a-b;break;
+        case '*':cout<<a*b;break;
+        case '/':cout<<a/b;break;
+    }
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/P - First digit !.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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 a;
+    cin>>a;
+    if(int(a[0])%2==0){
+        cout<<"EVEN";
+    }else cout<<"ODD";
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/Q - Coordinates of a Point.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    double x,y;
+    cin>>x>>y;
+    if(x==0&&y==0){
+        cout<<"Origem";
+    }else if(x==0){
+        cout<<"Eixo Y";
+    }else if(y==0){
+        cout<<"Eixo X";
+    }else if(x<0&&y<0){
+        cout<<"Q3";
+    }else if(x<0&&y>0){
+        cout<<"Q2";
+    }else if(x>0&&y>0){
+        cout<<"Q1";
+    }else if(x>0&&y<0){
+        cout<<"Q4";
+    }
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/R - Age in Days.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    long long n;
+    cin>>n;
+    int years=n/365;
+    int x=n-(365*years);
+    int months=x/30;
+    int day=x-(30*months);
+    cout<<years<<" years"<<endl;
+    cout<<months<<" months"<<endl;
+    cout<<day<<" days";
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/S - Interval.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    double n;
+    cin>>n;
+    if(n>=0&&n<=25){
+        cout<<"Interval [0,25]";
+    }else if(n>25&&n<=50){
+        cout<<"Interval (25,50]";
+    }else if(n>50&&n<=75){
+        cout<<"Interval (50,75]";
+    }else if(n>75&&n<=100){
+        cout<<"Interval (75,100]";
+    }else cout<<"Out of Intervals";
+
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/T - Sort Numbers.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    ll_a a[3],b[3];
+    for(int i=0;i<3;i++){
+        cin>>a[i];
+        b[i]=a[i];
+    }
+    sort(a,a+3);
+    cout<<a[0]<<"\n"<<a[1]<<"\n"<<a[2]<<"\n\n"<<b[0]<<"\n"<<b[1]<<"\n"<<b[2];
+
+
+
+    return 0;
+}

ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/U - Float or int.cpp

@@ -0,0 +1,17 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll_a 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
+    double n;cin>>n;
+    int x=int(n);
+    if(n==x){
+        cout<<"int "<<n;
+    }else cout<<"float "<<int(n)<<" "<<n-int(n);
+
+    return 0;
+}