diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/Say Hello With C++.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/A - Say Hello With C++.cpp similarity index 100% rename from ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/Say Hello With C++.cpp rename to ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/A - Say Hello With C++.cpp diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/B - Basic Data Types.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/B - Basic Data Types.cpp new file mode 100644 index 0000000..ebb86aa --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/B - Basic Data Types.cpp @@ -0,0 +1,18 @@ +#include +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< +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< +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; +} diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/K - Max and Min.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/K - Max and Min.cpp new file mode 100644 index 0000000..a781ad6 --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/K - Max and Min.cpp @@ -0,0 +1,14 @@ +#include +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< +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; +} diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/M - Capital or Small or Digit.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/M - Capital or Small or Digit.cpp new file mode 100644 index 0000000..c306c27 --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/M - Capital or Small or Digit.cpp @@ -0,0 +1,18 @@ +#include +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; +} diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/N - Char.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/N - Char.cpp new file mode 100644 index 0000000..a0f39fe --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/N - Char.cpp @@ -0,0 +1,18 @@ +#include +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< +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< +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; +} diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/Q - Coordinates of a Point.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/Q - Coordinates of a Point.cpp new file mode 100644 index 0000000..a48122c --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/Q - Coordinates of a Point.cpp @@ -0,0 +1,30 @@ +#include +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; +} diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/R - Age in Days.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/R - Age in Days.cpp new file mode 100644 index 0000000..d93afa6 --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/R - Age in Days.cpp @@ -0,0 +1,23 @@ +#include +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< +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; +} diff --git a/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/T - Sort Numbers.cpp b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/T - Sort Numbers.cpp new file mode 100644 index 0000000..0aaf62e --- /dev/null +++ b/ICPC Assiut University Community/Sheet #1 (Data type - Conditions)/T - Sort Numbers.cpp @@ -0,0 +1,21 @@ +#include +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< +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 "< +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; + char s; + cin>>a>>s>>b; + switch(s){ + case '=':if(a==b){cout<<"Right";}else cout<<"Wrong";break; + case '>':if(a>b){cout<<"Right";}else cout<<"Wrong";break; + case '<':if(a +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,c; + char s,q; + cin>>a>>s>>b>>q>>c; + switch(s){ + case '+':if((a+b)==c){cout<<"Yes";}else cout< +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 l1,r1,l2,r2; + cin>>l1>>r1>>l2>>r2; + if((l2>r1&&r2>r1)||(l2 +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 + long long a,b,c,d; + cin>>a>>b>>c>>d; + a%=100; + b%=100; + c%=100; + d%=100; + long long x=a*b*c*d; + if(x%100<=9)cout<<0; + cout< +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 + long long a,b,c,d; + cin>>a>>b>>c>>d; + if(b*log(a)>d*log(c)){ + cout<<"YES"; + }else cout<<"NO"; + return 0; +}