1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int a,b,c;
double s,area;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <limits.h>
 
using namespace std ;
 
int main()
{
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <ctime>
#include <algorithm>
 
int main()
{
    std::time_t start = std::clock();
    for(int i = 0; i < 1000000; ++i)
        std::string s = std::to_string(i);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
using namespace std;
int binarysearch(int a[],int n,int i)
{
   int start=0;
    int end=n-1;
    int mid=(start+end)/2; 
    while(start<=end&&a[mid]!=i)
 ...

1
2
3
4
5
6
7
8
9
#include <iostream> 
using namespace std; 
main() { 
typedef char T[8][8]; 
T t;
typedef char M[9];
M m;
int i,j,k,nr,nR,x,y,q,w,a,b,c,d,z;
nr=0;nR=0;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <algorithm>
using namespace std;
int a[1000][1000];//Taking Base -Case of a DP[0];
int number_of_per(int n,int r)
{
        if (n==1)
        {
                return 1;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
using namespace std;
int binarysearch(int a[],int n,int i)
{
   int start=0;
    int end=n-1;
    int mid=(start+end)/2; 
    while(start<=end&&a[mid]!=i)
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <ctime>
#include <cstdlib>
#include <algorithm>
 
template<typename type>
std::string to_string(type p)
{
    std::string s;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int a,b,c;
double s,area;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cctype>   
#include<vector>
#include<string>
#include<math.h>
#include<cstring>
using namespace std;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
using namespace std;
int binarysearch(int a[],int n,int i)
{
   int start=0;
    int end=n-1;
    int mid=(start+end)/2; 
    while(start<=end&&a[mid]!=i)
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
 
using namespace std;
 
int x;
int main()
{
  cin >> x;
  cout << x;

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cctype>   
#include<vector>
#include<string>
#include<math.h>
#include<cstring>
using namespace std;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cctype>   
#include<vector>
#include<string>
#include<math.h>
#include<cstring>
using namespace std;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
 
int main()
{
cout<<"hello\n";
 return 0;
 
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cctype>   
#include<vector>
#include<string>
#include<math.h>
#include<cstring>
using namespace std;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream> 
using namespace std; 
main() { 
typedef char T[8][8]; 
T t;
typedef char M[9];
M m;
int i,j,k,nr,nR,x,y,q,w,a,b,c,d,z;
nr=0;nR=0;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cctype>   
#include<vector>
#include<string>
#include<math.h>
#include<cstring>
using namespace std;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
 
using namespace std;
 
int main()
 
{
cout<<"I am cool";
}

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <limits.h>
 
using namespace std ;
 
int main()
{
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
 
int main()
{
cout<<"hello\b\bhi";
 return 0;
 
}

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <limits.h>
 
using namespace std ;
 
int main()
{
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int a,b,c;
double area;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
using namespace std;
int binarysearch(int a[],int n,int i)
{
   int start=0;
    int end=n-1;
    int mid=(start+end)/2; 
    while(start<=end)
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <ctime>
#include <cstdlib>
#include <algorithm>
 
template<typename type>
std::string to_string(type p)
{
    std::string s;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
 
int main()
{
cout<<"hello\a";
 return 0;
 
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cctype>   
#include<vector>
#include<string>
#include<math.h>
#include<cstring>
using namespace std;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream> 
using namespace std; 
main() { 
typedef char T[8][8]; 
T t;
typedef char M[9];
M m;
int i,j,k,nr,nR,x,y,q,w,a,b,c,d,z;
nr=0;nR=0;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int prime(long n)
{
int f=0;
 
 
for(int i=3;i*i<n;i+=2)
{
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <limits.h>
 
using namespace std ;
 
int main()
{
 ...