Codigos C++ titancod.net

CÓDIGOS TITANCOD

Hallar Duplicados

#include <bits/stdc++.h>

using namespace std;

int main()

{

pair<long long, long long> a;

cin >> a.first;

for(a.second=0; a.second<a.first; ++a.second) {

long long n;

cin >> n;

vector<long long> a(n, -5);

for(int i=0; i<n; ++i) {

cin >> a[i];

}

sort(a.begin(), a.begin()+n);

vector<long long> b(n, -1);

bool l=true;

long long cont=0, posicion=0, q=0, aux=0, v=0;

while(l==true) {

cont=0;

while(posicion<n) {

if(a[q]==a[posicion]) {

++cont;

++posicion;

}

else break;

}

if(cont>=2) {b[v]=a[q]; ++v;}

q=posicion;

if(posicion==n) {l=false;}

}

long long m=0;

while(m<v) {

cout << b[m];

++m;

if(m==v) cout << endl;

else cout << " ";

}

}

return 0;

}

#include <iostream>

#include <map>

using namespace std;

int main()

{

long long c, l;

map<long long, long long> mp;

cin >> c;

while(c--)

{

int num, var; //Cantidad de digitos

cin >> num;

var=num;

while(num--)

{

cin >> l;

mp[l]++;

}

map<long long,long long>::iterator k;

for(k=mp.begin();k!=mp.end();++k){

///cout<< (k->first) <<" "<< (k->second) ;

if((k->second)>=2) cout<<(k->first)<<endl;

}

return 0;

}

}

Hay Fraude

#include <iostream>

using namespace std;

int main()

{

int casos=0;

cin>>casos;

while(casos--){

string a,b;

cin>>a>>b;

for(long long int i=0;i<(int)b.length();i++){

b[i]=b[i]+16;

}

if(a.find(b)!=string::npos) cout<<"FRAUDE"<<endl;

else cout<<"NO HAY FRAUDE"<<endl;

...