diff --git a/Aparna GCI/GCI milestone 3/c2.exe b/Aparna GCI/GCI milestone 3/c2.exe new file mode 100644 index 00000000..40454a56 Binary files /dev/null and b/Aparna GCI/GCI milestone 3/c2.exe differ diff --git a/Cherish Sachdeva/Milestone 1/Practice_1.cpp b/Cherish Sachdeva/Milestone 1/Practice_1.cpp new file mode 100644 index 00000000..69cd312a --- /dev/null +++ b/Cherish Sachdeva/Milestone 1/Practice_1.cpp @@ -0,0 +1,6 @@ +#include +using namespace std; +int main(){ + cout<<"Welcome to Girl Code It"< +using namespace std; +int main(){ + int a,b; + cin>>a; + cin>>b; + int c=a>b?a:b; + cout<<"The maximum number is : "< +using namespace std; +int main(){ + int num; + cin>>num; + string ans=num%2==0?"even":"odd"; + cout< +using namespace std; +int main(){ + int num; + cin>>num; + if(num>0){ + cout< +using namespace std; +int main(){ + int num1,num2,ans; + cin>>num1; + cin>>num2; + ans=num1*num2; + cout<<"Multiplication of "< +using namespace std; +int sum(int a,int b){ + int sum; + sum=a+b; + return sum; +} +int main(){ + int a,b; + cin>>a; + cin>>b; + cout< +using namespace std; +int prod(int a,int b){ + int p; + p=a*b; + return p; +} +int main(){ + int a,b; + cin>>a; + cin>>b; + cout< +using namespace std; +int area(int r){ + int A; + A=(22*r*r)/7; + return A; +} +int circumference(int r){ + int C; + C=(2*22*r)/7; + return C; +} +int main(){ + int r; + cin>>r; + cout<<"Area of crcle is "< +using namespace std; +int max(int a,int b,int c){ + if(a>b){ + if(a>c){ + return a; + }else{ + return c; + } + }else{ + if(b>c){ + return b; + }else{ + return c; + } + } +} +int main(){ + int a,b,c; + cin>>a; + cin>>b; + cin>>c; + cout<<"Max is "< +using namespace std; +bool type(int n){ + if(n%2==0){ + return true; + }else{ + return false; + } +} +int main(){ + int a; + cin>>a; + if(type(a)){ + cout<<"Even"; + }else{ + cout<<"Odd"; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 10/1/Level1/Practice5.exe b/Cherish Sachdeva/Milestone 10/1/Level1/Practice5.exe new file mode 100644 index 00000000..31cfa612 Binary files /dev/null and b/Cherish Sachdeva/Milestone 10/1/Level1/Practice5.exe differ diff --git a/Cherish Sachdeva/Milestone 10/1/Level1/Practice6.cpp b/Cherish Sachdeva/Milestone 10/1/Level1/Practice6.cpp new file mode 100644 index 00000000..2e46b12b --- /dev/null +++ b/Cherish Sachdeva/Milestone 10/1/Level1/Practice6.cpp @@ -0,0 +1,19 @@ +#include +using namespace std; +bool vote(int n){ + if(n>=18){ + return true; + }else{ + return false; + } +} +int main(){ + int n; + cin>>n; + if(vote(n)){ + cout<<"Eligible to vote"< +using namespace std; +bool prime(int n){ + for(int i=2;i>x; + if(prime(x)){ + cout<<"Prime"; + }else{ + cout<<"Non-Prime"; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 10/1/Level1/Practice7.exe b/Cherish Sachdeva/Milestone 10/1/Level1/Practice7.exe new file mode 100644 index 00000000..79cec94c Binary files /dev/null and b/Cherish Sachdeva/Milestone 10/1/Level1/Practice7.exe differ diff --git a/Cherish Sachdeva/Milestone 10/1/Level1/Practice8.cpp b/Cherish Sachdeva/Milestone 10/1/Level1/Practice8.cpp new file mode 100644 index 00000000..6544c9bd --- /dev/null +++ b/Cherish Sachdeva/Milestone 10/1/Level1/Practice8.cpp @@ -0,0 +1,25 @@ +#include +using namespace std; +void grades(int n){ + if(n>=91 && n<=100){ + cout<<"AA"; + }else if(n>=81 && n<=90){ + cout<<"AB"; + }else if(n>=71 && n<=80){ + cout<<"BB"; + }else if(n>=61 && n<=70){ + cout<<"BC"; + }else if(n>=51 && n<=60){ + cout<<"CD"; + }else if(n>=41 && n<=50){ + cout<<"DD"; + }else{ + cout<<"Fail"; + } +} +int main(){ + int marks; + cin>>marks; + grades(marks); + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 10/1/Level1/Practice8.exe b/Cherish Sachdeva/Milestone 10/1/Level1/Practice8.exe new file mode 100644 index 00000000..dcc3d868 Binary files /dev/null and b/Cherish Sachdeva/Milestone 10/1/Level1/Practice8.exe differ diff --git a/Cherish Sachdeva/Milestone 10/1/Level1/Practice9.cpp b/Cherish Sachdeva/Milestone 10/1/Level1/Practice9.cpp new file mode 100644 index 00000000..a97b654e --- /dev/null +++ b/Cherish Sachdeva/Milestone 10/1/Level1/Practice9.cpp @@ -0,0 +1,15 @@ +#include +using namespace std; +int factorial(int n){ + int fac=1; + for(int i=1;i<=n;i++){ + fac*=i; + } + return fac; +} +int main(){ + int x; + cin>>x; + cout< +using namespace std; +int main(){ + int i,t; + cin>>i; + while(i--){ + cin>>t; + cout< +using namespace std; +int cube(int n){ + int x; + x=n*n*n; + return x; +} +int main(){ + int a; + cin>>a; + cout< +using namespace std; +int area(int r){ + int A; + A=(22*r*r)/7; + return A; +} +int circumference(int r){ + int C; + C=(2*22*r)/7; + return C; +} +int diameter(int r){ + int d=r*2; + return d; +} +int main(){ + int r; + cin>>r; + cout<<"Area of crcle is "< +using namespace std; +int max(int a,int b){ + int c=a>b?a:b; + return c; +} +int main(){ + int a,b; + cin>>a; + cin>>b; + cout<<"Max is "< +using namespace std; +bool type(int n){ + if(n%2==0){ + return true; + }else{ + return false; + } +} +int main(){ + int a; + cin>>a; + if(type(a)){ + cout<<"Even"; + }else{ + cout<<"Odd"; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 10/2/Practice4.exe b/Cherish Sachdeva/Milestone 10/2/Practice4.exe new file mode 100644 index 00000000..99694d04 Binary files /dev/null and b/Cherish Sachdeva/Milestone 10/2/Practice4.exe differ diff --git a/Cherish Sachdeva/Milestone 10/2/Practice5.cpp b/Cherish Sachdeva/Milestone 10/2/Practice5.cpp new file mode 100644 index 00000000..a7596066 --- /dev/null +++ b/Cherish Sachdeva/Milestone 10/2/Practice5.cpp @@ -0,0 +1,49 @@ +#include +using namespace std; +bool prime(int n){ + for(int i=2;i>x; + if(armstrong(x)){ + cout< +using namespace std; +bool prime(int n){ + for(int i=2;i>a; + cin>>b; + for(i=a+1;i +using namespace std; +bool strong(int n){ + int a=n,sum=0,rem,pro; + while(n!=0){ + rem=n%10; + pro=1; + for(int i=1;i<=rem;i++){ + pro*=i; + } + sum+=pro; + n/=10; + } + if(sum==a){ + return true; + }else{ + return false; + } +} +int main(){ + int i,a,b; + cin>>a; + cin>>b; + for(i=a+1;i +using namespace std; +bool armstrong(int n){ + int a=n,sum=0,rem; + while(n!=0){ + rem=n%10; + sum+=rem*rem*rem; + n/=10; + } + if(sum==a){ + return true; + }else{ + return false; + } +} +int main(){ + int i,a,b; + cin>>a; + cin>>b; + for(i=a+1;i +using namespace std; + +bool perfect(int n){ + int sum=0; + int a=n; + for(int i=1;i>a; + cin>>b; + for(i=a+1;i +using namespace std; +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +void bubblesort(int arr[],int n){ + int flag; + for(int i=0;iarr[j+1]){ + swap(arr[j],arr[j+1]); + } + flag=1; + } + if(flag==0){ + break; + } + } +} +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + bubblesort(arr,n); + cout<<"Maximum Difference pairs: "< +using namespace std; +int main(){ + int n; + cin>>n; + int a[n]; + for(int i=0;i>a[i]; + } + for(int i=3;i<=8;i++){ + for(int j=i;j<=8;j++){ + cout< +using namespace std; +int main(){ + int n,maxno,minno,sum=0; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + maxno=INT_MIN; + minno=INT_MAX; + for(int i=0;i +using namespace std; +int main(){ + int n,key,flag=0; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + cin>>key; + for(int i=0;i +using namespace std; +int main(){ + int n,p=0,e=0,o=0,ne=0,z=0; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i0 && arr[i]%2==0){ + p++; + e++; + }else if(arr[i]>0 && arr[i]%2!=0){ + p++; + o++; + }else if(arr[i]<0 && arr[i]%2==0){ + ne++; + e++; + }else if(arr[i]<0 && arr[i]%2!=0){ + ne++; + o++; + }else if(arr[i]==0){ + z++; + } + } + cout<<"Positive: "< +using namespace std; +int main(){ + int n,j; + cin>>n; + int a[n],b[n]; + for(int i=0;i>a[i]; + } + j=0; + for(int i=n-1;i>=0;i--){ + b[j]=a[i]; + j++; + } + for(int i=0;i +using namespace std; +int main(){ + int n,sum=0,pro=1; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,m; + cin>>n>>m; + int a[n][m]; + for(int i=0;i>a[i][j]; + } + } + for(int i=0;i +using namespace std; +int main(){ + int n,maxno,minno; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + maxno=INT_MIN; + minno=INT_MAX; + for(int i=0;i +using namespace std; +int main(){ + int t; + cin>>t; + while(t--){ + int n,flag=1; + cin>>n; + int a[n]; + for(int i=0;i>a[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,c=0,d=0; + cin>>n; + int a[n],arr1[n],arr2[n]; + for(int i=0;i>a[i]; + } + int k=n/2; + for(int i=0;i +using namespace std; +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,pos; + cin>>n>>pos; + int a[n]; + vector v; + for(int i=0;i>a[i]; + v.push_back(a[i]); + } + v.erase(v.begin()+(pos-1)); + for(auto it=v.begin();it!=v.end();it++){ + cout<<*it<<" "; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 11/2/Practice10.exe b/Cherish Sachdeva/Milestone 11/2/Practice10.exe new file mode 100644 index 00000000..99e99c0b Binary files /dev/null and b/Cherish Sachdeva/Milestone 11/2/Practice10.exe differ diff --git a/Cherish Sachdeva/Milestone 11/2/Practice11.cpp b/Cherish Sachdeva/Milestone 11/2/Practice11.cpp new file mode 100644 index 00000000..d875b0f7 --- /dev/null +++ b/Cherish Sachdeva/Milestone 11/2/Practice11.cpp @@ -0,0 +1,28 @@ +#include +using namespace std; +int main(){ + int n,c; + cin>>n; + int a[n],b[n]; + for(int i=0;i>a[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,c; + cin>>n; + int a[n],b[n]; + for(int i=0;i>a[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,a2; + cin>>n; + set s; + int a[n]; + for(int i=0;i>a[i]; + s.insert(a[i]); + } + a2=s.size(); + cout< +using namespace std; +int main(){ + int n; + cin>>n; + int a[n]; + for(int i=0;i>a[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int x,y; + cin>>x>>y; + vector v; + int a[x],b[y]; + for(int i=0;i>a[i]; + v.push_back(a[i]); + } + for(int i=0;i>b[i]; + v.push_back(b[i]); + } + sort(v.begin(),v.end()); + for(auto it=v.begin();it!=v.end();it++){ + cout<<*it<<" "; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 11/2/Practice15.exe b/Cherish Sachdeva/Milestone 11/2/Practice15.exe new file mode 100644 index 00000000..072d6a1b Binary files /dev/null and b/Cherish Sachdeva/Milestone 11/2/Practice15.exe differ diff --git a/Cherish Sachdeva/Milestone 11/2/Practice16.cpp b/Cherish Sachdeva/Milestone 11/2/Practice16.cpp new file mode 100644 index 00000000..aac5d8e8 --- /dev/null +++ b/Cherish Sachdeva/Milestone 11/2/Practice16.cpp @@ -0,0 +1,19 @@ +#include +using namespace std; +int main(){ + int n,i=0; + cin>>n; + int a[n],j=n-1; + for(int i=0;i>a[i]; + } + while(i<=j){ + swap(a[i],a[j]); + i++; + j--; + } + for(int i=0;i +using namespace std; +int main(){ + int n,k1=0,k2=0; + cin>>n; + int a[n],e[n],o[n]; + for(int i=0;i>a[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + int key; + cin>>key; + for(int i=0;i +using namespace std; +void bubblesort(int arr[],int n){ + int flag; + for(int i=0;iarr[j+1]){ + swap(arr[j],arr[j+1]); + } + flag=1; + } + if(flag==0){ + break; + } + } +} +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + bubblesort(arr,n); + for(int i=0;i +using namespace std; +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,k1=0,k2=0; + cin>>n; + vector v; + int a[n],e[n],o[n]; + for(int i=0;i>a[i]; + e[i]=-1; + o[i]=-1; + } + for(int i=0;i +using namespace std; +void reverse(int a[],int i,int j){ + int li=i; + int ri=j; + while(li>n>>k; + int a[n]; + for(int i=0;i>a[i]; + } + if(k<0){ + k=k+n; + } + k=k%n; + reverse(a,0,n-k-1); + reverse(a,n-k,n-1); + reverse(a,0,n-1); + for(int i=0;i +using namespace std; +int main(){ + int n,t; + cin>>n>>t; + int a[n]; + for(int i=0;i>a[i]; + } + while(t--){ + for(int i=n-1;i>0;i--){ + swap(a[i],a[i-1]); + } + } + for(int i=0;i +using namespace std; +int main(){ + int n,sum=0; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,maxno,minno; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + maxno=INT_MIN; + minno=INT_MAX; + for(int i=0;i +using namespace std; +void bubblesort(int arr[],int n){ + int flag; + for(int i=0;iarr[j+1]){ + swap(arr[j],arr[j+1]); + } + flag=1; + } + if(flag==0){ + break; + } + } +} +int main(){ + int n; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + bubblesort(arr,n); + cout< +using namespace std; +int main(){ + int n,e=0,o=0; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,ne=0; + cin>>n; + int arr[n]; + for(int i=0;i>arr[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,k=0; + cin>>n; + int a[n],b[n]; + for(int i=0;i>a[i]; + } + for(int i=0;i +using namespace std; +int main(){ + int n,val,pos; + vector v; + cin>>n>>val>>pos; + int a[n]; + for(int i=0;i>a[i]; + v.push_back(a[i]); + } + v.insert(v.begin()+(pos-1),val); + for(auto it=v.begin();it!=v.end();it++){ + cout<<*it<<" "; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 11/2/Practice9.exe b/Cherish Sachdeva/Milestone 11/2/Practice9.exe new file mode 100644 index 00000000..0e024fe9 Binary files /dev/null and b/Cherish Sachdeva/Milestone 11/2/Practice9.exe differ diff --git a/Cherish Sachdeva/Milestone 11/2/inputf.in b/Cherish Sachdeva/Milestone 11/2/inputf.in new file mode 100644 index 00000000..96fd67f4 --- /dev/null +++ b/Cherish Sachdeva/Milestone 11/2/inputf.in @@ -0,0 +1,2 @@ +12 -1 +0 5 1 2 3 4 6 12 10 9 5 5 \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 11/2/outputf.in b/Cherish Sachdeva/Milestone 11/2/outputf.in new file mode 100644 index 00000000..419bedb7 --- /dev/null +++ b/Cherish Sachdeva/Milestone 11/2/outputf.in @@ -0,0 +1 @@ +5 1 2 3 4 6 12 10 9 5 5 0 \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 12/2/Practice1.cpp b/Cherish Sachdeva/Milestone 12/2/Practice1.cpp new file mode 100644 index 00000000..8b48595a --- /dev/null +++ b/Cherish Sachdeva/Milestone 12/2/Practice1.cpp @@ -0,0 +1,62 @@ +#include +using namespace std; +int main(){ + int n1,n2,op,sum; + cin>>n1>>n2>>op; + int a[n1][n2],b[n2][n1]; + for(int i=0;i>a[i][j]; + } + } + if(op==1){ + for(int i=0;i +using namespace std; +int main(){ + int n,op,sum=0; + cin>>n>>op; + int a[n][n]; + for(int i=0;i>a[i][j]; + } + } + if(op==1){ + for(int i=0;i"<"< +using namespace std; +int main(){ + int a[4][6],mult; + for(int i=0;i<4;i++){ + for(int j=0;j<6;j++){ + cin>>a[i][j]; + } + } + for(int i=0;i<4;i++){ + mult=1; + for(int j=0;j<6;j++){ + mult*=a[i][j]; + } + cout< +using namespace std; +int main(){ + int n; + cin>>n; + int a[n][n]; + for(int i=0;i>a[i][j]; + } + } + for(int i=0;i=i && j +using namespace std; +int main(){ + int n; + cin>>n; + int a[n][n]; + for(int i=0;i>a[i][j]; + } + } + for(int i=(n-1)/2,j=0;j +using namespace std; +int main(){ + int m,n; + cin>>m>>n; + int a[m][n],b[m][n],c[m][n]; + for(int i=0;i>a[i][j]; + } + } + for(int i=0;i>b[i][j]; + } + } + for(int i=0;i +using namespace std; +int main(){ + int m,n,p,sum; + cin>>m>>n>>p; + int a[m][n],b[n][p],c[m][p]; + for(int i=0;i>a[i][j]; + } + } + for(int i=0;i>b[i][j]; + } + } + for(int i=0;i +using namespace std; +int main(){ + int l,b; + cin>>l; + cin>>b; + string ans=(l==b)?"Square":"Rectangle"; + cout< +using namespace std; +int main(){ + int x=2,y=5,z=0; + cout<<(x==2)<=5)< +using namespace std; +int main(){ + char inp; + cin>>inp; + int islower,isupper; + islower=(inp=='a'||inp=='b'||inp=='c'||inp=='d'||inp=='e'||inp=='f'||inp=='g'||inp=='h'||inp=='i'||inp=='j'||inp=='k'||inp=='l'||inp=='m'||inp=='n'||inp=='o'||inp=='p'||inp=='q'||inp=='r'||inp=='s'||inp=='t'||inp=='u'||inp=='v'||inp=='w'||inp=='x'||inp=='y'||inp=='z'); + isupper=(inp=='A'||inp=='B'||inp=='C'||inp=='D'||inp=='E'||inp=='F'||inp=='G'||inp=='H'||inp=='I'||inp=='J'||inp=='K'||inp=='L'||inp=='M'||inp=='N'||inp=='O'||inp=='P'||inp=='Q'||inp=='R'||inp=='S'||inp=='T'||inp=='U'||inp=='V'||inp=='W'||inp=='X'||inp=='Y'||inp=='Z'); + if(islower){ + cout<<"LowerCase"< +using namespace std; +int main(){ + int num1,num2; + cin>>num1; + cin>>num2; + int c=num1>num2?num1:num2; + cout<<"Max of two numbers is "< +using namespace std; +int main(){ + int quant,cost; + cout<<"How much quantity the user wants to buy?"<>quant; + cout<1000){ + cost-=0.1*cost; + cout<<"User has to pay "< +using namespace std; +int main(){ + int salary,service,bonus; + cin>>salary; + cin>>service; + cout<<"Employee salary is "<5){ + bonus=0.05*salary; + cout<<"Bonus amount is "< +using namespace std; +int main(){ + int marks; + cin>>marks; + cout<<"Enter the marks of students "<80){ + cout<<"A"<60){ + cout<<"B"<50){ + cout<<"C"<45){ + cout<<"D"<25){ + cout<<"E"< +using namespace std; +int main(){ + int age1,age2,age3; + cin>>age1; + cin>>age2; + cin>>age3; + if(age1>age2 && age1>age3){ + if(age2>age3){ + cout<<"Youngest is "<age1 && age2>age3){ + if(age1>age3){ + cout<<"Youngest is "<age2 && age3>age1){ + if(age2>age1){ + cout<<"Youngest is "< +using namespace std; +int main(){ + int num; + cin>>num; + int ans=(num>=0)?num:(num*-1); + cout<<"Absolute value of "< +using namespace std; +int main(){ + int classes_held,classes_attended; + float s; + cin>>classes_held; + cin>>classes_attended; + cout<<"No. of classes held "<=75?"Allowed to sit in exam":"Not allowed to sit in exam"; + cout< +using namespace std; +int main(){ + int classes_held,classes_attended; + float s; + char medical; + cin>>classes_held; + cin>>classes_attended; + cin>>medical; + cout<<"No. of classes held "<=75 && (medical=='Y'||medical=='N')){ + cout<<"Allowed to sit in exam"< +using namespace std; +int main(){ + int yr; + cin>>yr; + if(yr%4==0){ + if(yr%100!=0){ + cout<<"Leap year"< +using namespace std; +int main(){ + int age; + char sex,martial; + cin>>age; + cin>>sex; + cin>>martial; + if(sex=='F' && (age>=20 && age<=60)){ + cout<<"Employee will only work in urban areas"<=20 && age<40)){ + cout<<"Emplyee will work anywhere"<=40 && age<=60)){ + cout<<"Employee will work only in urban areas"< +using namespace std; +int main(){ + int num,re; + cin>>num; + while(num!=0){ + re=num%10; + cout< +using namespace std; +int main(){ + int n,i=1; + cin>>n; + while(i<=n){ + cout< +using namespace std; +int main(){ + int n,re,count=0; + cin>>n; + while(n!=0){ + re=n%10; + n=n/10; + count++; + } + cout< +using namespace std; +int main(){ + int n; + cin>>n; + while(n!=0){ + cout< +using namespace std; +int main(){ + char a1='a'; + char a2='z'; + while(a1<=a2){ + cout< +using namespace std; +int main(){ + int a=1,b=100; + while(a<=b){ + if(a%2==0){ + cout< +using namespace std; +int main(){ + int a=1,b=100; + while(a<=b){ + if(a%2!=0){ + cout< +using namespace std; +int main(){ + int a=1,n,sum=0; + cin>>n; + while(a<=n){ + sum+=a; + a++; + } + cout< +using namespace std; +int main(){ + int n,a=1,sum=0; + cin>>n; + while(a<=n){ + if(a%2==0){ + sum+=a; + } + a++; + } + cout< +using namespace std; +int main(){ + int n,a=1,sum=0; + cin>>n; + while(a<=n){ + if(a%2!=0){ + sum+=a; + } + a++; + } + cout< +using namespace std; +int main(){ + int n; + cin>>n; + cout<=10){ + n/=10; + } + cout<<"First Digit is "< +using namespace std; +int main(){ + int i; + for(i=1;i<=256;i++){ + cout<<"ASCII of "< +using namespace std; +int main(){ + int n,lt,ft; + cin>>n; + ft=n; + lt=n%10; + while(ft>=10){ + ft/=10; + } + cout<<"sum of first and last digit of "< +using namespace std; +int main(){ + int n,newnum,fd,num,count=0,ld; + cin>>n; + num=n; + ld=n%10; + while(n>=10){ + n/=10; + count++; + } + fd=n; + newnum=(ld*pow(10,count)+fd)+(num-fd*pow(10,count)-ld); + cout< +using namespace std; +int main(){ + int n,rev,sum=0; + cin>>n; + while(n!=0){ + rev=n%10; + n/=10; + sum+=rev; + } + cout< +using namespace std; +int main(){ + int n,rev,p=1; + cin>>n; + while(n!=0){ + rev=n%10; + n/=10; + p*=rev; + } + cout< +using namespace std; +int main(){ + int n,rev; + cin>>n; + while(n!=0){ + rev=n%10; + n/=10; + cout< +using namespace std; +int main(){ + int k,n,a,b=0; + cin>>n; + k=n; + while(n>0){ + a=n%10; + b=b*10+a; + n/=10; + } + if(k==b){ + cout<<"Pallindrome"< +using namespace std; +int main(){ + int i,n,freq[10],rem; + cin>>n; + for(i=0;i<=9;i++){ + freq[i]=0; + } + while(n!=0){ + rem=n%10; + n/=10; + freq[rem]++; + } + for(int j=0;j<10;j++){ + cout<<"Frequency of "< +using namespace std; +int main(){ + int n,num=0,rem,c; + cin>>n; + while(n>0){ + c=n%10; + num=(num*10)+c; + n/=10; + } + while(num!=0){ + rem=num%10; + if(rem==0){ + cout<<" Zero "; + }else if(rem==1){ + cout<<" One "; + }else if(rem==2){ + cout<<" Two "; + }else if(rem==3){ + cout<<" Three "; + }else if(rem==4){ + cout<<" Four "; + }else if(rem==5){ + cout<<" Five "; + }else if(rem==6){ + cout<<" Six "; + }else if(rem==7){ + cout<<" Seven "; + }else if(rem==8){ + cout<<" Eight "; + }else if(rem==9){ + cout<<" Nine "; + } + num/=10; + } + return 0; +} diff --git a/Cherish Sachdeva/Milestone 3/Practice9.exe b/Cherish Sachdeva/Milestone 3/Practice9.exe new file mode 100644 index 00000000..631a7dbd Binary files /dev/null and b/Cherish Sachdeva/Milestone 3/Practice9.exe differ diff --git a/Cherish Sachdeva/Milestone 3/inputf.in b/Cherish Sachdeva/Milestone 3/inputf.in new file mode 100644 index 00000000..e69de29b diff --git a/Cherish Sachdeva/Milestone 3/outputf.in b/Cherish Sachdeva/Milestone 3/outputf.in new file mode 100644 index 00000000..e173ec4a Binary files /dev/null and b/Cherish Sachdeva/Milestone 3/outputf.in differ diff --git a/Cherish Sachdeva/Milestone 4/Practice1.cpp b/Cherish Sachdeva/Milestone 4/Practice1.cpp new file mode 100644 index 00000000..1cb5b749 --- /dev/null +++ b/Cherish Sachdeva/Milestone 4/Practice1.cpp @@ -0,0 +1,14 @@ +#include +using namespace std; +int main(){ + int a,num,b; + cin>>num; + cin>>b; + a=1; + cout<<"Enter base: "< +using namespace std; +int main(){ + int n; + cin>>n; + for(int i=1;i<=n;i++){ + if(n%i==0){ + cout<<"Factors are "< +using namespace std; +int main(){ + int a,b,hcf,min; + cin>>a; + cin>>b; + min=a>b?b:a; + for(int i=1;i<=min;i++){ + if(a%i==0 && b%i==0){ + hcf=i; + } + + } + cout< +using namespace std; +int main(){ + int n,fac=1; + cin>>n; + for(int i=1;i<=n;i++){ + fac=fac*i; + } + cout< +using namespace std; +int main(){ + int a,b,min,lcm,hcf; + cin>>a; + cin>>b; + min=a +using namespace std; +int main(){ + int n,i; + cin>>n; + for(i=2;i +using namespace std; +int main(){ + int a,b,i,j; + cin>>a; + cin>>b; + for(i=a;i +using namespace std; +int main(){ + int a,b,i,j,sum=0; + cin>>a; + cin>>b; + for(i=a;i +using namespace std; +int main(){ + int n,i,j; + cin>>n; + for(i=2;i +using namespace std; +int main(){ + int n,num,num1,sum=0,rem,count=0; + cin>>n; + num=n; + num1=n; + while(num!=0){ + num/=10; + count+=1; + } + while(n!=0){ + rem=n%10; + sum+=pow(rem,count); + n/=10; + } + if(sum==num1){ + cout<<"Armstrong"; + }else{ + cout<<"Not Armstrong"; + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 5/Practice5.exe b/Cherish Sachdeva/Milestone 5/Practice5.exe new file mode 100644 index 00000000..2bcca69b Binary files /dev/null and b/Cherish Sachdeva/Milestone 5/Practice5.exe differ diff --git a/Cherish Sachdeva/Milestone 5/Practice6.cpp b/Cherish Sachdeva/Milestone 5/Practice6.cpp new file mode 100644 index 00000000..3a992f39 --- /dev/null +++ b/Cherish Sachdeva/Milestone 5/Practice6.cpp @@ -0,0 +1,23 @@ +#include +using namespace std; +int main() +{ + int n, b, rem, sum; + cin >> n; + for (int i = 1; i <= n; i++) + { + sum = 0; + b = i; + while (b != 0) + { + rem = b % 10; + sum += rem*rem*rem; + b /= 10; + } + if (sum == i) + { + cout << i << endl; + } + } + return 0; +} \ No newline at end of file diff --git a/Cherish Sachdeva/Milestone 5/Practice6.exe b/Cherish Sachdeva/Milestone 5/Practice6.exe new file mode 100644 index 00000000..8f596a17 Binary files /dev/null and b/Cherish Sachdeva/Milestone 5/Practice6.exe differ diff --git a/Cherish Sachdeva/Milestone 5/inputf.in b/Cherish Sachdeva/Milestone 5/inputf.in new file mode 100644 index 00000000..83b33d23 --- /dev/null +++ b/Cherish Sachdeva/Milestone 5/inputf.in @@ -0,0 +1 @@ +1000 diff --git a/Cherish Sachdeva/Milestone 5/outputf.in b/Cherish Sachdeva/Milestone 5/outputf.in new file mode 100644 index 00000000..d00491fd --- /dev/null +++ b/Cherish Sachdeva/Milestone 5/outputf.in @@ -0,0 +1 @@ +1 diff --git a/Cherish Sachdeva/Milestone 6/Practice1.cpp b/Cherish Sachdeva/Milestone 6/Practice1.cpp new file mode 100644 index 00000000..1505bb1b --- /dev/null +++ b/Cherish Sachdeva/Milestone 6/Practice1.cpp @@ -0,0 +1,19 @@ +#include +using namespace std; +int main(){ + int n,sum=0; + cin>>n; + for(int i=1;i +using namespace std; +int main(){ + int i,j,n; + cin>>n; + for(i=1;i<=n;i++){ + int sum=0; + for(j=1;j +using namespace std; +int main(){ + int a,n,rem,pro,sum=0; + cin>>n; + a=n; + while(a!=0){ + rem=a%10; + prod=1; + for(int i=1;i<=rem;i++){ + prod=prod*i; + } + sum+=prod; + a/=10; + } + cout< +using namespace std; +int main(){ + int n,sum,rem,a,fac; + cin>>n; + for(int i=1;i<=n;i++){ + a=i; + sum=0; + while(a!=0){ + rem=a%10; + fac=1; + for(int j=1;j<=rem;j++){ + fac=fac*j; + } + sum+=fac; + a/=10; + } + if(sum==i){ + cout< +using namespace std; +int main(){ + int a=0,b=1,c,n; + cin>>n; + for(int i=1;i<=n;i++){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=i;j++){ + cout<<"*"; + } + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j>=i-3 && j<=11-i && j>=5-i && j<=3+i){ + cout<<"*"; + } + else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j==i || j==8-i){ + cout<<"*"; + break; + } + else{ + cout<<"*"; + } + } + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + for(int j=1;j<=col;j++){ + if(j>=i && j<=8-i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + int k=i; + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=i+3){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=7-i; + for(int j=1;j<=row;j++){ + if(j<=8-i){ + cout< +using namespace std; +int main(){ + int row,col,k; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + k=1; + for(int j=1;j<=col;j++){ + if(j>=6-i && j>=i-4){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j==i){ + cout<<"\\"; + continue; + }else if(j==8-i){ + cout<<"/";} + else{ + cout<<"*"; + } + } + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j<=6-i || j>=4+i){ + cout<<"*"; + }else if(j<=i-4 || j>=14-i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + for(int j=1;j<=col;j++){ + if(j>=i && j<=10-i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col; + char d; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + d='A'; + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=3+i){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j>=6-i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col,k; + char d; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + d='A'; + k=1; + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=4+i){ + if(j<5){ + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=9-i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,k,col; + char d; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + d='A'; + k=1; + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=3+i){ + if(j<5){ + cout< +using namespace std; +int main(){ + int row,n; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=i;j++){ + n=j%2==0?0:1; + cout< +using namespace std; +int main(){ + for(int i=1;i<=7;i++){ + for(int j=1;j<=7;j++){ + if((j==1||j==7||i==1||i==7)||(i>=3&&i<=5&&j>=3&&j<=5)&&(i==3||i==5||j==3||j==5)){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row; + char k; + cin>>row; + for(int i=1;i<=row;i++){ + k=64+i; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=3+i){ + if(j<=4){ + cout<<5-j; + }else{ + cout< +using namespace std; +int main(){ + int row; + char k=64; + cin>>row; + for(int i=1;i<=row;i++){ + k=k+(2*(i-1))+1; + for(int j=1;j<=row;j++){ + if(j>=6-i){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j>=i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col,k,n; + char d; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + k=1; + n=1; + d='A'; + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=3+i && k){ + if(i%2==0){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j==6-i || j==i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col; + char d; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + d='A'; + for(int j=1;j<=col;j++){ + if(j<=5-i || j>=3+i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=0; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + for(int j=1;j<=col;j++){ + if(j>=6-i && j<=4+i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col,k; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + k=1; + for(int j=1;j<=col;j++){ + if(j>=6-i && j<=4+i && k){ + cout<<"*"; + k=0; + }else{ + cout<<" "; + k=1; + } + } + cout< +using namespace std; +int main(){ + int row,col; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + for(int j=1;j<=col;j++){ + if(j<=6-i||j>=4+i){ + cout<<"*"; + }else{ + cout<<" "; + } + } + cout< +using namespace std; +int main(){ + int row,col,k; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + k=1; + for(int j=1;j<=col;j++){ + if(j>=5-i && j<=3+i){ + cout< +using namespace std; +int main(){ + int row,col; + char d; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + d='A'; + for(int j=1;j<=col;j++){ + if(j<=5-i||j>=3+i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=1; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=6-i; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,col,k=3,m; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + m=1; + for(int j=1;j<=col;j++){ + if(j<=5-i+k){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=i%2==0?6-i:1; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + if(i%2==1){ + cout< +using namespace std; +int main(){ + int row,col,k; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + k=6-i; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout< +using namespace std; +int main(){ + int row,col,k; + cin>>row; + cin>>col; + for(int i=1;i<=row;i++){ + k=i; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=6-i; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + k=(i+j)%2==0?1:0; + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=6-i; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=1; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=i; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=6-i; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=row; + for(int j=1;j<=row;j++){ + if(j<=6-i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=i; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row,k; + cin>>row; + for(int i=1;i<=row;i++){ + k=row; + for(int j=1;j<=row;j++){ + if(j<=i){ + cout< +using namespace std; +int main(){ + int row; + cin>>row; + for(int i=1;i<=row;i++){ + for(int j=1;j<=row;j++){ + if(j<=i){ + cout<