Pagini recente » Cod sursa (job #890898) | Cod sursa (job #2587135) | Cod sursa (job #167697) | Cod sursa (job #3220242) | Cod sursa (job #1056127)
#include<iostream>
#include<fstream>
using namespace std;
ofstream g("progresie.out");
void prod(int v[], int &nr, int v2[], int n)
{
int i,j,c,r,a[10000],poz;
for (i=1; i<=nr; i++) a[i]=0;
for (i=1; i<=n; i++)
for (j=1; j<=nr; j++)
a[j+i-1]=a[j+i-1]+v[j]*v2[i];
r=0;
for (i=1; i<=nr+n; i++)
{
a[i]=a[i]+r;
r=a[i]/10;
a[i]=a[i]%10;
}
nr=nr+n;
while (a[nr]==0) nr--;
for (i=nr; i>=1; i--) g<<a[i];
g<<"\n";
}
int main()
{
int n,i,j,t,v[100000],v2[10000],nv,nv2;
unsigned long long r,q;
ifstream f("progresie.in");
f>>t;
for (i=1; i<=t; i++)
{
f>>n>>r;
q=(n-1)*r;
int q2=q+1;
nv2=nv=0;
while (q>0)
{
++nv2;
v2[nv2]=q%10;
q=q/10;
}
while (q2>0)
{
++nv;
v[nv]=q2%10;
q2=q2/10;
}
prod(v,nv,v2,nv2);
}
return 0;
}