Cod sursa(job #2454953)

Utilizator cristi1990anCornea Cristian cristi1990an Data 10 septembrie 2019 15:36:47
Problema Cifra Scor 60
Compilator c-64 Status done
Runda Arhiva de probleme Marime 1.59 kb
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

unsigned int cifra(unsigned int n)
{
	unsigned int m = n % 10;

	switch (m)
	{
	case 0: return 0; 
	case 1: return 1;
	case 2: 
	{
		switch (n % 4)
		{
		case 0: return 6;
		case 1: return 2;
		case 2: return 4;
		case 3: return 8;
		}
	}
	case 3:
	{
		switch (n % 4)
		{
		case 0: return 1;
		case 1: return 3;
		case 2: return 9;
		case 3: return 7;
		}
	}
	case 4:
	{
		switch (n % 2)
		{
		case 0: return 6;
		case 1: return 4;
		}
	}
	case 5: return 5;
	case 6: return 6;
	case 7: 
		switch (n % 4)
		{
		case 0: return 1;
		case 1: return 7;
		case 2: return 9;
		case 3: return 3;
		}
	case 8:
		switch (n % 4)
		{
		case 0: return 6;
		case 1: return 8;
		case 2: return 4;
		case 3: return 2;
		}
	case 9:
		switch (n % 2)
		{
		case 0: return 1;
		case 1: return 9;
		}

	}
	return 0;
}

int main()
{
	unsigned int T, v[99999], t[99999], max=0, min=0, aux;
	unsigned char c[2];
	FILE* f = fopen("cifra.in", "r"), *g = fopen("cifra.out", "a");;
	fscanf(f, "%u", &T);

	c[0] = '0';
	v[0] = 0;
	c[1] = fgetc(f);

	for (unsigned int i = 1; i <= T; i++)
	{
		t[i] = 0;
		do
		{
			c[1] = fgetc(f); 

			if ((c[1] == '\n')||(c[1]>'9'))
				break;

			sscanf(c, "%u", &aux);

			t[i] = (t[i] * 10 + aux) % 100;

		} while (1);
			
		if (max < t[i])
		{
			max = t[i];

			for (unsigned int j = min+1; j<=max; j++)
				v[j] = (v[j - 1] + cifra(j)) % 10;

			min = max;
		}

		fprintf(g, "%u\n", v[t[i]]);
		fflush(stdout);
	}

	fclose(f);
	fclose(g);
	
	return 0;
}