Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Search
E-Blogarithm
Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Wednesday, October 22, 2025
Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Sign in
Welcome! Log into your account
your username
your password
Forgot your password? Get help
Create an account
Create an account
Welcome! Register for an account
your email
your username
A password will be e-mailed to you.
Password recovery
Recover your password
your email
A password will be e-mailed to you.
Sponsors
Admin
928 animes navigated
AI Startups Make Trial-and-Error a Competitive Edge
AI Startups Are Redefining the Speed of Discovery In the highly competitive world of venture...
The Fraudster Behind Steve Ballmer’s NBA Nightmare
The Fraudster Behind Steve Ballmer’s NBA Nightmare The intersection of elite finance and professional sports...
Sim: MISI aims to nurture a highly skilled Indian community
Empowering Futures: How MISI is Building a Highly Skilled Indian Community in Malaysia Every significant...
‘Patent BS!’: David Axelrod Roasts Trump’s Attempts to Blame Shutdown on Dems and Illegal Immigrants
'Patent BS!' David Axelrod Slams Trump's Shutdown Blame Game on X Veteran political strategist and...
Codeforces Round #421 (Div....
C/C++
August 5, 2017
#include <iostream> using namespace std; int main(){ int n,m,q; cin>>n>>m; q=(n*m+90)/180+2; if(q<n){ n=q; } if(n<3){ n=3; } cout<<"2 1 "<<n; return 0; }
Read more
Codeforces Round #421 (Div....
C/C++
August 5, 2017
#include <iostream> using namespace std; int c,v,vl,l,a; int main(){ cin>>c>>v>>vl>>a>>l; int s=1; for(int i=v;i<c;){ v+=a; if(v>vl) v=vl; i-=l; i+=v; s++;} cout<<s<<endl; }
Read more
Codeforces Round #427 (Div....
C/C++
August 5, 2017
#include <bits/stdc++.h> using namespace std; int n; int to, pre, cost, last,...
Read more
Codeforces Round #427 (Div....
C/C++
August 5, 2017
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N=1010; int n,x,y,bit,ans; int cnta,cntb; int a,b; int ans1,ans2; int...
Read more
Codeforces Round #427 (Div....
C/C++
August 5, 2017
#include <stdio.h> #include <string.h> #define N 5000 int main() { static char cc; static...
Read more
Codeforces Round #427 (Div....
C/C++
August 5, 2017
#include<iostream> #include<cstdio> using namespace std; int a; int x,y,x1,y1,s; int main() { int n,q,c; int i,j,k; scanf("%d%d%d",&n,&q,&c); for(i=1;i<=n;i++) { scanf("%d%d%d",&x,&y,&s); for(j=0;j<=c;j++) a+=(s+j)%(c+1); } for(i=1;i<=100;i++) for(j=1;j<=100;j++) for(k=0;k<=c;k++) a+=a+a-a; for(i=1;i<=q;i++) { scanf("%d%d%d%d%d",&s,&x,&y,&x1,&y1); s%=(c+1); printf("%dn",a-a-a+a); } }
Read more
Codeforces Round #427 (Div....
C/C++
August 5, 2017
#include <stdio.h> int k, c, d, ans; main() { scanf("%d", &k); getchar(); while ((c =...
Read more
Codeforces Round #427 (Div....
C/C++
August 5, 2017
#include <cstdio> int s,t1,t2,v1,v2; int main() { scanf("%d%d%d%d%d",&s,&v1,&v2,&t1,&t2); t1=2*t1+s*v1; t2=2*t2+s*v2; puts((t1==t2)?"Friendship":(t1<t2)?"First":"Second"); }
Read more
Codeforces Round #426 (Div....
C/C++
August 4, 2017
#include <algorithm> #include <cstdio> #include <cstring> #include <map> #include <set> #include <utility> #include <vector> const int...
Read more
Codeforces Round #426 (Div....
C/C++
August 4, 2017
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #define maxn 100005 #define mod...
Read more
Codeforces Round #426 (Div....
C/C++
August 4, 2017
#include <stdio.h> #include <stdlib.h> #include <string.h> #define N 19 char strL, strR; int l,...
Read more
Codeforces Round #426 (Div....
C/C++
August 4, 2017
#include <bits/stdc++.h> #define For(i,a,b) for(long long i=a;i<=b;i++) #define Ford(i,a,b) for(int i=a;i>=b;i--) #define...
Read more