1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n,m,a[1000005],ans; void f() { a[0]=a[1]=1; for(int i=2;i*i<=1000000;i++) if(a[i]==0) for(int j=i*i;j<=1000000;j+=i) a[j]=1; } int ws(int x) { int k=1; for(int i=x;i>9;i/=10) k*=10; return k; } int main() { // freopen("5.in","r",stdin); // freopen("5.out","w",stdout); f(); cin>>n>>m; if(n>m) swap(n,m); for(int i=n;i<=m;i++) { int t1=i/10; int k=ws(t1); int t2=t1%k; if(a[t2]==0) {ans++;} } cout<<ans; return 0; }
- 1
Information
- ID
- 1025
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- (None)
- # Submissions
- 2
- Accepted
- 2
- Uploaded By