Utopian Tree

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner s = new Scanner(System.in);

int i, t, j, k, x=1, y=1;

t = s.nextInt();
int m[] = new int[t];
for (i = 0; i < t; i++)
{
m[i] = s.nextInt();
}
for (k = 0; k < t; k++)
{
y=1;
for(i=1;i<=m[k];i++)
{
if(i%2==0)
y+=1;
else
y*=2;
}
System.out.println(y);
}
    }
}

Flipping bits

import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;

class TestClass {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s = new Scanner(System.in);

int i, j,t;
BigInteger a,b,c,k,x,y;
t = s.nextInt();
int p[] = new int[t];
k=new BigInteger("4294967295");
for (i = 0; i < t; i++)
{
a=new BigInteger(s.next());
            a=k.subtract(a);
            System.out.println(a);
}
}
}

Solve Me Second

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
   static int solveMeSecond(int a, int b) {
        return a+b;
   }

 
    public static void main(String[] args) {
      Scanner in = new Scanner(System.in);
      int t;
      int sum;
      int _a,_b;
      t = in.nextInt();
      for (int i=0;i<t;i++) {
         _a = in.nextInt();
         _b = in.nextInt();
         sum = solveMeSecond(_a, _b);
         System.out.println(sum);
         }
   }
}

Lonely Integer

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
   
        int i, t, j, k, x=1, y=1;

t = s.nextInt();
int m[] = new int[t];
int n[] = new int[101];
for (i = 0; i < t; i++)
{
m[i] = s.nextInt();
}
for (i = 0; i <= 100; i++)
{
n[i] = 0;
}
for (k = 0; k < t; k++)
{
n[m[k]]++;
}
for (k = 0; k < 101; k++)
{
if(n[k]==1)
{
System.out.println(k);
break;
}
}
    }
}

Solve Me First

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int solveMeFirst(int a, int b) {
  return a+b;
}

int main() {
  int num1, num2;
  int sum;
  cin>>num1>>num2;
  sum = solveMeFirst(num1,num2);
  cout<<sum;
  return 0;
}