fa
Feedback

فریب کلاهبرداران را نخورید! تل‌متریو این کانال‌ها را شناسایی و برچسب‌گذاری می‌کند 👉 برای مشاهده برچسب، اشتراک تهیه کنید

Coding Solutions Group

Coding Solutions Group

رفتن به کانال در Telegram

نمایش بیشتر
الهنددسته بندی مشخص نشده است
2 051
مشترکین
اطلاعاتی وجود ندارد24 ساعت
اطلاعاتی وجود ندارد7 روز
اطلاعاتی وجود ندارد30 روز
آرشیو پست ها
Hi Chinna Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0
13 ژانویه 2022, 00:51

Hi Ramana Siddartha Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @placement_0 @placement_0
17 آوریل 2021, 04:18

1.Online part-time job intrest, best opportunity, every day we can earn money by doing work for just 15 minutes without investing and i am surety, i will give my number and everyday connected with me, 2.100% secure and i have been doing this for 2 months and trust is needed 3.platform name::Verizon media ,there is a whatsapp groups regarding work. 4.intrested candidates can text me, i will tell you process,Thank you
11 ژوئن 2021, 03:46

4
03 آوریل 2021, 00:19

I'm interested
01 آوریل 2021, 10:56

https://youtube.com/shorts /FV2Q5igezhI?feature=share
14 ژانویه 2023, 04:51

Coding Solution Available Here 📢 🚀🚀 https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0
18 فوریه 2022, 23:53

Repost from Jobs & Internships
🚀 𝗘𝘅𝗰𝗶𝘁𝗶𝗻𝗴 𝗢𝗽𝗽𝗼𝗿𝘁𝘂𝗻𝗶𝘁𝘆 𝗔𝗹𝗲𝗿𝘁 ! 🚀 𝐖𝐞 𝐚𝐫𝐞 𝐇𝐢𝐫𝐢𝐧𝐠 𝟏𝟎𝟎𝟎 𝐅𝐫𝐞𝐬𝐡𝐞𝐫 & 𝐄𝐱𝐩𝐞𝐫𝐢𝐞𝐧𝐜𝐞 𝐒𝐨𝐟𝐭𝐰𝐚𝐫𝐞 𝐃𝐞𝐯𝐞𝐥𝐨𝐩𝐞𝐫 🌟 Job Details: 🌐 Profile: Software Developer 💰 Package: Up to 20 LPA 🎓 Qualification: Any Graduation 📅 Passout Year: 2016 - 2024 🌍 Location: Pan India 📣 Test Date : 27 December Note: ✅💥 🎓 𝐋𝐢𝐦𝐢𝐭𝐞𝐝 𝐒𝐞𝐚𝐭𝐬! 𝐒𝐞𝐥𝐞𝐜𝐭𝐢𝐨𝐧 𝐨𝐧 𝐚 𝐅𝐢𝐫𝐬𝐭 𝐂𝐨𝐦𝐞 𝐅𝐢𝐫𝐬𝐭 𝐒𝐞𝐫𝐯𝐞 𝐁𝐚𝐬𝐢𝐬. 🔗 Apply now: https://tinyurl.com/4eujp433 𝐈𝐦𝐩 𝐍𝐨𝐭𝐞 -𝐑𝐞𝐠𝐢𝐬𝐭𝐫𝐚𝐭𝐢𝐨𝐧 𝐢𝐬 𝐌𝐚𝐧𝐝𝐚𝐭𝐨𝐫𝐲 𝐟𝐨𝐫 𝐓𝐞𝐬𝐭 𝐋𝐢𝐧𝐤 𝐃𝐨𝐧'𝐭 𝐦𝐢𝐬𝐬 𝐨𝐮𝐭 𝐨𝐧 𝐭𝐡𝐢𝐬 𝐢𝐧𝐜𝐫𝐞𝐝𝐢𝐛𝐥𝐞 𝐨𝐩𝐩𝐨𝐫𝐭𝐮𝐧𝐢𝐭𝐲! 🚀
18 دسامبر 2023, 06:20

Hi Chandu Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0
16 ژانویه 2022, 23:26

Crazy string #include<iostream> #include<cmath> using namespace std; int N, M, K; char str[11]; long long answer = 0; long long type[12];//It means that there are type[i] kinds of arrangement of i letters bool IsElegantPalideome()//Determine whether a string is a graceful palindrome { int subNum=0;//The number of palindrome strings in the substring for (int i = 0; i < N - M + 1; i++)//There are N-M+1 substrings, i represents the number of substrings { int flag = 1; for (int j = 0; j < M / 2; j++) { if (str[i + j] != str[i + M - 1 - j]) { flag = 0; break; } } if(flag) subNum++; } if (subNum >= K) return true; else return false; } void dfs(int len, int num)//len indicates the number of characters to be filled, num indicates that num letters have been used { if (len == 0)//No need to fill in characters { if (IsElegantPalideome())//This string is a beautiful palindrome { answer += type[num];//This mode meets the requirements. By replacing the string of this mode, there are a total of type[num] types } return; } else { for (int i = 0; i <= num; i++) { str[len - 1] = 'A' + i;//Use i to control the change of letters if (i == num)//A letter that was not used before appears dfs(len - 1, num + 1);//Number of characters used+1; else dfs(len - 1, num); } } } int main() { cin >> N >> M >> K; type[0] = 0, type[1] = 26; for (int i = 2; i < 12; i++) { type[i] = type[i - 1] * (27 - i); } dfs(N, 0); cout << answer; }
09 مه 2021, 00:01

Anyone
17 ژوئن 2023, 11:31

Plzzz
14 سپتامبر 2021, 07:23

Are wo idhr nahi daall question
04 مه 2021, 01:08

Yes
23 آوریل 2021, 10:48

Hi T Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @placement_0 @placement_0
18 آوریل 2021, 16:04

Today I have tech tammina exam at10:00 please help me coding
17 دسامبر 2021, 21:25

You are given two arrays A, B of length N and an integer denoting p which will be used for hashing. An array C is formed as follows: CF(a+b)%n. It is given that the length of C will be min(n.p). You can reorder one of the arrays A or 8 but not bo You want the array C to be lexicographically smallest Your task is to print the hash of the resulting array C
09 ژانویه 2022, 22:49

02 آوریل 2021, 07:54

n=int(input()) l=[int(input()) for i in range(n)] h=set(l) counts=0 for i in h: if l.count(i)>1: counts+=1 print(counts)
29 اوت 2021, 07:09