HomeProgramming

Programming

Reject Modernity, Return to 80s, Learn C.

In an era dominated by high-level frameworks, drag-and-drop builders, and AI-assisted coding, a surprising trend is emerging...

curl-programming-lang 1.0.2

Introduction to curl-programming-lang 1.0.2 The open-source developer ecosystem continues to thrive with the introduction of innovative tools designed...

STOP Scrubbing Your Life Away: Why This Gadget is Going Viral for All the Right Reasons! 🧼✨

Category: Home GadgetsLet’s be real for a second—is there anything more soul-crushing than getting on your hands...

VS Code is an open-source platform these days, not just a development tool

VS Code: The Evolution from Code Editor to Open-Source Platform For years, Visual Studio Code (VS Code) was...

Codeforces Round #473 (Div. 2), problem: (F) Mahmoud and Ehab and yet another xor task Solution In C/C++

#include<bits/stdc++.h> #define LL long long using namespace std; const int maxn = 1e5+5; const int mod =1e9+7; typedef pair<int,int>pii; int a; int b; int ans; int...

Codeforces Round #473 (Div. 2), problem: (D) Mahmoud and Ehab and another array construction task Solution In C/C++

#include<stdio.h> int vi={0}; int main(void) { int n, a, now = 2; int ans; scanf("%d", &n); int flag = 0; int i,j,k; for (i = 1;...

Codeforces Round #473 (Div. 2), problem: (C) Mahmoud and Ehab and the wrong algorithm Solution In C/C++

#include<stdio.h> int main(){ int n; scanf("%d",&n); if(n <= 5) printf("-1n"); else{ printf("1 2n2 3n2 4n"); for(int i = 5;i <= n;i++) printf("1 %dn",i); } for(int i = 2;i...

Codeforces Round #473 (Div. 2), problem: (B) Mahmoud and Ehab and the message Solution In C/C++

#include<bits/stdc++.h> using namespace std; map<string,int> ms; string str; int arr,temp,mn; int main() { int n,k,m;cin>>n>>k>>m; for(int i=1;i<=n;i++)cin>>str,ms=i; for(int i=1;i<=n;i++)cin>>arr,mn=1e9+7; for(int i=1,j;i<=k;i++) { int x;cin>>x; while(x--)cin>>j,temp=i,mn=min(mn,arr); } unsigned long long res=0; while(cin>>str){res+=mn]];} return cout<<res<<"n",0; }

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!