markroxor

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

struct BOX
{
    ll a[3],h;

    bool operator <(const BOX &other)const
        {return a[2]<other.a[2];}

markroxor

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
 
map<long int,long int> mapi,idx;
long int arr[1000005],p;
 
 
void maxHist(long int arr[],long int n)
{

markroxor

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

ll maxHist(ll arr[],ll n)
{
    stack<ll> st;
    ll i=0,maxArea=0,tp;

    while(i<n)

markroxor

#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define mod 1000000007
 
ll fact[1000005],sum[1000005];
 
ll factIt()
{
    fact[0]=1;

markroxor

#include<bits/stdc++.h>
using namespace std;
 
main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        //freopen("output.txt","w",stdout);
    #endif
    long long  t;

markroxor

mon = 10**9
t = raw_input()
t = int(t)
for _ in xrange(t):
	m,p = raw_input().split();
	m = int(m)
	p = float(p)
 
	if m%2:
		fir=mon*(1+p**m)

markroxor

mon = 1000000000
t = raw_input()
t = int(t)
for _ in xrange(t):
	m,p = raw_input().split();
	m = int(m)
	p = float(p)
	if not p:
		if(m&1):
			print "1000000000.0 0.0"

markroxor

#include<bits/stdc++.h>
using namespace std;
 
main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        //freopen("output.txt","w",stdout);
    #endif
    ios::sync_with_stdio(0);

markroxor

#include<iostream>
using namespace std;

main()
{
	ios::sync_with_stdio(0);
  	printf("ap ");
  	cout<<"ac ";
}

markroxor

#include<bits/stdc++.h>
#include<math.h>
typedef int ll;
using namespace std;
 
 inline uint max(uint x, uint y) {
    return (x > y)?x:y;
}
 
struct Node