CPP - Some C++ Codes.

Patterns1	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 **** **** **** ****	#include <iostream> using namespace std; int main() { int i=1,n,j=1; cin>>n; while(i<=n) { j=1; while(j<=n) { cout<<'*'; j++; } i++; cout<<endl; } return 0; }

Patterns2	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 1234 1234 1234 1234	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=n) { cout<<j; j++; } i++; cout<<endl; } return 0; }

Patterns3	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 1111 2222 3333 4444	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=n) { cout<<i; j++; } i++; cout<<endl; } return 0; }

Patterns4	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 4321 4321 4321 4321	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=n) { cout<<(n-j+1); j++; } i++; cout<<endl; } return 0; }

Patterns5	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 1 12 123 1234	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=i) { cout<<j; j++; } i++; cout<<endl; } return 0; }

Patterns6	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 1 12 123 1234	#include <iostream> using namespace std; int main() { int n,p; cin>>n; int i=1; while(i<=n) { int j=1,p=i; while(j<=i) { cout<<p; j++; p++; } i++; cout<<endl; } return 0; }

Patterns7	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 1 23 456 78910	#include <iostream> using namespace std; int main() { int n,p=1; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=i) { cout<<p; j++; p++; } i++; cout<<endl; } return 0; }

Patterns8	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 ABCD ABCD ABCD ABCD	#include <iostream> using namespace std; int main() { int n; char ch; cin>>n; int i=1; while(i<=n) { int j=1; ch='A'; while(j<=n) { cout<<ch; j++; ch++; } i++; cout<<endl; } return 0; }

Patterns9	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 ABCD BCDE CDEF DEFG	#include <iostream> using namespace std; int main() { int n; char ch; cin>>n; int i=1; while(i<=n) { int j=1; ch='A'+i-1; while(j<=n) { cout<<ch; j++; ch++; } i++; cout<<endl; } return 0; }

Patterns10	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 A BB CCC DDDD	#include <iostream> using namespace std; int main() { int n; char ch; cin>>n; int i=1; while(i<=n) { int j=1; ch='A'+i-1; while(j<=i) { cout<<ch; j++; } i++; cout<<endl; } return 0; }

Patterns11	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 A BC DEF GHIJ	#include <iostream> using namespace std; int main() { int n; char ch='A'; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=i) { cout<<ch; j++; ch++; } i++; cout<<endl; } return 0; }

Patterns12	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 D CD BCD ABCD	#include <iostream> using namespace std; int main() { int n; char ch; cin>>n; int i=1; while(i<=n) { int j=1; ch='A'+n-i; while(j<=i) { cout<<ch; j++; ch++; } i++; cout<<endl; } return 0; }

Patterns13	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4       *     **   *** ****	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=(n-i)) { cout<<' '; j++; } int k=1; while(k<=i) { cout<<'*'; k++; } i++; cout<<endl; } return 0; }

Patterns14	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 **** *** ** *	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=i; while(j<=n) { cout<<'*'; j++; } i++; cout<<endl; } return 0; }

Patterns15	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4       1     121   12321 1234321	#include <iostream> using namespace std; int main() { int n; cin>>n; int i=1; while(i<=n) { int j=1; while(j<=(n-i)) { cout<<' '; j++; } int k=1; while(k<=i) { cout<<k; k++; } int p=k-2; while(p>0) { cout<<p; p--; } i++; cout<<endl; } return 0; }

Binary Sort	CODE
CUSTOM EXAMPLES INPUT OUTPUT 4 (no. of Testcases) 1 2 2 3 3 5 2 (no. of elements to search) 3 5	#include <iostream> using namespace std; int main() { int n,a[100]; cin>>n; int i=0; while(i<n) { cin>>a[i]; i++; } int t,b[t]; cin>>t; i=0; while(i<t) { cin>>b[i]; i++; } int s=0,e=n-1,m=(s+e)/2; i=0; for(i=0;i<=t;i++){ s=0;e=n-1;m=(s+e)/2; while(s<=e) { if(b[i]==a[m]) { cout<<m; break; } else if(b[i]>a[m]) { s=m++; } else{ e=m--; } } } return 0; }