Pagini recente » Cod sursa (job #2493852) | Cod sursa (job #2985056) | Cod sursa (job #2544746) | fmi-no-stress-9/solutii | Cod sursa (job #160238)
Cod sursa(job #160238)
#include<fstream>
using namespace std;
int n[100005];
int main()
{
int t,m,cif=0,i,j;
char c;
ifstream fin("cifra.in");
fin>>t;
for(i=1;i<=t;i++)
{
m=0;
//fin.get(c);
//while(c!=' ')fin>>n[++m];
fin>>n[1];
m=1;
for(i=m;i>=1;i--)
{
if(n[1]==0&&n[2]>0)
{
n[1]=9;
for(j=1;j<m&&n[j]==0;j++)
n[j]=9,n[j+1]--;
}
cif=cif+n[1]*n[1];
n[1]--;
if(cif>9)cif=cif%10;
}
}
fin.close();
ofstream fout("cifra.out");
fout<<cif;
fout.close();
return 0;
}