UVA 12478 Hardest Problem Ever (Easy) Solution

Problem: https://uva.onlinejudge.org/external/124/12478.pdf

Solve in C:

#include<stdio.h>
int main(){

printf("KABIR\n");
return 0;
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.