제출 #5731

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
5731	2014-05-14 14:54:24	model_code	관대한 주인 (TOKI14_generous)	C++98	100 / 100	100 ms	1088 KiB

generous

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/*
 * Official Solution
 * 
 * Generous Butcher
 * William Gozali
 */
#include <cstdio>
#define LL long long
using namespace std;
LL A, B, K1, K2;
LL pouw(LL a, LL b, LL c){
  if (b == 0) return 1;
  if (b & 1) return (a * pouw(a,b-1,c)) % c;
  LL t = pouw(a, b/2, c);
  return (t * t) % c;
}
int main()
{
  scanf("%lld %lld %lld %lld", &A, &B, &K1, &K2);
  A %= B; 
  for (LL i = K1; i <= K2; i++){  
    LL x = (A * pouw(10, i-1, B)) % B;
    printf("%lld", (x*10)/B);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 23 / 23
• Subtask 5: 12 / 12