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
Thursday, September 18, 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
905 animes navigated
Hong Kong-Based IP Management Company Medialink Group Expands Into Japan With New Subsidiary Launch (EXCLUSIVE)
Hong Kong's Medialink Group Expands its Reach into Japan Hong Kong-based intellectual property (IP) management...
XRP Bearish Signal: Whales Offload $486 Million In Asset
XRP Bearish Signal: Whales Offload $486 Million in Asset The cryptocurrency market is known for...
Faraday Future Founder and Co-CEO YT Jia Shares Weekly Investor Update: FF Officially Started the Spinoff Plan for the Crypto Flywheel, a Second Independently...
Faraday Future Spins Off Crypto Venture: CXC10 on the Horizon Faraday Future, the electric vehicle...
Ice Cube Says Critical Disaster Shot Without Director Or Actors Present
Ice Cube's Shocking Revelation: "War of the Worlds" Remake Filmed Without Crew? The 2025 remake...
Codeforces Round #421 (Div....
Java
August 5, 2017
import java.util.Scanner; public class C { public static void main(String args)...
Read more
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