Cod sursa(job #2042481)
| Utilizator | Data | 18 octombrie 2017 18:25:20 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <unordered_set>
using namespace std;
unordered_set <int> s;
int main() {
int n, nr, ver;
FILE *fin, *fout;
fin = fopen( "hashuri.in", "r" );
fout = fopen( "hashuri.out", "w" );
fscanf( fin, "%d", &n );
for ( int i = 0; i < n; i++ ) {
fscanf( fin, "%d%d", &ver, &nr );
if ( ver == 1 )
s.insert( nr );
else if ( ver == 2 )
s.erase( nr );
else
fprintf( fout, "%d\n", s.find( nr ) != s.end() );
}
fclose( fin );
fclose( fout );
return 0;
}
