Competitive Coding
A repository of all my competitive coding solutions from various websites over the years.
| Website | Profile Link |
|---|---|
| CodeChef | https://www.codechef.com/users/dollarakshay |
| Codeforces | http://codeforces.com/profile/DollarAkshay |
| CodeCombat | http://codecombat.com/user/dollarakshay |
| CodinGame | https://www.codingame.com/profile/dd09df081b7d24aa424d77235ad4c01a655349 |
| HackerEarth | http://www.hackerearth.com/users/DollarAkshay |
| HackerRank | https://www.hackerrank.com/DollarAkshay |
| SPOJ | http://www.spoj.com/users/dollarakshay |
| TopCoder | http://www.topcoder.com/member-profile/DollarAkshay |
My Template
/*~~~~~~~~~~~~~~~~~~*
* *
* $DollarAkshay$ *
* *
*~~~~~~~~~~~~~~~~~~*/
//
#include <algorithm>
#include <assert.h>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define sp system("pause")
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, a, b) for (int i = a; i >= b; --i)
#define REP(i, n) FOR(i, 0, (int)n - 1)
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define MSX(a, x) memset(a, x, sizeof(a))
#define SORT(a, n) sort(begin(a), begin(a) + n)
#define ll long long
#define pii pair<int, int>
#define MOD 1000000007
int a[1000000];
int main(){
int t, n;
scanf("%d", &t);
REP(tc, t) {
scanf("%d", &n);
}
return 0;
}
//