psychicalcoder

#include <cstdio>

int d[95];

int main() {
        int n,m;
	scanf("%d%d",&n,&m);
	d[0]=1;
	for(int i=1;i<=n;i++){
	    d[i]=d[i-1]<<1;

psychicalcoder

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n;
int a[1001],s[1001],d[1001][1001];

int sum(int l, int r){

psychicalcoder

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;

ll ABS(ll x) {
	return x>=0?x:-x;
}

ll a[1003],d[1003];

psychicalcoder

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char a[1001],b[1001];
int la,lb;

int compare(int len){
	for(int i=0;i<len;i++){
		if(a[i]!=b[lb-len+i])return 0;

psychicalcoder

printf("Hello World");

psychicalcoder

#include <cstdio>
#include <algorithm>
using namespace std;

int d[2][5005];

int main() {
	int m,n,t,mx;
	while(scanf("%d%d",&m,&n)==2&&m&&n){
		mx=0;

psychicalcoder

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

char NAME[2][7] = {"Moumou","Mimi"};

vector<int> G[10005];

psychicalcoder

#include <cstdio>
#include <cstring>
using namespace std;
const int M=(int)1e6;
int d[201][201];
int main(){
    memset(d, 0, sizeof(d));
    d[0][0]=1;
    for(int i=1;i<=200;i++){
    	for(int j=1;j<=200;j++){

psychicalcoder

#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

priority_queue<double, vector<double>, greater<double> > q;

int main() {
    int n;
    char cmd[5];

psychicalcoder

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
priority_queue<LL, vector<LL>, greater<LL> > q;
int main() {
    LL n, x;
    scanf("%lld", &n);
    for(int i = 0; i < n; i++) {
        scanf("%lld", &x);
        q.push(x);