Submission #499896

Source Code Expand

#include<iostream>
#include<cmath>
#include<vector>
using namespace std;

int main(void){
  string s;
  unsigned long long cnt = 0,n=0;
  cin>>s;
  if(s.size() == 1){
  	if(s=="0")cout<<0<<endl;
  	else cout<<1<<endl;
    return 0;
  }
  vector<int> vi,ni;
  vi.push_back(10);
  ni.push_back(1);
  for(int i = 2 ; i < 10 ; i ++){
  	ni.push_back(i * pow(10,i-1));
  	vi.push_back(pow(10,i));
  }
  for(int i = 0 ; i < s.size() ; i ++)n = n * 10 + s[i] - '0';
  for(int i = 0 ; i < s.size()-1 ; i ++){
    if(s[i]=='1'){
      cnt += s[i+1] - '0'+1 + ni[s.size()-i-2];
    }else{
      cnt += ni[s.size()-i-2] * (s[i]-'0') + vi[s.size()-i-2];
      //cout<<s.size()-i-2<<" "<<cnt<<" "<<s[i]<<endl;
    }
  }
  if(s[s.size()-1]>'1')cnt++;
  cout<<cnt<<endl;

}

Submission Info

Submission Time
Task D - 1
User SIMrit
Language C++ (GCC 4.9.2)
Score 0
Code Size 793 Byte
Status WA
Exec Time 34 ms
Memory 928 KiB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 20 0 / 80
Status
AC × 3
AC × 14
WA × 8
AC × 22
WA × 21
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask0_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, subtask1_20.txt
Subtask2 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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, subtask1_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, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt, subtask2_33.txt, subtask2_34.txt, subtask2_35.txt, subtask2_36.txt, subtask2_37.txt, subtask2_38.txt, subtask2_39.txt, subtask2_40.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 26 ms 800 KiB
subtask0_sample_02.txt AC 26 ms 796 KiB
subtask0_sample_03.txt AC 31 ms 844 KiB
subtask1_01.txt AC 28 ms 800 KiB
subtask1_02.txt AC 28 ms 924 KiB
subtask1_03.txt AC 27 ms 800 KiB
subtask1_04.txt AC 28 ms 928 KiB
subtask1_05.txt WA 26 ms 920 KiB
subtask1_06.txt AC 26 ms 792 KiB
subtask1_07.txt WA 27 ms 676 KiB
subtask1_08.txt WA 28 ms 928 KiB
subtask1_09.txt WA 27 ms 916 KiB
subtask1_10.txt AC 26 ms 800 KiB
subtask1_11.txt WA 27 ms 800 KiB
subtask1_12.txt AC 25 ms 800 KiB
subtask1_13.txt WA 25 ms 924 KiB
subtask1_14.txt AC 26 ms 924 KiB
subtask1_15.txt AC 26 ms 796 KiB
subtask1_16.txt AC 27 ms 796 KiB
subtask1_17.txt AC 26 ms 916 KiB
subtask1_18.txt AC 26 ms 804 KiB
subtask1_19.txt WA 27 ms 796 KiB
subtask1_20.txt WA 27 ms 800 KiB
subtask2_21.txt WA 26 ms 736 KiB
subtask2_22.txt AC 26 ms 796 KiB
subtask2_23.txt WA 34 ms 800 KiB
subtask2_24.txt WA 26 ms 808 KiB
subtask2_25.txt WA 26 ms 804 KiB
subtask2_26.txt AC 27 ms 676 KiB
subtask2_27.txt WA 26 ms 808 KiB
subtask2_28.txt AC 26 ms 800 KiB
subtask2_29.txt WA 26 ms 808 KiB
subtask2_30.txt AC 24 ms 740 KiB
subtask2_31.txt AC 26 ms 808 KiB
subtask2_32.txt WA 28 ms 804 KiB
subtask2_33.txt WA 28 ms 928 KiB
subtask2_34.txt AC 25 ms 920 KiB
subtask2_35.txt WA 26 ms 792 KiB
subtask2_36.txt WA 26 ms 920 KiB
subtask2_37.txt WA 26 ms 804 KiB
subtask2_38.txt WA 26 ms 924 KiB
subtask2_39.txt WA 26 ms 804 KiB
subtask2_40.txt AC 26 ms 796 KiB