The Last Digit problem?

[chandan_google]

well anybody pls tell how to submit a solution to this problem spoj.pl/problems/LASTDIG/

[TripleM_sof]

You can't. For some reason the problem author hasn't enabled submissions.

[chandan_google]

following is my solution to the lastdigit problem but i am getting WA any hints:

i am sorry that was a silly mistake

[koolman]

Hi,
Thanks Hidalgo....Got AC...I did a small mistake in doing division....never mind...
thanks again...

[Saul_Hidalgo]

Hi koolman.

I can't understand your code . The function "ef" i think that is an "if". But some test case no matching with my answer.

My sample input

5
2 10
2 100
3 100
3 123
10 101231321

Your output

4
2
3
1
0

The correct Output

4
6
1
7
0

[smaagesh]

can anyone mail wats wrong in this code...
problem code:LASTDIG
mail id :smaagesh@gmail.com

include

include

int answ(unsigned long long int,int);
int main()
{
int no,i,ans[30],a,c,a1;
unsigned long long int b;
scanf("%d",&no);
for(i=0;i {
scanf("%d %llu",&a,&b);
if(a==0||a==10||a==20||a==5||a==15||a==1||a==11||a==6||a==16)
{
ans[i]=a%10;
}
else
{
a1=a%10;
ans[i]=answ(b,a1);
}
}
for(i=0;i printf("\n%d",ans[i]);
return 0;
}
answ(unsigned long long int q,int no)
{
int d,e,c,an;
if(no!=4||no!=9)
{
c=q%4;
if(c==0)
c=c+4;
}
else
{
c=q%2;
if(c==0)
return no;
else
return ((no*no)%10);
}
d=pow(no,c);
e=pow(10,c);
an= d%e;
return (an%10);
}

[thevenom]

Please tell me whats wrong in this code. Please give me one case where this fails so that I can correct it........

//LastDig.c
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
	{
	int c[10]={1, 1, 4, 4, 2, 1, 1, 4, 4, 2};
	long i, *ptr, lstBase, ex, base, power;
	int n;
	scanf("%d", &n);
	ptr=(long*)malloc(2*n*sizeof(long));
	for(i=0 ; i<2*n ; i++)
		scanf("%ld", ptr+i);
	for(i=0 ; i<2*n ; i+=2)
		{
		base=*(ptr+i);
		power=*(ptr+i+1);
		if(base==0 && power==0)
			{
			printf("1");
			continue;
			}
		lstBase=base%10;
		ex=power%c[lstBase];
		if(lstBase==0)
			printf("0");
		else
			{
			if(ex==0)
				printf("%ld\n", ((long)pow(lstBase, c[lstBase]))%10);
			else
				printf("%ld\n", ((long)pow(lstBase, ex))%10);
			}
		}
	return 0;
	}

[AppleX]

Fails most obvious boundry case!

[drewsalt]

huh? What case is that? The error I get is source is larger than 700 bytes.

[AppleX]

Just like each problem has a time limit, it also has a source limit stated.

[color=#804040]---------------------------------------------------------
Added by: Jose Daniel Rdguez
Date: 2008-12-01
Time limit: 1s
Source limit: 700B
Languages: All
Resource: Mine
---------------------------------------------------------[/color]

The source limit for this problem is 700B which means that your source file size should not be more than 700 bytes. If it exceeds this limit your program will be rejected without even compilation.

So first you need to reduce your source file size.

TIP: Either reduce your code or remove all formatting, spaces etc.

Once you successfully do that your source will be compiled and run. Only then will you know whether it is ACed or not.

However i expect the judge to give WA because as i said earlier your code fails the most obvious boundry case.

I hope that may help!

[tm1138]

hi all, i have been trying to get AC with the below code. For me, test cases are working fine. But spoj says wrong answer. please help me with this

using namespace std;
long stoint (string &s){
long val= 0, i = 0;
while (s[i] != '\0'){
val = val * 10 + (s[i] - 48);
i ++;}
return val;}

int main(){
string s;
int n, i = 0, j = 0;
long b[2][30], temp, val, out;
getline (cin, s);
n = stoint (s);
while (i < n){
getline (cin, s, ' ');
b[0][i] = stoint (s);
getline (cin, s);
b[1][i ++] = stoint (s);}
i = 0;
while (i<n){
j = 1;
temp=b[1][i]%4;
val=b[0][i]%10;
out=val;
if(temp==0)
temp=4;
while(j<temp){
out *= val;j++;}
cout<<out%10<<endl;
i ++;}
return 0;
}