function DifNum(a: integer): integer; var se: set of integer; i: integer; begin while a > 0 do begin if a mod 10 in se then begin DifNum := 0; exit; end else include(se, a mod 10); a := a div 10; end; DifNum := 1; end;
begin read(l, r); for i := l to r do counter += DifNum(i); writeln(counter); end.
//Альтернативное решение на Паскале
Var l,r:integer; begin read(l,r); writeln(range(l,r).where(x -> x.tostring.toarray.distinct.count=length(x.tostring)).Count); end.
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
ll find_sum(vector<vector<ll>> a){
ll sum = 0;
for(ll i = 0; i < a.size(); i++)
for(ll j = 0; j < a[i].size(); j++)
if(i == j)
sum += a[i][j];
return sum;
}
signed main(){
ll n,m;
cin >> n >> m;
vector<vector<ll>> a(n);
for(ll i = 0; i < n; i++){
vector<ll> temp(m);
for(ll j = 0; j < m; j++)
cin >> temp[j];
a[i] = temp;
}
cout << find_sum(a);
}