ch
Feedback

不要被骗子欺骗!Telemetrio 会找到并标记这些频道 👉 如果想查看标记,请订阅

Coding Solutions Group

Coding Solutions Group

前往频道在 Telegram

显示更多
印度未指定类别
2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
/start

RRB NTPC,SSC 10000 SPECIAL MCQ.pdf12.95 MB

Hi T.Sunanda , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

/startsendingpython

Hi Pratik Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @placement_0 @placement_0

Hi Phoenix , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Those who have infyTQ 3rd April 1 PM java slot can DM me for the what's app group link. Dm me

Score and cost please

Anyone got Capgemini interview reshudling mail..??
Public voting

Ans plz

14).9

Hi Akash Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Code plz

/startsendingpython

pavani Dasari: #include <iostream> #include <vector> #include <algorithm> using namespace std; int nSk(int n, int k){ if (n < 2) return 1; if (k > n-2) return 0; vector<int> numbers; numbers.reserve(n - 2); for (int i = 0; i < n - 2; ++i){ numbers.push_back(i + 2); } std::vector<bool> v(numbers.size()); std::fill(v.end() - k, v.end(), true); int ret = 0; do { int tmpnum = 1; for (int j = 0; j < numbers.size(); ++j) { if (v[j]) { tmpnum *= numbers[j]; } } ret += tmpnum; } while (std::next_permutation(v.begin(), v.end())); return ret; } int main(){ int n, d; cin >> n; cin >> d; int sum = 0; for (int k = 0; k < d; ++k){ sum += nSk(n, k); } //sum *= 2; cout<< sum; } ✅1 to N Friends puzzle code