Pagini recente » Cod sursa (job #1914557) | Cod sursa (job #3161760) | Cod sursa (job #1940308) | Cod sursa (job #2690107) | Cod sursa (job #991972)
Cod sursa(job #991972)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
void show(long long int *al);
void inm(long long int* al, long long int* bl, long long int* dl);
void transforma(long long int sos, long long int* al);
void fshow(long long int *al);
void fact(long long int n, long long int* al);
ifstream fin ("next.in");
ofstream fout("next.out");
#define MAX 1000002
long long int i,s,m,a1,t,j,l,d,k,ci;
char n[MAX];
long long int a[MAX],b[20],c[MAX],ab[MAX];
void inm(long long int* al, long long int* bl, long long int* cl)
{
cl[0]=al[0]+bl[0]-1;
for(i=1;i<=al[0];i++)
{
for(j=1;j<=bl[0];j++)
{
cl[i-1+j]+=al[i]*bl[j];
}
}
for(i=1;i<=cl[0];i++)
{
if(cl[i]>9)
{
cl[i+1]+=cl[i]/10;
cl[i]%=10;
}
}
if(cl[i])
cl[0]++;
}
void transforma(long long int sos, long long int* al)
{
long long int k=0;
while(sos)
{
al[++k]=sos%10;
sos/=10;
}
al[0]=k;
}
void show(long long int *al)
{
for(i=al[0];i>=1;i--)
{
cout<<al[i];
}
}
void fshow(long long int *al)
{
for(i=al[0];i>=1;i--)
{
fout<<al[i];
}
}
void fact(long long int n, long long int* al)
{
al[0]=al[1]=1;
for(k=2;k<=n;k++)
{
long long int par[4];
ci=k;
transforma(ci,par);
inm(par, al, al);
}
}
void imp(long long int* al,long long int d, long long int* cl)
{
long long int p=0;
for(i=al[0];i>=1;i--)
{
al[i]+=p;
cl[i]=al[i]/d;
p=al[i]-cl[i];
p*=10;
}
for(i=al[0];cl[i]==0;i--);
cl[0]=i;
}
void add1(long long int* cl)
{
i=1;
cl[i]++;
while(cl[i]==10)
{
cl[i]=0;
i++;
cl[i]++;
}
if(cl[cl[0]+1])
cl[0]++;
}
int main()
{
fin>>n;
a[0]=strlen(n);
for(i=1;i<=a[0];i++)
{
a[i]=n[a[0]-i]-'0';
}
fin>>d;
imp(a,d,c);
add1(c);
transforma(d,b);
inm(b,c,ab);
fshow(ab);
return 0;
}