AntonieValentin

#include <bits/stdc++.h>
 
using namespace std;
 
int n,mr,i,x,m[2001],j,ok,indice;
queue <int> Q;
long long suma;
pair<int,int> v[101];
 
int main()

AntonieValentin

#include <bits/stdc++.h>
 
using namespace std;
 
struct elem{
    int puncte,pr,indice;
}total[2001];
 
bool cmp(elem A, elem B){
    if(A.puncte == B.puncte){

AntonieValentin

#include "grader.h"
#include "memory.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
void play() {
    int ap[100], path[100], path2[100];
    for(int i=1;i<=50;i++){
        char x = faceup(i);
        if(ap[x] > 3)

AntonieValentin

#include "grader.h"
#include "cluedo.h"
 
 
void Solve(){
   int r, a = 1, b = 1, c= 1;
   r = Theory(a,b,c);
   while(r){
   while(r == 1){
   a++;

AntonieValentin

#include <bits/stdc++.h>
using namespace std;


int n,x,i,ant[1000005],j,k,marime,a[5000005];
bool mark[1000005];
pair<int,int> v[1000005];
long long nr;

AntonieValentin

#include <bits/stdc++.h>
 
using namespace std;
 
int put2,put5,Max2,Max3;
long long a,b,i,x,coef;
 
int main()
{
ios_base::sync_with_stdio(false);

AntonieValentin

#include <bits/stdc++.h>
 
using namespace std;
 
int n,v[100005],i,p;
long long val,dp[100005],sum;
 
int main()
{
ios_base::sync_with_stdio(false);

AntonieValentin

#include <bits/stdc++.h>

using namespace std;

int n,k,q,i,j,st,dr,m,lungime,indici[15];
long long v[100001],sum,suma1[100001],suma2[100001],suma3[100001],x,sum1,sum2,sum3,nr,element,j2,element2,nr2;

void update1(int x, long long y){
for(j=x;j<=n;j+=(j&-j)){
    suma1[j] += y;

AntonieValentin

#include <bits/stdc++.h>
#define mod 1000000007
 
using namespace std;
 
stack <pair<int,int>> S,S2;
int n,v[100005],i,dr[100005],st[100005],x,Max,st2[100005];
long long suma[100001],total1,val1, val2,total2,nr;
pair <int,int > sor[100005];