Pagini recente » Cod sursa (job #3133431) | Cod sursa (job #3177815) | Cod sursa (job #2176120) | Cod sursa (job #235403) | Cod sursa (job #712785)
Cod sursa(job #712785)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
short a[250000000];
long long nr,op,q;
long n,i;
int main()
{f>>n;
for(i=1;i<=n;i++)
{f>>op>>nr;
if(op==1)
{if(nr<=250000000)
a[nr]=a[nr]+1;
if( nr>250000000 && nr<=500000000 )
a[nr-250000000]=a[nr-250000000]+10;
if(nr>500000000 && nr<=750000000)
a[nr-500000000]=a[nr-500000000]+100;
if(nr>750000000 && nr<=1000000000)
a[nr-750000000]=a[nr-750000000]+1000;
}
if(op==2)
{if(nr<=250000000)
a[nr]=a[nr]-1;
if( nr>250000000 && nr<=500000000 )
a[nr-250000000]=a[nr-250000000]-10;
if(nr>500000000 && nr<=750000000)
a[nr-500000000]=a[nr-500000000]-100;
if(nr>750000000 && nr<=1000000000)
a[nr-750000000]=a[nr-750000000]-1000;
}
if(op==3)
{if(nr<=250000000)
g<<a[nr]%10<<'\n';
if( nr>250000000 && nr<=500000000 )
g<<(a[nr-250000000]/10)%10<<'\n';
if(nr>500000000 && nr<=750000000)
g<<(a[nr-500000000]/100)%10<<'\n';
if(nr>750000000 && nr<=1000000000)
g<<(a[nr-750000000])/1000<<'\n';
}
}
}