Codeforces 1186A Vus the Cossack and a Contest Solution
Solve in C: #include<stdio.h> int main() { int n,m,k,r=0,t=0; while(scanf("%d%d%d",&n,&m,&k)!=EOF)...
Solve in C: #include<stdio.h> int main() { int n,m,k,r=0,t=0; while(scanf("%d%d%d",&n,&m,&k)!=EOF)...
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int l,i,n,j; while(scanf("%d",&n...
Solve in C++: #include<bits/stdc++.h> using namespace std; int main () { int m,n,i,j,c=0; while(cin>>n>>m)...
Solve in C++: #include<bits/stdc++.h> using namespace std; main() { long n,m; while(cin>>n>>m) { ...
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int a,b,n,r; while(scanf("%d",...
Solve in c: #include<stdio.h> #include<math.h> int main() { long long int a,b,count=0,i,j,t; while(scanf("%...
Solve in C++: # include<bits/stdc++.h> using namespace std; int main() { int n, k, l, c, d, p, nl, np,t1,t2,kl,cd,r1,r2,t;...
Solve in C: #include <stdio.h> int main () { int y , a , b , c , d , count = 0 ; while ( scanf ( "%d" ,...
Slve in C: #include<stdio.h> int main() { int i,len,one=0,zero=0,flag=0,j; char n[101]; while(scanf("%s"...
Source :Ceil function Solve in C: #include<stdio.h> #include<math.h> int main() { double m,n,a,r; scanf("...
Solve in C: #include <stdio.h> int main () { int a , b ; while ( scanf ( "%d%d" ,& a ,& b )!= EOF ) {...
Solve in C: #include <stdio.h> #include <string.h> int main () { char s [ 101 ], t [ 101 ]; int r ; whi...
Hints Solve in C: #include<stdio.h> int main() { int t,n,i,r; while(scanf("%d",&t)!=EOF) { ...
Problem Link https://codeforces.com/contest/2009/problem/C S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. h ...