Scribd
Upload
2 views4 pages

Cpp Programs

The document contains multiple C++ code snippets demonstrating various programming concepts, including calculating sums, reversing numbers, checking for palindromes, and computing factorials. Each snippet is a standalone program that performs a specific task, such as finding the maximum and minimum in an array or generating Fibonacci numbers. Overall, it serves as a practical guide for basic algorithm implementations in C++.

Uploaded by

kuronamiknife955
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views4 pages

Cpp Programs

The document contains multiple C++ code snippets demonstrating various programming concepts, including calculating sums, reversing numbers, checking for palindromes, and computing factorials. Each snippet is a standalone program that performs a specific task, such as finding the maximum and minimum in an array or generating Fibonacci numbers. Overall, it serves as a practical guide for basic algorithm implementations in C++.

Uploaded by

kuronamiknife955
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1.

Sum of first 10 numbers (while loop)

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int i=1, sum=0;
while(i<=10) { sum += i; i++; }
cout<<"Sum = "<<sum;
getch();
}

2. Switch arithmetic

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a,b,ch;
cin>>a>>b>>ch;
switch(ch) {
case 1: cout<<a+b; break;
case 2: cout<<a-b; break;
case 3: cout<<a*b; break;
case 4: cout<<a/b; break;
}
getch();
}

3. Reverse number

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int n, rev=0;
cin>>n;
while(n!=0) { rev = rev*10 + n%10; n/=10; }
cout<<rev;
getch();
}

4. Sum of digits

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int n, sum=0;
cin>>n;
while(n>0) { sum += n%10; n/=10; }
cout<<sum;
getch();
}
5. Palindrome

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int n, rev=0, temp;
cin>>n; temp=n;
while(n!=0) { rev = rev*10 + n%10; n/=10; }
if(temp==rev) cout<<"Palindrome";
else cout<<"Not";
getch();
}

6. Armstrong

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int n, sum=0, r, temp;
cin>>n; temp=n;
while(n>0) { r=n%10; sum+=r*r*r; n/=10; }
if(sum==temp) cout<<"Armstrong";
else cout<<"Not";
getch();
}

7. Factorial

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int n,f=1; cin>>n;
for(int i=1;i<=n;i++) f*=i;
cout<<f;
getch();
}

8. Power

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a,b,p=1; cin>>a>>b;
for(int i=1;i<=b;i++) p*=a;
cout<<p;
getch();
}

9. Fibonacci
#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int n,a=0,b=1,c;
cin>>n;
cout<<a<<" "<<b<<" ";
for(int i=3;i<=n;i++) {
c=a+b; cout<<c<<" ";
a=b; b=c;
}
getch();
}

10. Reverse array

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a[10];
for(int i=0;i<10;i++) cin>>a[i];
for(int i=9;i>=0;i--) cout<<a[i]<<" ";
getch();
}

11. Sum of array

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a[10], sum=0;
for(int i=0;i<10;i++) { cin>>a[i]; sum+=a[i]; }
cout<<sum;
getch();
}

12. Max Min

#include<iostream>
#include<conio.h>
using namespace std;
int main() {
int a[10], max, min;
for(int i=0;i<10;i++) cin>>a[i];
max=min=a[0];
for(int i=1;i<10;i++) {
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
}
cout<<max<<" "<<min;
getch();
}

13. Pattern
#include<iostream>
#include<conio.h>
using namespace std;
int main() {
for(int i=1;i<=5;i++) cout<<"*";
cout<<endl;
for(int i=1;i<=5;i++) cout<<i;
getch();
}

14. Function Min Max

#include<iostream>
#include<conio.h>
using namespace std;
int max(int a,int b){ return a>b?a:b; }
int min(int a,int b){ return a<b?a:b; }
int main() {
int a,b; cin>>a>>b;
cout<<max(a,b)<<" "<<min(a,b);
getch();
}

15. Function Factorial

#include<iostream>
#include<conio.h>
using namespace std;
int fact(int n){
int f=1;
for(int i=1;i<=n;i++) f*=i;
return f;
}
int main(){
int n; cin>>n;
cout<<fact(n);
getch();
}

16. Function Power

#include<iostream>
#include<conio.h>
using namespace std;
int power(int a,int b){
int p=1;
for(int i=1;i<=b;i++) p*=a;
return p;
}
int main(){
int a,b; cin>>a>>b;
cout<<power(a,b);
getch();
}

You might also like