int c=0;
for(int i=0; i<=n; i++)
{
int num=i;
int sum=0;
while (num != 0)
{
int r = num % 10;
sum = sum + r;
num = num / 10;
}
if (sum%2 == 0)
c++;
}
return c;
Java
Sherlock code
Telegram:
https://t.me/Coding_solution_0
for(int i=0; i<=n; i++)
{
int num=i;
int sum=0;
while (num != 0)
{
int r = num % 10;
sum = sum + r;
num = num / 10;
}
if (sum%2 == 0)
c++;
}
return c;
Java
Sherlock code
Telegram:
https://t.me/Coding_solution_0
🔊🔊🔊FREE FREE FREE 🔊🔊🔊
♦️♦️ Next IRA will be live in this channel on 3rd January for free ♦️♦️
https://t.me/Coding_solution_0
✅✅JAVA / PYTHON ✅✅✅
Get solution 5 min prior then other groups premium plan limited seats available.
@saviour_01
🔰🔰
♦️♦️ Next IRA will be live in this channel on 3rd January for free ♦️♦️
https://t.me/Coding_solution_0
✅✅JAVA / PYTHON ✅✅✅
@saviour_01
🔰🔰
Forwarded from Coding Solutions Group
Please open Telegram to view this post
VIEW IN TELEGRAM
Forwarded from Off Campus job Updates- Placement Material
Zoho Placement Paper (1).pdf
454.2 KB
Get Our Premium Plan ZOHO EXAM 100% clearance gaurantee ping here
@saviour_01
@saviour_01
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 998244353
#define add(x,y) ((x+y)%MOD)
#define mul(x,y) ((x*y)%MOD)
#define sub(x,y) ((MOD+x-y)%MOD)
ll fastpow(ll x, ll y){
ll temp = 1;
while(y){
if(y&1)
temp = mul(temp, x);
x = mul(x, x);
y>>=1;
}
return temp;
}
ll inv(ll x){
return fastpow(x,MOD-2);
}
ll frac[200100];
ll C(ll n, ll i){
return mul(frac[n], inv(mul(frac[i], frac[n-i])));
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
if(k>=n){
cout<<0<<endl;
return 0;
}
ll ans = 0;
frac[0] = 1;
for(int i=1;i<=n;++i){
frac[i] = mul(i, frac[i-1]);
}
for(int i=0;i<=n-k;++i){
ll temp = mul(C(n-k,i), fastpow(n-k-i,n));
if(i&1)
ans = sub(ans, temp);
else
ans = add(ans,temp);
}
ans = mul(ans, C(n, n-k));
if(k)
ans = mul(ans, 2);
cout<<ans<<endl;
}
CHESS GAME CODE
Telegram - https://t.me/Coding_solution_0
using namespace std;
#define ll long long
#define MOD 998244353
#define add(x,y) ((x+y)%MOD)
#define mul(x,y) ((x*y)%MOD)
#define sub(x,y) ((MOD+x-y)%MOD)
ll fastpow(ll x, ll y){
ll temp = 1;
while(y){
if(y&1)
temp = mul(temp, x);
x = mul(x, x);
y>>=1;
}
return temp;
}
ll inv(ll x){
return fastpow(x,MOD-2);
}
ll frac[200100];
ll C(ll n, ll i){
return mul(frac[n], inv(mul(frac[i], frac[n-i])));
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
if(k>=n){
cout<<0<<endl;
return 0;
}
ll ans = 0;
frac[0] = 1;
for(int i=1;i<=n;++i){
frac[i] = mul(i, frac[i-1]);
}
for(int i=0;i<=n-k;++i){
ll temp = mul(C(n-k,i), fastpow(n-k-i,n));
if(i&1)
ans = sub(ans, temp);
else
ans = add(ans,temp);
}
ans = mul(ans, C(n, n-k));
if(k)
ans = mul(ans, 2);
cout<<ans<<endl;
}
CHESS GAME CODE
Telegram - https://t.me/Coding_solution_0