Pagini recente » Diferente pentru problema/ecuatie intre reviziile 21 si 20 | Cod sursa (job #1163668) | Cod sursa (job #2253463) | Cod sursa (job #2757569) | Cod sursa (job #351628)
Cod sursa(job #351628)
#include <fstream>
using namespace std;
ifstream f ("cifra.in");
ofstream g ("cifra.out");
int t;
char n[1000], u[2];
int x;
int main()
{ f >> t;
for (int i=1; i<=t; i++)
{ f >> n;
if (n[strlen(n)-1]=='1')
x+=1;
else if (n[strlen(n)-1]=='2')
x+=4;
else if ( n[strlen(n)-1]=='3')
x+=7;
else if (n[strlen(n)-1]=='4')
x+=6;
else if (n[strlen(n)-1]=='5')
x+=5;
else if (n[strlen(n)-1]=='6')
x+=6;
else if (n[strlen(n)-1]=='7')
x+=3;
else if (n[strlen(n)-1]=='8')
x+=6;
else if (n[strlen(n)-1]=='9')
x+=1;
g << x%10 << "\n";
}
return 0;
}