Submission details
Task:ModAdd
Sender:idan
Submission time:2016-09-24 15:17:07 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.06 sdetails
#20.16 sdetails
#30.15 sdetails
#40.15 sdetails
#50.14 sdetails
#60.14 sdetails
#70.14 sdetails
#80.14 sdetails
#90.14 sdetails
#100.14 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:52:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", numA);
                   ^
input/code.cpp:53:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", numB);
                   ^

Code

/*********************************
* Class: MAGSHIMIM C2			 *
* Week 1               			 *
**********************************/

#include <stdio.h>
#include <math.h>
#include <string.h>


//Strrev not working for some reason < copied code.
void reverse_string(char *str)
{

	if (str == 0)
	{
		return;
	}

	if (*str == 0)
	{
		return;
	}

	/* get range */
	char *start = str;
	char *end = start + strlen(str) - 1; /* -1 for \0 */
	char temp;

	/* reverse */
	while (end > start)
	{
		/* swap */
		temp = *start;
		*start = *end;
		*end = temp;

		/* move */
		++start;
		--end;
	}
}


int main(void)
{
	int i = 0, currentAlsd = 0, currentBlsd = 0, currentDigit = 0;
	char numA[100000] = { 0 };
	char numB[100000] = { 0 };
	char result[100000] = { 0 };

	scanf("%s", numA);
	scanf("%s", numB);

	int aIndex = strlen(numA) - 1;
	int bIndex = strlen(numB) - 1;
	int maxLength = strlen(numA) > strlen(numB) ? strlen(numA) : strlen(numB);

	//printf("MaxLength : %d", maxLength);
	//system("pause");

	for (i = 0; i < maxLength; i++)
	{
		currentAlsd = aIndex < 0 ? 0 : numA[aIndex--] - '0';
		currentBlsd = bIndex < 0 ? 0 : numB[bIndex--] - '0';
		currentDigit = (currentAlsd + currentBlsd) % 10;
		result[i] = currentDigit + '0';
		//puts(result);
		//printf("iteration %d : A lsd: %d B lsd: %d", i, currentAlsd, currentBlsd);

	}
	//puts(result);
	reverse_string(result);
	puts(result);

	//system("Pause");

}

Test details

Test 1

Verdict: ACCEPTED

input
3797629225
9766508989

correct output
2453127104

user output
2453127104

Test 2

Verdict:

input
552139016901047883384892240490...

correct output
552139016901047883384892240490...

user output
(empty)

Test 3

Verdict:

input
860793811134668093345482099582...

correct output
487710306894083216377653715430...

user output
(empty)

Test 4

Verdict:

input
2
870841652294197226626825161089...

correct output
870841652294197226626825161089...

user output
(empty)

Test 5

Verdict:

input
0
404905566051213252279994991040...

correct output
404905566051213252279994991040...

user output
(empty)

Test 6

Verdict:

input
430112167406460960088878635088...

correct output
430112167406460960088878635088...

user output
(empty)

Test 7

Verdict:

input
867016005819001635643395991596...

correct output
999999999999999999999999999999...

user output
(empty)

Test 8

Verdict:

input
120453771521975552204976752778...

correct output
0

user output
(empty)

Test 9

Verdict:

input
239979749009277805816504910098...

correct output
239979749009277805816504910098...

user output
(empty)

Test 10

Verdict:

input
990963963634143754324162574923...

correct output
818540385713473048971388312665...

user output
(empty)