S

@Shobh89

hollow diamond pattern

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; //top for(int i=0;i<n;i++){ //spaces for(int j=0;j<n-i-1;j++){

pyramid pattern

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=8; for(int i=0;i<n;i++){ //spaces : n-i-1 for(int j=0;j<n-i-1;j++){ cout<<" ";

Inverted triangle pattern

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; int num=1; for(int i=0;i<n;i++){ //spaces for(int j=0;j<i;j++){//backwards floyd'ss triangle

Floyd’s triangle using for loop(alphabets)

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; char ch='A'; for(int i=0;i<n;i++){ for(int j=i+1;j>0;j--){//backwards floyd'ss triangle cout<<ch<<" ";

Floyd’s triangle using for loop

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; int num=1; for(int i=0;i<n;i++){ for(int j=i+1;j>0;j--){//backwards floyd'ss triangle cout<<num<<" ";

Reverse triangle patten

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; for(int i=0;i<n;i++){ for(int j=i+1;j>0;j--){ cout<<j<<" "; }

Triangle Pattern(numbers-2)

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; for(int i=0;i<n;i++){ for(int j=1;j<=i+1;j++){ cout<<j<<" "; }

Triangle Pattern(alphabets)

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=5; char character='A'; for(int i=0;i<n;i++){ for(int j=0;j<=i;j++){ cout<<character<<" "; }

Triangle Pattern(numbers)

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; for(int i=0;i<n;i++){ for(int j=0;j<i+1;j++){ cout<<(i+1)<<" "; }

Triangle Pattern(stars)

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=6; for(int i=0;i<n;i++){//n for(int j=0;j<i+1;j++){//i+1 cout<<"*"<<" "; } cout<<endl;

C Program To Check Prime Number By Creating a Function Using Function for Trial Division Approach

C
1 year ago
//C program to Check Prime Number using Simple Trial //Division Approach #include <stdio.h> int isPrime(int N){ //Check divisibility from 2 to N-1 for(int i=2;i<N;i++){ //If N is divisible by i,it is not prime number

C Program to Check Whether a Number Can Be Express as Sum of Two Prime Numbers

C
1 year ago
//C program to check whether a //number can be expressed as sum //of two numbers #include <stdio.h> //Function to check prime number int isPrime(int n) { int i,isPrime=1;

alphabet pattern-continuous

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; char ch='A'; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){

Continuous number pattern

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=4; int num=1; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){

alphabet pattern

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=7; for(int i=0;i<n;i++){//outer char ch='A'; for(int j=0;j<n;j++){//inner start=>line start cout<<ch<<" ";

Square Pattern for stars

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=7; for(int i=1;i<=n;i++){//outer for(int j=1;j<=n;j++){//inner cout<<"*"<< " ";

Square Pattern

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=7; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<j << " ";

Sum of numbers from 1 to N which are divisible by 3

C++
1 year ago
//C++ program to find sum of numbers from 1 to N //which are divisible by 3 #include <iostream> using namespace std; //Function to calculate sum //of numbers divisible by 3 int sum(int N) { int S1;

Program for factorial of a number

C++
1 year ago
//C program to find factorial of given number #include <iostream> using namespace std; //Function to find factorial // of given number unsigned int factorial(unsigned int n) { if(n == 0 || n == 1) return 1;

Check whether a number is a prime number or not

C++
1 year ago
#include <iostream> using namespace std; int main() { int n=14; bool isPrime=true; for(int i=2;i<n-1;i++){ if(n%i==0){//non prime isPrime=false;