Cod sursa(job #1220626)

Utilizator cojocarugabiReality cojocarugabi Data 17 august 2014 22:33:29
Problema Dtcsu Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.93 kb
# include <fstream>
# include <iostream>
# include <cstring>
# define mod 9001
using namespace std;
ifstream fi("dtcsu.in");
ofstream fo("dtcsu.out");
const int numbers=276998;
typedef struct node
{
    long long x;
    node *next;
} *nod;
nod S[mod];
char c[20];
bool find(long long x)
{
    int m=x%mod;
    for (nod p=S[m];p;p=p->next)
        if (p->x==x) return 1;
    return 0;
}
int main(void)
{
    for (int i=1;i<=numbers;++i)
    {
        fi>>c;
        int k=strlen(c);
        long long p=0;
        for (int i=0;i<k;++i) p=(p*10)+c[i]-'0';
        nod q=new node;
        q->x=p;q->next=S[p%mod];S[p%mod]=q;
    }
    int n;fi>>n;
    int F=0;
    for (int i=1;i<=n;++i)
    {
        fi>>c;
        int k=strlen(c);
        while (c[k]<'0' || c[k]>'9') --k;
        long long p=0;
        for (int i=0;i<k;++i) p=(p*10)+c[i]-'0';
        F+=find(p);
    }
    fo<<F<<"\n";
    return 0;
}