Sponsors

Programming

Codeforces Round #443 (Div....

#include<bits/stdc++.h> using namespace std; int main() { int n,i,s,d,t=0; cin>>n; for(i=0;i<n;i++) { cin>>s>>d; while(s<=t) { s=s+d; } t=s; } cout<<s<<endl; }

Codeforces Round #444 (Div....

#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a,b,c,n,k,m,t; int main() { ...

Codeforces Round #444 (Div....

#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<algorithm> #include<cstdlib> #define eps 1e-7 using namespace std; double x,y,r,L; struct node{double l,r;}a; struct P{double...

Codeforces Round #444 (Div....

#include <cstdio> #include <algorithm> using namespace std; long long n,a,b,c,d,st,len,t; int q; int main() { scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d,&st,&len); for...

Codeforces Round #444 (Div....

#include <bits/stdc++.h> using namespace std; const int R = { {12, 13,...

Codeforces Round #444 (Div....

#include<stdio.h> int main() { int n,i,j,k,m,A,B; scanf("%d",&n); for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ scanf("%d",&A);} } for(i=1;i<=100;i++){ B=0;} for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ B]=1; for(k=1;k<=n;k++){ for(m=1;m<=6;m++){ if (k!=i){ B*10+A]=1; } } } } } i=1; while(B){ i++;} printf("%d",i-1); return 0; }

Codeforces Round #444 (Div....

#include<stdio.h> char s; int main() { scanf(" %s",s); int x=0,y=0,z=0; while(s=='0') x++; while(s!=0) z++; for(int i=x+1;i<z;i++) if(s=='0')...

Codeforces Round #436 (Div....

#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF =...

Codeforces Round #436 (Div....

#include<iostream> #include<cstdio> #include<algorithm> #include<bitset> using namespace std; struct node{ int t,d,p,tot; }a; int f; bool cmp(node x,node y){ return...

Codeforces Round #436 (Div....

#include <bits/stdc++.h> using namespace std; int main(){ int k,sum=0,end,cap,f,tank; for(cin>>end>>cap>>f>>k,tank=cap;k--;f=end-f) if(tank<f||cap<end-f) return cout<<-1,0; else if(tank>=end+(k?end-f:0))...

Codeforces Round #436 (Div....

#include <stdio.h> int c; void reset(){ for(int i=0;i<26;i++){ c=0; } } int main(){ int n,i,cur=0,max=0; scanf("%d",&n); char a; scanf("%s",a); reset(); for(i=0;i<n;i++){ if(a>='A' &&...

Codeforces Round #436 (Div....

#include<cstdio> #include<iostream> using namespace std; int n,cnt,ans,A,B; int buck; int main(){ scanf("%d",&n); for(int i = 1;i...

Explore more titles

Why Everyone is Obsessed with the Mini Magnetic Bag Sealer

Are you tired of dealing with everyday frustrations that slow down your routine? We've all been...

Why Everyone is Obsessed with the Electric Spin Scrubber Pro

Are you tired of dealing with everyday frustrations that slow down your routine? We've all been...

Why Everyone is Obsessed with the Sunset Projection Lamp LED

Are you tired of dealing with everyday frustrations that slow down your routine? We've all been...

Why Everyone is Obsessed with the Electric Spin Scrubber Cordless

Are you tired of dealing with everyday frustrations that slow down your routine? We've all been...

The Ultimate Guide to the Keyboard and Car Universal Cleaning Gel

I discovered the Keyboard and Car Universal Cleaning Gel and it is a total game-changer for my daily routine. Here is why you need...

The Ultimate Guide to the Mini Portable Bag Sealer Magnetic

I discovered the Mini Portable Bag Sealer Magnetic and it is a total game-changer for my daily routine. Here is why you need it... ...

Why you need the Portable Door Lock Travel Home Security

The Portable Door Lock Travel Home Security is a top trending find. 🛍️ VIEW LIVE PRICES ON AMAZON ...

Quote of the day by Charles Darwin: “If I had my life to live over again, I would have made a rule to read...

The Profound Wisdom of Charles Darwin’s Regret: A Lesson for 2026Charles Darwin is globally celebrated for his revolutionary contributions to science and his theory...

STOP staying in hotels until you watch this! 😱✈️

I used to think my hotel room door was safe, until I realized literally anyone with a master key could walk right in. You...

Advertisement