Submission #713314

Source Code Expand

 #include <string>
 #include <vector>
 #include <algorithm>
 #include <numeric>
 #include <set>
 #include <map>
 #include <queue>
 #include <iostream>
 #include <sstream>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <cctype>
 #include <cassert>
 #include <limits>
#define rep(i,n) for(long long (i)=0;(i)<(long long)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define PB push_back
using namespace std;
typedef vector<long long> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef map<int, int> mii;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main(){
  ll k,m,ans=0;
  cin >> k>>m;
  rer (i,1,m) {
    ll keta = 1;
    ll keta2 = 0;
    ll sum = 0;
    ll j=i;
    while(i >= keta){
      keta*=10;
      keta2++;
    }
    while(keta2 > 0) {
      keta/=10;
      keta2--;
      sum+= j/keta;
      j = j - (j/keta) * keta;
    }
    if (i%k==sum%k) {
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task D - 9
User akarii
Language C++14 (GCC 5.4.1)
Score 10
Code Size 1415 Byte
Status WA
Exec Time 2105 ms
Memory 256 KiB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 10 / 10 0 / 90
Status
AC × 2
WA × 1
TLE × 1
AC × 21
AC × 21
WA × 15
TLE × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt
Case Name Status Exec Time Memory
sample_01.txt AC 4 ms 256 KiB
sample_02.txt AC 9 ms 256 KiB
sample_03.txt WA 4 ms 256 KiB
sample_04.txt TLE 2105 ms 256 KiB
subtask1_01.txt AC 19 ms 256 KiB
subtask1_02.txt AC 12 ms 256 KiB
subtask1_03.txt AC 6 ms 256 KiB
subtask1_04.txt AC 8 ms 256 KiB
subtask1_05.txt AC 8 ms 256 KiB
subtask1_06.txt AC 15 ms 256 KiB
subtask1_07.txt AC 14 ms 256 KiB
subtask1_08.txt AC 5 ms 256 KiB
subtask1_09.txt AC 7 ms 256 KiB
subtask1_10.txt AC 16 ms 256 KiB
subtask1_11.txt AC 17 ms 256 KiB
subtask1_12.txt AC 17 ms 256 KiB
subtask1_13.txt AC 19 ms 256 KiB
subtask1_14.txt AC 14 ms 256 KiB
subtask1_15.txt AC 19 ms 256 KiB
subtask1_16.txt AC 14 ms 256 KiB
subtask1_17.txt AC 15 ms 256 KiB
subtask1_18.txt AC 19 ms 256 KiB
subtask1_19.txt AC 14 ms 256 KiB
subtask2_01.txt WA 4 ms 256 KiB
subtask2_02.txt TLE 2101 ms 256 KiB
subtask2_03.txt TLE 2101 ms 256 KiB
subtask2_04.txt TLE 2105 ms 256 KiB
subtask2_05.txt WA 4 ms 256 KiB
subtask2_06.txt WA 4 ms 256 KiB
subtask2_07.txt WA 4 ms 256 KiB
subtask2_08.txt TLE 2101 ms 256 KiB
subtask2_09.txt TLE 2105 ms 256 KiB
subtask2_10.txt TLE 2101 ms 256 KiB
subtask2_11.txt TLE 2105 ms 256 KiB
subtask2_12.txt TLE 2101 ms 256 KiB
subtask2_13.txt TLE 2105 ms 256 KiB
subtask2_14.txt TLE 2101 ms 256 KiB
subtask2_15.txt TLE 2101 ms 256 KiB
subtask2_16.txt WA 4 ms 256 KiB
subtask2_17.txt WA 4 ms 256 KiB
subtask2_18.txt WA 4 ms 256 KiB
subtask2_19.txt TLE 2101 ms 256 KiB
subtask2_20.txt WA 5 ms 256 KiB
subtask2_21.txt TLE 2105 ms 256 KiB
subtask2_22.txt TLE 2105 ms 256 KiB
subtask2_23.txt TLE 2101 ms 256 KiB
subtask2_24.txt WA 4 ms 256 KiB
subtask2_25.txt WA 4 ms 256 KiB
subtask2_26.txt WA 4 ms 256 KiB
subtask2_27.txt WA 4 ms 256 KiB
subtask2_28.txt WA 4 ms 256 KiB
subtask2_29.txt WA 4 ms 256 KiB