1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int arr[200001], counter;
int merged[200001];
void merge(int beg, int mid, int end)
{
     int i, j, k, left_len, right_len, merged_len;
     
     right_len=(end-mid);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
usnig namespace std;
main()
{
string a;
int n;
cin>>n;
while(n>0)
{
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int arr[200001], counter;
int merged[200001];
void merge(int beg, int mid, int end)
{
     int i, j, k, left_len, right_len, merged_len;
     
     right_len=(end-mid);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int arr[200001], counter;
int merged[200001];
void merge(int beg, int mid, int end)
{
     int i, j, k, left_len, right_len, , merged_len;
     
     right_len=(end-mid);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int arr[200001], counter;
 
void merge(int beg, int mid, int end)
{
     int i, j, k, left_len, right_len, *merged, merged_len;
     
     right_len=(end-mid);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int arr[200001], counter;
 
void merge(int beg, int mid, int end)
{
     int i, j, k, left_len, right_len, *merged, merged_len;
     
     right_len=(end-mid);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
#include<cctype>
#include<string>
using namespace std;
 
 
 
int main()
 ...

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

1
2
3
4
5
6
7
#include <iostream>
 
int main()
{
        cout << "ciao";
        return 0;
}

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<cstdio>
#include<cctype>
#include<string>
using namespace std;
 
 
 
int main()
 ...

1
2
3
4
5
int main()
{
        cout << "ciao";
        return 0;
}

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <map>
#include <string>
#include <algorithm>
 
template <class Key, class T, class Compare = std::less<Key>,
           class Allocator = std::allocator<std::pair<const Key,T> > >
class mymap: public std::map<Key, T, Compare, Allocator>
{
 ...

1
2
3
4
5
6
7
8
9
#include <set>
#include <functional>
 
struct X{};
 
int main(){
  std::set<void (X::*)()> s;
  std::less<void (X::*)()> l;
}

1
2
3
4
5
6
7
8
//Data Structure includes
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<string>
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
 
using namespace std;
 
int main()
{
        int *a = new int[10]();
 
        for (int *it = a, *end = a + 10; it != end; ++it) {
 ...

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

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<cstring>
long long int n,m,tmp,oa[50009]={0},low=50010,i,j,b;
int main () {
scanf("%lld",&n);
b=n;
for(i=1;i<=n;i++){
 ...

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

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<cstring>
long long int n,m,tmp,oa[50009]={0},low=50010,i,j;
int main () {
scanf("%lld",&n);
for(i=1;i<=n;i++){
   scanf("%lld",&tmp);
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
int main()
{
    char numchar[16];
    printf("enter number: ");
    scanf ("%s", numchar);
 ...

1
2
3
4
5
6
7
8
9
import java.net.URL;
 
public class MainClass {
  public static void main(String args[]) throws Exception {
    URL hp = new URL("http://www.java2s.com");
    System.out.println("Protocol: " + hp.getProtocol());
    System.out.println("Port: " + hp.getPort());
    System.out.println("Host: " + hp.getHost());
    System.out.println("File: " + hp.getFile());
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#define MAXLETTERE 7
 
using namespace std;
 
int main() {
        char lettere[] = {'M', 'D', 'C', 'L', 'X', 'V', 'I'}; // Le sette lettere
        int valori[] = {1000, 500, 100, 50, 10, 5, 1}; // I valori di ogni lettera
        int risultato = 0;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int main()
{
        int c,k=0,i,j,temp=0;
        scanf("%d",&c);
        int a[c][2];
        while(k!=c)
        {
 ...

1
2
3
4
5
6
7
8
//Data Structure includes
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<string>
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
int main()
{
        int c,k=0,t=0,i,j,temp=0;
        scanf("%d",&c);
        int a[c][2];
        while(k!=c)
        {
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#define MAXLETTERE 7
 
using namespace std;
 
int main() {
        char lettere[] = {'M', 'D', 'C', 'L', 'X', 'V', 'I'};
        int divisore = 1000; // Inizia da M = 1000
        int risultato = 0;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#define MAXLETTERE 7
 
using namespace std;
 
int main() {
        char lettere = {'M', 'D', 'C', 'L', 'X', 'V', 'I'};
        int divisore = 1000; // Inizia da M = 1000
        int risultato = 0;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#define MAXLETTERE 7
 
using namespace std;
 
int main() {
        char lettere[] = {'M', 'D', 'C', 'L', 'X', 'V', 'I'};
        int divisore = 1000; // Inizia da M = 1000
        int risultato = 0;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<math.h>
int main()
{
        int t,i,j,k,c=0;
        scanf("%d",&t);
        for(i=0;i<t;i++) {
                int a;
                float b,c,d;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#define MAXLETTERE 7
 
using namespace std;
 
int main() {
        char lettere[] = ['M', 'D', 'C', 'L', 'X', 'V', 'I'];
        int divisore = 1000; // Inizia da M = 1000
        int risultato = 0;
 ...