Submission #1896887
Source Code Expand
#include<cstdio> #include<cstring> #include<iostream> #include<string> #include<map> #include<vector> #include<queue> #include<set> #include<sstream> #include<cmath> #include<algorithm> using namespace std; typedef long long ll; const int N=2000+10,INF=0x3f3f3f3f,dx[]={1,1},dy[]={-1,1}; int a,b,n; int main() { while(~scanf("%d%d%d",&n,&a,&b)){ int sum=0; for(int i=1;i<=n;i++){ int x=i,sam=0; while(x){ sam+=(x%10); x/=10; } if(sam>=a&&sam<=b){ sum+=i; } } printf("%d\n",sum); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Some Sums |
User | zwu2016011052 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 684 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |