1 solutions
-
0
C :
#include<stdio.h> #include<math.h> int main() { int i,a,b,c,m,n,d,s=0,e,f=0; scanf("%d%d",&m,&n); for(i=m;i<=n;i++) { a=i; c=-1; while(a>0) { c++; a=a/10; } a=i; d=0; for(b=c;b>=0;b--) { e=a%10; a=a/10; d+=e*pow(10,b); } if(d==i&&i%2==0){ f+=i; s++; } } printf("%d\n%d",s,f); return 0; }
C++ :
#include <iostream> using namespace std; int main(){ int m,n,c=0,i,s=0; cin>>m>>n; for(i=m;i<=n;i++){ if(i/10000==i%10&&i/1000%10==i/10%10&&i%2==0){ // cout<<i<<endl; c++; s+=i; } } cout<<c<<endl; cout<<s<<endl; }
Java :
import java.util.Scanner; public class Main{ public static void main(String[] agrs){ Scanner sc = new Scanner(System.in); int m = sc.nextInt(); int n = sc.nextInt(); int num = 0; int s = 0; for(int i = m;i <= n;i++){ if((i / 10000 == i % 10) && (i % 2 == 0) && (i / 1000 % 10 == i / 10 % 10)){ num++; s = s + i; } } System.out.println(num); System.out.println(s); } }
Python :
a = input().split() m = int(a[0]) n = int(a[1]) c = 0 su = 0 for i in range(m, n + 1): w = i // 10000 % 10 q = i // 1000 % 10 b = i // 100 % 10 s = i // 10 % 10 g = i // 1 % 10 if w == g and q == s and i % 2 == 0: c += 1 su += i print(c) print(su)
- 1
Information
- ID
- 10515
- Time
- 1000ms
- Memory
- 64MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By