Pagini recente » Cod sursa (job #2846078) | Cod sursa (job #1382997) | Cod sursa (job #2813460) | Cod sursa (job #2941694) | Cod sursa (job #291323)
Cod sursa(job #291323)
#include<fstream.h>
#include<string.h>
#define N 1000000000
using namespace std;
char sir[N];
int unu[3] = {1,1};
int ok, nr[N];
unsigned long long d;
void add(int A[], int B[])
{
int i, t = 0;
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
A[i] = (t += A[i] + B[i]) % 10;
A[0] = i - 1;
}
int mod(int A[], int B)
{
int i, t = 0;
for (i = A[0]; i > 0; i--)
t = (t * 10 + A[i]) % B;
return t;
}
int main()
{
ifstream f("next.in");
ofstream g("next.out");
f.getline(sir, 999999999);
int lung = strlen(sir);
for(int i = 0; i < strlen(sir); i++)
nr[lung-i] = sir[i]-'0';
nr[0] = strlen(sir);
f>>d;
ok = 1;
while(ok)
{
if(mod(nr,d) == 0)
{
for(int i = 1; i <= nr[0]; i++)
g<<nr[i];
ok = 0;
}
else
add(nr,unu);
}
return 0;
}