11547 Not understand the algorithm

[noor_aub]

I have made this code according to this problem set but the output is not coming.
Some body help me.

Code: Select all

#include<iostream>
using namespace std;

int main()
{
   _int64 re;
   int cas,number;
   cin>>cas;
   while(cas--)
   {
      cin>>number;
      re=0;
      re=(_int64)((((((number*567)/9)+7492)*235)/47)-498);
      printf("%I64d",re);

   }
   return 0;
}


[sms.islam]

Read the problem description carefully.

After getting re=12345678 (imagine)
you have to show 7

more:
98745>4
2587416>1

hope it helps.

[noor_aub]

Still I dont unser stand the algorithm. Please tell me in details.

[Eather]

I did this and I got AC

Code: Select all

#include<stdio.h>
#include<math.h>
#include<iostream>
using namespace std;

int main()
{
long long int n,t,i,j,res;

   while((scanf("%ld",&i))==1&& i>0)
   {
      for(j=0;j<i;j++)
      {
      scanf("%ld",&n);
      res = ((((((n*567)/9)+7492)*235)/47)-498);
        if (res<0)
         res = -res;
        long long t = ((res%100)-(res%10))/10;
        printf("%ld\n", t);
      }
   }
   return 0;
}[

[mahi_seu.bd]

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
int n,t,i,p,k;
scanf("%d",&t);
for(i=1;i<=t;i++){
k=0;p=0;
scanf("%d",&n);
p=((((((n*567)/9)+7492)*235)/47)-498);
if(p<0)
p*=-1;
k=(p/10)%10;
printf("%d\n",k);
}return 0;
}