Pagini recente » Cod sursa (job #2709322) | Cod sursa (job #2444560) | Cod sursa (job #2661229) | Istoria paginii runda/7_martie_simulare_oji_2024_clasele_11_12/clasament | Cod sursa (job #1687472)
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("next.in");
ofstream out("next.out");
const int nmax=1000000;
int a[nmax];
int resth(int k)
{
int i;
long long r;
r=0;
for(i=a[0]; i>=1; i--)
{
r=(r*10)+a[i];
r=r%k;
}
return r;
}
int main()
{
long long k,rez;
int n,i,tr,aux;
char sir[nmax];
in.getline(sir,nmax);
n=strlen(sir);
for(i=n-1; i>=0; --i)
a[n-i]=sir[i]-'0';
a[0]=n;
in>>k;
rez=k-resth(k);
if(resth(k)==0)
{
for(i=a[0]; i>=1; i--)
out<<a[i];
return 0;
}
else
{
tr=0;
for(i=1; i<=a[0]; ++i)
{
aux=a[i]+(rez%10)+tr;
a[i]=aux%10;
tr=aux/10;
rez/=10;
}
if(tr==1)
{
a[++a[n+1]];
a[0]++;
}
for(i=a[0]; i>=1; --i)
out<<a[i];
}
return 0;
}