code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <cstdio>
#include <string>
using i64 = long long;
bool ask(i64 n) {
printf("? %lld\n", n);
fflush(stdout);
char res[10];
scanf("%s", res);
return res[0] == 'Y';
}
int main() {
int c = 0, t = 1;
for (; c <= 9; c++) {
if (!ask(t)) break;
t *= 10;
}
if (c == 10) {
i64 t = 10;
whi... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll;
ll hint = 10;
int get(ll n) {
if (n == 0) return 0;
printf("? %l... | 1 | 92,512,093 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if(a == b && a == c)
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
return 0;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 1 | 50,774,732 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
if (A == B && B == C){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | 1 | 45,967,098 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
while(1){
int h,w;
cin >> h >> w;
if(h==0) break;
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cout << "#";
}
cout << endl;
}
cout << endl;... | #include <iostream>
using namespace std;
void printRectangle(int height, int width) {
for (int row = 0; row < height; ++row) {
string line;
for (int column = 0; column < width; ++column) {
line += "#";
}
cout << line << endl;
}
cout << endl;
}
int main() {
whi... | 1 | 70,239,728 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
using namespac... | #include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
const int val=1000000;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main(void){
int h,w;
int ans=0;
cin>>h>>w;
char a[h][w];
int num[h][w];
queue<P> que;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
if(a[i... | 1 | 82,981,150 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n ,result = 8888888;
cin >> n ;
int arr[n];
for(int i=0 ; i<n ; i++)
cin >> arr[i];
for(int i= -100 ; i<101 ; i++){
int sum = 0 ;
for(int j=0 ; j<n ; j++){
sum += (arr[j] - i) * (arr[j] - ... | 1 | 29,035,874 |
#include<stdio.h>
int h[251];
int main(){
int n;scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&h[i]);
}
for(int i=1;i<=n;i++){
printf("node %d: ",i);
printf("key = %d, ",h[i]);
if(i/2>=1)printf("parent key = %d, ",h[i/2]);
if(2*i<=n)printf("left key = %d, ",h[2*i]);
if(2*i+1<=n)printf("right key = ... | #include <iostream>
using namespace std;
int a[256];
int main() {
int h; cin >> h;
for (int i = 1; i <= h; i++)
cin >> a[i];
for (int i = 1; i <= h; i++) {
cout << "node " << i;
cout << ": key = " << a[i];
if (i != 1) cout << ", parent key = " << a[i/2];
if (2*i <= h) cout << ", left key = " <... | 1 | 50,493,041 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
LL Q, A, B;
int main()
{
in >> Q;
rep(loop, Q)
{
in >> A >> B;
if (A > B) std::swap(A, B);
if (B - A <= 1) out << 2 * A - 2 << std::endl;
else
{
LL C = sqrt(A*B);
if (C*C... | #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define INF 1e18
#define MOD 1000000007
#define N 1000005
#define BB(V) V[V.size()-2]
#define ex(V) return printf(V),0
using namespace std;
int t1,t2;
int BS(int s,int e){
if(s==e)return s;
int... | 1 | 48,540,291 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
ll ans = 0;
for(ll a = 1 ; a <= 1000000 ; a++){
for(ll b = 1 ; b <= 1000000 ; b++){
if(a * b < n)
++ans;
else... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define ra... | 1 | 10,863,473 |
#include<stdio.h>
main()
{
int a,b,c;
int i,div=0;
scanf("%d %d %d",&a,&b,&c);
for(i=a;i<=b;i++)
{
if((c/i*i)==c)div++;
}
printf("%d\n",div);
} | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
int i = 0;
int count = 0;
cin >> a >> b >> c;
while ((a + i) <= b) {
if (c % (a + i) == 0) {
count++;
}
else {
}
i++;
}
cout << count << '\n';
return 0;
} | 1 | 78,341,680 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
int main() {
int n;
vector<LL> a;
LL tmp_a;
LL ans;
cin >> n;
for(int i=0; i<n; i++){
cin >> tmp_a;
a.push_back(tmp_a);
}
sort(a.begin(), a.end());
ans = a[n-1]-a[0];... | 1 | 4,908,654 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int fN;
fN = N / 100000000
+ N / 10000000 - (N / 100000000) * 10
+ N / 1000000 - (N / 10000000) * 10
+ N / 100000 - (N / 1000000) * 10
+ N / 10000 - (N / 100000) * 10
+ N / 1000 - (N / 10000) * 10
+ N / 100 - (N ... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
in... | 1 | 77,049,367 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
#define MAX_H 2000000
const int INV = -1;
int parent(int i);
int leftNode(int i);
int rightNode(int i);
void buildPriorityQueue(int queue[], int size, int add... | #include <queue>
#include <iostream>
using namespace std;
int main()
{
string oper;
int n;
priority_queue<int> Q;
cin >> oper;
while (oper!="end")
{
if (oper == "insert")
{
cin >> n;
Q.push(n);
}
else if (!Q.empty()&&oper == "extract")
{
cout << Q.top() << endl;
Q.pop();
}
cin >> oper ;
... | 1 | 77,079,228 |
#include <iostream>
#include <algorithm>
#include <string>
#define int long long
signed main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::string input;
std::getline(std::cin, input);
for(const auto& c : input){
if(c>='a' && c<='z') std::cout << static_cast<char>(c+'A'-'a');
... | #include <iostream>
#include <string.h>
#include <ctype.h>
using namespace std;
static const int MAX_LENGTH = 1200;
int main(void) {
char* inputLine = new char[MAX_LENGTH];
cin.getline(inputLine, MAX_LENGTH);
for(int i=0; i <= strlen(inputLine); i++) {
if(i == strlen(inputLine)) {
cout <... | 1 | 89,294,367 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int ma... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int X, A, B; cin >> X >> A >> B;
if (A < B)
cout << (X < B - A ? "dangerous" : "safe") << endl;
else
cout << "delicious" << endl;
} | 1 | 11,462,003 |
#include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x... | #pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | 1 | 43,765,328 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define show(x) cerr<<#x<<"="<<x<<"\n"
typedef long long ll;
using namespace std;
const int dy[]={1,0,-1};
const int dx[]={1,0,-1};
int n,m,h,w;
int a[90000];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;
#ifdef L... | #ifndef _WIN32
#include<iostream>
#endif
#include<algorithm>
#include<vector>
#include<string>
#include<iomanip>
#include<map>
using namespace std;
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main() {
int N;
while (cin >> N, N) {
vector<strin... | 1 | 84,366,486 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a,b,c,d,p,q;
cin>>a>>b>>c>>d;
p=(a-1)/c+(a-1)/d-(a-1)/(c*d/__gcd(c,d));
q=(b)/c+(b)/d-(b)/(c*d/__gcd(c,d));
cout<<b-a+1-q+p;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y){
if(x < y) swap(x, y);
while(y){
ll r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x, ll y){
ll g = gcd(x, y);
return (x / g) * (y / g) * g;
}
int main(){
ll a, b, c, d;
cin >... | 1 | 44,192,132 |
#include <iostream>
char c;
int main() {
std::cin >> c;
char ch = (int) c + 1;
std::cout << ch << std::endl;
} | #include <stdio.h>
int main() {
char g;
scanf("%c", &g);
printf("%c", g +1);
return 0;
} | 1 | 12,390,359 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
bool fA = false;
bool fB = false;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A') {
fA = true;
}
else if (S[i] == 'B') {
fB = true;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
char ch[3];
int a = 0, b = 0;
for (int i = 0; i < 3; ++i)
{
cin >> ch[i];
if (ch[i] == 'A')
{
a++;
}
else
b++;
}
if (a != 3 && b != 3)
{
... | 1 | 45,408,775 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
int N, K;
ll a[5001];
ll asum;
bool dp[5001];
bool isNoNeed(int x) {
if (asum < K) {
return true;
}
fill(dp, dp + K, false);
dp[0] = true;
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
bool dp[5010][5010];
int main() {
cin.tie(0);
... | 1 | 92,082,723 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
long long all = 0;
long long current = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
all += abs(current - A[i]);
current = A[i];
}
all += abs(current - 0);
current = 0;
for (int i = 0; i < N; i+... | #include<bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
const char newl = '\n';
typedef long long int Int;
typedef pair<int,int> P;
using ... | 1 | 58,081,997 |
#include <iostream>
using namespace std;
int main(){
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int fee=0;
if(N>K) fee=K*X+(N-K)*Y;
else fee=N*X;
cout << fee << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve(){
int n, k, x, y;
cin >> n >> k >> x >> y;
int res = k * x;
if(n < k){
cout << n * x << "\n";
}
else{
res = res + (n - k) * y;
cout << res << "\n";
}
return 0;
}
int main() {
#ifndef ON... | 1 | 61,642,485 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int n,k; string s;
cin >> n >> k >> s;
int ans = 1;
int l=0, r=0;
while(r<n && s[r] == '1') r++;
while(k > 0 && r < n) {
while(r<n && s[r] == '0') r++;
while(r<n &&... | 1 | 31,283,192 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #include<iostream>
#include<set>
using namespace std;
int main(){
long long x, y;
cin >>x >>y;
long long ans = 1e18, dist = 0;
if(abs(x) == abs(y)){
cout <<"1\n";
return 0;
}
if(-x < y){
dist = y + x + 1;
ans = min(ans, dist);
}
if(x < -y){
dist = -y - x + 1;
ans = min(ans, dist);
}
if(-x < -y){
... | 1 | 96,173,951 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n;cin>>n;
ll a=0,b=0,c=0,ans=0;
for(ll i=0;i<n;i++){
string s;cin>>s;
for(ll j=0;j<ll(s.size())-1;j++)if(s[j]=='A' && s[j+1]=='B')ans++... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, cnt = 0, xa = 0, bx = 0, bxa = 0;
string s;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> s;
if (s.at(0) == 'B' && s.at(s.size() - 1) == 'A')
bxa++;
else if (s.at(0) == 'B')
bx++;
else if (s.at(s.size() - 1) == 'A')... | 1 | 54,362,283 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=1e5+4;
ll a[N],b[64],sum,cur;
int pos[64],tim;
int n;
inline void add(ll x) {
for (int i=1;i<=tim;++i) {
if (!((x>>pos[i])&1)) continue;
else if (!b[pos[i]]) {b[pos[i]]=x;break;}
else ... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> as(n);
for(Int i=0;i<n;i++) cin>>as[i];
Int ... | 1 | 67,324,034 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const long long INF = 1LL << 60;
int a,b,c,d;
int main()
{
cin >> a >> b >> c >> d;
int L = a+b, R = c+d;
if(L > R) cout << "Left" << endl;
else if(L == R) cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n)... | 1 | 94,017,048 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll N, M, ans=0, tmp=0;
vector<ll> A;
map<ll,ll> MP1, MP2;
signed main(){
cin >> N >> M;
MP1[0]++;
for(int i=0;i<N;i++) {
ll a;
cin >> a;
tmp +=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[100000];
ll cum_A[100001];
unordered_map<int, ll> mod_cnt;
int main() {
int N, M;
cin >> N >> M;
for (int i=0; i<N; i++) {
cin >> A[i];
cum_A[i+1] = cum_A[i] + A[i];
}
for (int i=0; i<=N; i++) {
mod_cnt[cum_A[i] % M]++;
}
ll ans = 0;
... | 1 | 59,539,100 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterat... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll H, W, A, B;
cin >> H >> W >> A >> B;
vector<vector<ll>> ans(H, vector<ll>(W, 1));
for (ll i = 0; i < B; ++i) {
for (ll j = 0; j < W; ++j) {
ans.at(i).at(j) = (ans... | 1 | 76,057,449 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b;
c = ceil((a + b) / 2);
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
c = (int)((a + b) * 0.5 + 0.5);
cout << c << endl;
} | 1 | 37,219,899 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 84,511,814 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
ll max(ll a,ll b){
if(a > b) return a;
return b;
}
int main(){
ll ... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 1 | 61,175,427 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
map<char, bool> m;
for(char c = 'a'; c != '{'; c++){
m[c] = false;
}
for(int i = 0; i < S.size(); i++){
m[S[i]] = true;
}
for(auto a : m){
auto ans_C = a.... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "None";
for( char a = 'a'; a <= 'z'; a++ ) {
if( S.find( a ) == string::npos ) {
ans = string( 1, a );
break;
}
}
cout << ans << endl;
} | 1 | 39,151,373 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, m;
int main()
{
scanf("%lld%lld", &n, &m);
ll i = 1, j = n;
for(; m > 0; i++, j--)
{
if((i - 1) - (j + 1) + i - j == -n - 2) j--;
else if((i - 2) - (j + 2) + i - j == -n - 2) j--;
printf("%lld ... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<vector>
#include<functional>
using namespace std;
typedef long long LL;
inline LL read()
{
LL kk=0,f=1;
char cc=getchar();
while(cc<'0'||cc>... | 1 | 61,896,418 |
#include<bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef set <int> se;
#define endl "\n"
void solve(){
int n;
cin>>n;
int a[n];
for(auto i = 0 ;i<n;i++) cin>>a[i];
long long ma = a[0];
long long cnt = 0;
for(int i = 1;i<n;i++){
if(a[i]<ma){
cnt += ma-a[i];
}
else ma = a[i];
}
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a.at(i);
ll maxValue=0, ans=0;
rep(i, n){
if(a.at(i) < maxValue) ans += maxValue-a.at(i);
else maxValue = a.at(i)... | 1 | 784,629 |
#include <iostream>
#include <queue>
#define INF 1e9
#define MAX_H 1000
#define MAX_W 1000
using namespace std;
struct Cood {int x, y; };
int N;
int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
char field[MAX_H][MAX_W + 1];
int d[MAX_H][MAX_W + 1];
queue<Cood> q;
int h, w, n;
int total_time = 0;
void init_bfs() {
... | #include <cstdio>
#include <queue>
#include <vector>
#include <string>
using namespace std;
typedef pair<int, int> P;
vector<P> v(10);
int h, w, n;
char map[1000][1001];
const int INF = 100000000;
int d[1000][1000];
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int bfs(int t){
queue<P> que;
for(int i=0; i<w; ... | 1 | 28,640,262 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n;
cin>>n;
cout<<180... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main(){
int a;
cin >> a ;
cout << (a-2)*180 << endl;;
return 0;
} | 1 | 85,273,036 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define fastIO ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("ss... | 1 | 68,121,215 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
string s;
cin>>s;
int n=s.size();
vector<int>a(n+1,0);
rep(i,n){
if(s[i]=='<')if(a[i]>=a[i+1])a[i+1]=a[i]+1;
}
for(int i=n; i>0; --i){
if(s[i-1]=='>')if(a[... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 1 | 11,635,243 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rev2(i, s, n) for (int i = (int)(n) - 1; i >= (int)(s); i--)
#define bitrep(i, n) for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> k(m);
vector<int> p(m);
rep(i,m){
int K; cin>>K;
rep(j,K){
int s; cin>>s;
s--;
k[i].pus... | 1 | 85,700,414 |
#include<iostream>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int a,b,c,d,e,f,g;
g=1000-n;
for(a=0;a<2;a++){
for(b=0;b<5;b++){
for(c=0;c<2;c++){
for(d=0;d<5;d++){
for(e=0;e<2;e++){
for(f=0;f<5;f++){
if(a*500+b*100+c*50+d*10+e*5+f==g){
cout<<a+b+c+d... | #include<iostream>
using namespace std;
int main(){
int monny;
int coin[]={500,100,50,10,5,1};
while(cin>>monny&&monny!=0){
monny=1000-monny;
int answer=0;
for(int i=0;i<6;++i){
answer+=monny/coin[i];
monny%=coin[i];
}
cout<<answer<<endl;
}
return 0;
} | 1 | 86,614,587 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX = 100000;
int main() {
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
for (int i = 0; i < a; i++) cin >> p[i];
for (int i = 0; i < b; i++) cin >> q[i];
for (int i = 0; i < c; i++) cin >> r... | 1 | 15,560,088 |
#include <iostream>
using namespace std;
int main(){
int n,a,b,c,x,f[10001],now,key[100],i;
while(1){
cin>>n>>a>>b>>c>>x;
if(n==0)break;
f[0]=x;
for(i=1;i<=10000;i++)f[i]=(f[i-1]*a+b)%c;
for(i=0;i<n;i++)cin >>key[i];
now=0;
for(i=0;i<=10000;i++){
if(key[now]==f[i])now++;
if(n... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main()
{
int n, a, b, c, x;
while(1){
cin >> n >> ... | 1 | 4,490,497 |
#include<iostream>
using namespace std;
int main(){
int size = 0, n[101] = {0}, temp, max = -1;
while(cin >>temp){
n[temp]++;
if(n[temp] > max) max = n[temp];
size++;
}
for(int i = 1; i <= 100; i++){
if(n[i] >= max) cout <<i <<endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, mode=0;
vector<int> numbers(101, 0);
while (cin >> n) {
numbers[n]++;
if (numbers[n] > mode) { mode=numbers[n]; }
}
for (int i = 0; i != numbers.size(); ++i) {
if (numbers[i] == mode) { cout << i << endl; }
... | 1 | 4,258,039 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
int N;
cin >> N;
for (int i = 0; i < S.length(); i++) {
if (i == 0) {
cout << S[i];
}else if(i % N == 0) {
cout << S[i];
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
int k;
cin >> s >> k;
for (int i = 0; i < s.size(); i += k)
{
cout << s[i];
}
} | 1 | 61,334,457 |
#include<bits/stdc++.h>
using namespace std;
bool comp(vector<int> a, vector<int> b){
return a[0] < b[0];
}
int time(string str){
int s = (int)str[7] - '0' + ((int)str[6] - '0')*10;
int m = (int)str[4] - '0' + ((int)str[3] - '0')*10;
int h = (int)str[1] - '0' + ((int)str[0] - '0')*10;
return s + 6... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int time_parse(string time)
{
int hour = atoi(time.substr(0, 2).c_str());
int minute = atoi(time.substr(3, 5).c_str());
int second = atoi(time.substr(6).c_str());
return hour * 3600 + minute * 60... | 1 | 14,575,749 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==b && b==c)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <iostream>
#include <string.h>
using namespace std;
int main(){
string a, b, c;
cin >> a;
cin >> b;
cin >> c;
if(b == a){
if(b==c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
... | 1 | 33,900,481 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> A;
int H=0;
void maxHeapify(int idx)
{
int left=2*idx, right=2*idx+1;
int largest;
if(left<=H && A[left]>A[idx]){
largest=left;
} else{
largest=idx;
}
if(right<=H && A[right]>A[largest]){
... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T>
inline T sqr(T x) {
return x * x;
}
typede... | 1 | 21,238,947 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define mod 1000000007
typedef long long ll;
using namespace std;
ll A[1005],B[1005],C[1005],AB[3005];
... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
bool v[1005][1005][1005];
int... | 1 | 98,335,574 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max({a, b, c}) - min({a, b, c}) << endl;... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
vector<ll> A(3);
for(ll i=0;i<3;i++) {
cin>>A[i];
}
sort(all(A));
cout<<A[2]-A[0]<<endl;
} | 1 | 32,329,958 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H , W , K ;
cin >> H >> W >> K ;
vector<vector<char>> c(H, vector<char>(W));
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
cin >> c[i][j];
int ans = 0;
for(int Hbit = 0; Hbit < (1<<H); Hbit++){
for(int Wbit = 0; Wbit < (1<<W)... | 1 | 58,138,894 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include<map>
using namespace std;
typedef long long ll;
int main() {
ll n, x, m;
cin >> n >> x >> m;
ll a = x;
ll ans = 0;
map<ll, int> mp;
vector<ll> fir;
ll dup = -1;
... | #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
using namespace std;
int main()
{
long long int n,x,nw,m;
scanf("%lld %lld %lld",&n,&x,&m);
long long int fst[100005]={};
long long int ss[100005]={};
nw=x;
int st=... | 1 | 81,625,867 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b;
cin >> a >> b;
b/=2, b+=a;
cout << b;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
typedef long long int ll;
using namespace std;
using Graph = vector<vector<int> >;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int X,Y;
cin>>X>>Y;
cout<<X+(Y/2... | 1 | 44,028,349 |
#include <bits/stdc++.h>
#include <complex>
#define ll long long
#define fore(i, l, r) for(int i = int(l); i < int(r); ++i)
#define forn(i, n) fore(i, 0, n)
#define fori(i, l, r) fore(i, l, (r) + 1)
#define sz(v) int((v).size())
#define... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 1 | 80,238,310 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define vvi vector< vector<int> >
#define vvl vector< vector<ll> >
#define vp vector<P>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (i... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | 1 | 19,315,040 |
#include<stdio.h>
int main(void){
int W,H,x,y,r;
scanf("%d%d%d%d%d",&W,&H,&x,&y,&r);
puts((x-r<0||x+r>W||y-r<0||y+r>H)?"No":"Yes");
return 0;
} | #include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
char* str;
cin >> W >> H >> x >> y >> r;
if( x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H ) {
str = "Yes";
} else {
str = "No";
}
cout << str << endl;
} | 1 | 61,898,716 |
#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <stdio.h>
#include <vector>
#include <thread>
#include <atomic>
#include <mutex>
#include <future>
#define int long long
#define endre getchar();getcha... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define FFOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define rep(i,n) FOR(i,0,n-1)
#define int long long
#define MOD 998244... | 1 | 35,717,538 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int i, W, H, N;
cin >> W >> H >> N;
int up=H, down=0, right=W, left=0;
int w, h, a;
rep(i,N){
cin >> w >> h >> a;
if(a==1 && left<w) left=w;
else... | 1 | 100,585,633 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int x;
cin>>x;
int c=(x%100)/5;
c+=((x%100)%5+4)/5;
puts(c<=(x/100)?"1":"0");
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
#include <map>
#include <utility>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vec... | 1 | 10,712,577 |
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n,k,ans=0;
cin>>n>>k;
int a[n];
rep(i,n)cin>>a[i];
n-=k;
ans+=n/(k-1)+1;
if(n%(k-1))ans++;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define MODNum 1000000007
#define REP(type, i, a, b) for( type i = a; i < b; i++ )
typedef long long ll;
using namespace std;
int main (void) {
int N, K, ans;
cin >> N >> K;
vector<int> A(N);
int Pos;
REP(int,i,0,N){
cin >> A.at(i);
}
ans = ceil((double)( N -... | 1 | 37,629,381 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
map<ll,ll> mp;
for (int i = 0; i < N; i++) {
mp[A.at(i)]++;
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
ll a, b = 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
using ll = long long;
int main() {
int n;
scanf("%d", &n);
int a[100000];
rep(i, n) cin >> a[i];
vector<int> v;
map<int, int> cnt;
rep(i, n) {
cnt[a[i]]++;
if (cnt[a[i]] == 2) c... | 1 | 72,716,541 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<int,int> P;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, a[101010];
int main()
{
cin >> n;
rep(i, n) cin >> a[i];
int p = 0;
ll res = 0;
rep(i, n)
{
if(p && a[i])
{
p =... | 1 | 85,881,038 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
string a,b;
cin >> a >> b;
int res = 0;
for(int i = 0;i < 3;i++){
if(a[i] ... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s, t;
int count = 0;
cin >> s >> t;
for(int i = 0; i < s.size(); i++) {
... | 1 | 92,834,584 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
int main(){
int lens,lenp;
char s[210],p[110];
int f=0;
scanf("%s %s",s,p);
lens=strlen(s);
lenp=strlen(p);
sprintf(s,"%s%s",s,s);
rep(i,0,lens){
rep(j,0,lenp){
if(s[i+j]!=p[j]) break;
if(j==lenp-1) f=1;
}... | #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<vector>
#include<cctype>
using namespace std;
int main(){
string a;
cin>>a;
string s=a+a;
string p;
cin>>p;
if(s.find(p)!=string::npos)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 62,733,910 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mem(arr,v) memset(arr,v,sizeof(arr))
int main()
{
ll t,a,b,c,k;
cin>>a>>b>>c>>k;
if(abs(a-b)>10e18)
cout<<"Un... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll a,b,c,k,ans; cin>>a>>b>>c>>k... | 1 | 45,734,250 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "... | #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pb(x) push_back(x)
#define F first
#define S second
using namespace std;
const int N=101;
int arr[2*N];
int n;
void solve(){
scanf("%d",&n);
loop(i,0,2*n){
... | 1 | 68,803,438 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
struct SegmentTree {
int n;
vector<int> dat;
SegmentTree(int n_) {
n = 1;
while (n < n_) n *= 2;
dat.resize(2*n-1, INF);
}
void up... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, M;
cin >> H >> W >> M;
vector<int> hline(H,0);
vector<int> wline(W,0);
int h, w;
set<pair<int,int>> target;
for (int i = 0; i < M; i++) {
cin >> h >> w;
hline.at(h-1)++;
wline.at(w-1)++;
target.insert(make_pair(h-1,w-1));... | 1 | 39,243,391 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> ... | #include <bits/stdc++.h>
using namespace std;
using Double = long double;
#define PUTS(x) cout << (x) << endl;
int main() {
std::cout << std::fixed << std::setprecision(20);
Double n, m, d;
cin >> n >> m >> d;
if(d==0){
PUTS((m-1)/n);
} else {
PUTS(2 * (m - 1) * (n - d) / (n * n));
... | 1 | 50,831,399 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
const int mod = 1e9 + 7;
int fac[N], rfac[N], inv[N];
int main() {
fac[0] = rfac[0] = fac[1] = rfac[1] = 1;
inv[0] = 0, inv[1] = 1;
for (int i = 2; i < N; i ++) {
fac[i] = 1ll * fac[i-1] * i % mod;
inv[i] = 1ll * (mod / i) * ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod =1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
ll exp(ll a,ll n){
if(n==0) return 1;
else if(n%2==0) return (exp(a,n/2)*exp(a,n/2))%mod;
else return (a*exp(a,n-1))%mod;
}
int main() {
ll x,y;
cin>>x>>y;
ll ans;
ll a=2*y-x;
ll b... | 1 | 25,516,490 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | #include<bits/stdc++.h>
using namespace std ;
#define ll long long
int main() {
ll n ,i ;
cin >> n ;
vector<ll>v(n) , a(n) , b(n) ;
for (i = 0 ; i< n ;i++) cin >> v[i] ;
for ( i = 1 ; i<= n ;i++) {
a[i-1] = 25000 * (i) ;
b[n-i] = a[i-1] ;
}
for ( i = 0 ; i < n ;i++) {
... | 1 | 55,928,062 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | #include <iostream>
int main() {
int n, k; std::cin >> n >> k;
std::cout << n - k + 1<< std::endl;
return 0;
} | 1 | 19,976,982 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if (a < b)
{
swap(a, b);
}
while (b > 0)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
int mx = 0;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (auto& i : a) cin >> i;
sort(a.begin(), a.end());
if (k > a[n - 1]) {
cout << "IMPOSSIBLE";
return 0;
}
ll gc... | 1 | 94,125,420 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int A, B;
cin >> A >> B;
if ((A % 3 == 0)||(B % 3 == 0)||((A + B)% 3 == 0)) {
cout << "Possible" << endl;
} else {
cout << "Impossible" << endl;
}
return 0;
} | 1 | 12,494,213 |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define no cout << "NO" << endl
#define yes cout << "YES" << endl
#define tc ll t; cin >> t; while (t--)
#define s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
using ll = long long;
int main() {
ll n;
cin >> n;
std::vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep(i, n-1) {
if(a[i] - a[i+1] == 0) {
cout << "NO" << endl;
return 0;
}
... | 1 | 71,550,658 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n;
cin >> n;
if(n==0) break;
vector<int> vs;
for(int i = 0; i < n; i++) {
int k;
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
vector<int> grade(n);
for(int i=0; i<n; i++){
cin >> grade[i];
}
sort(grade.begin(), grade.end());
int dm... | 1 | 76,169,826 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define ll long long
bool FLAG = 0;
#define debug(x) if (FLAG) {cerr << #x << " =... | #include<bits/stdc++.h>
using namespace std;
int a[100001];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,L;
cin>>n>>L;
for(int i=1;i<=n;i++)
cin>>a[i];
int x=0;
for(x=1;x<n;x++)
if(a[x]+a[x+1]>=L)
break;
if(x==n){
cout<<"Impossible"<<endl;
}
else{
cout<<"Possible"<<endl;
for(int i=... | 1 | 27,913,505 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int s;
cin >> s;
int count = 1;
if(s==2 || s==1){
s=4;
c... | #include<bits/stdc++.h>
using namespace std;
#define mem(a,x) memset(a,x,sizeof(a));
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+... | 1 | 77,002,924 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int N;
vector<int> pathes[100050];
vector<int> children[100050];
int parent[100050];
int color[100050];
bool WIN = false;
void bfs1(int from) {
for(int i = 0; i < pathes[from].size(); i++) ... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
struct FastIO{
FastIO(){
cin.tie(0);
ios::sync_with_stdio(0);
}
}fastio_beet;
templa... | 1 | 34,392,290 |
#include <algorithm>
#include <iostream>
#include <vector>
int is_right_triangle(int min, int mid, int max) {
return max * max == min * min + mid * mid;
}
int main() {
int ntriangle;
std::cin >> ntriangle;
for (auto i = 0; i < ntriangle; i++) {
std::vector<int> tri;
for (auto j = 0; j < 3; j++) {
... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
long dd(int n){
return n*n;
}
int main(){
int n, t[3];
cin >> n;
for(int i=0; i<n; ++i){
for(int j=0; j<3; ++j)
scanf(" %d", &t[j]);
sort(t, t+3);
if( dd(t[2]) == dd(t[0])+dd(t[1]) ) printf("YES\n");
else prin... | 1 | 79,209,218 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s.substr(0,4)=="YAKI") cout<<"Yes";
else cout<<"No";
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
string S; cin >> S;
if (S.length() < 4) ... | 1 | 11,737,671 |
#include <stdio.h>
int main(){
int n;
int x[40];
int i,k;
int Flag = 0;
for(i = 0;i < 40;i++){
x[i] = 0;
}
x[39] = 1;
scanf("%d",&n);
for(i = 1;i <= n;i++){
for(k = 0;k <= 39;k++){
x[k] *= i;
}
for(k = 39;k >= 0;k--){
if(x[k] >= 10){
x[k-1] += x[k]/10;
x[k] %= 10;
}
}
}
for(i = 0;i... | #include <cstdio>
using namespace std;
typedef long long int LLI;
LLI n;
LLI ans = 1;
int main() {
scanf("%lld", &n);
while (n > 0) {
ans *= n;
--n;
}
printf("%lld\n", ans);
} | 1 | 77,426,138 |
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main(){
int n, m, d, p, ans;
while( cin >> n >> m , n || m ){
ans = 0;
map<int,int> f;
for(int i=0 ; i <= 10 ; i++ ){
f[i] += 0;
}
for(int i=0 ; i<n ; i++ ){
cin >> d >> p;
f[p] += d;
}
for(int i=10 ; i >= 0 ; i-- ... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
#include<random>
#include<ctime>
#include<set>
using namespace std;
const long long int mod=1000000007;
const lo... | 1 | 80,435,074 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51";
int K;
cin >> K;
int count = 0;
int n = 1;
while(count < S.length()){
if(S[count] == ',' && S[count + 1] == ' '){
count += 2;
... | #include <bits/stdc++.h>
using namespace std;
vector<int> lol = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int N;
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
cout << lol[N - 1] << "\n";
} | 1 | 21,445,442 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
vector<int> a(5);
rep(i,5) cin >> a[i];
int check = 10;
int last = 0;
int num = 6;
rep(i,5){
if(a[i] % 10 != 0 && a[i] % 10 < check){
last... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int A[5];
int mod=10;
rep(i,5){
cin>>A[i];
if(A[i]%10==0){
continue;
}
else{
mod=min(mod,A[i]%10);
}
}
int sum=0;
rep(i,5){
if(A[i]%10=... | 1 | 82,286,826 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | #include <bits/stdc++.h>
using namespace std;
int h, w, n, x, y;
long long c[10];
map<pair<int, int>, int> g;
int main() {
scanf("%d%d%d", &h, &w, &n);
c[0] = (long long)(h - 2) * (w - 2);
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
for (int j = x; j < x + 3; j++) {
for (int k = y; k < y + 3; k++) {
... | 1 | 80,831,639 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main() {
string s1, s2,moji;
int i = -1;
cin >> s1 >> s2;
moji = s1 + s1;
i = moji.find(s2);
if (i != -1) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string s,p;
cin>>s>>p;
bool a=false;
for(int i=0;i<s.size();i++){
int count=0;
for(int j=0;j<p.size();j++){
if(s[(i+j)%s.size()]==p[j%p.size()])
count++;
}
if(count==p.size())
a=true;
}
if(a==true)
cout<<"Yes"<<endl;
else
... | 1 | 13,270,638 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
string sl = "", sr = "";
for (int i = 0; i < (s.size() - 1) / 2; i++) {
sl += s[i];
sr += s[i + (s.size() - 1) / 2 + 1];
}
string rsl = sl;
stri... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
string s;
cin >> s;
int n = s.size();
bool ok = true;
int a = n / 2;
rep(i,a) if(s[i] != s[n-1-i]) ok = false;
int b = (n-1)/2;
int c = b / 2;
rep... | 1 | 42,197,271 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long Q,H,S,D;
long long N;
cin>>Q>>H>>S>>D>>N;
long long ONE=min(4*Q,min(2*H,min(2*Q+H,S)));
long long TWO=min(D,ONE*2);
cout<<N/2*TWO+N%2*ONE<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll q,h,s,d,n;
cin >> q >> h >> s >> d >> n;
s=min(s,min(q*4,h*2));
ll ans=s*(n%2);
ans+=min(d,s*2)*(n/2);
cout << ans << endl;
} | 1 | 26,839,261 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int A,B,K; cin >>A >>B >>K;
rep_eq(i,1,K) {
if (i%2==1) {
A/=2;
B+=A;
} else {
B/=2;
A+=B;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll a,b,k; cin>>a>>b>>k;
rep... | 1 | 99,722,324 |
#include <iostream>
#include <vector>
class Search {
int a,b;
std::vector<std::vector<bool>> searched_point;
public:
int count;
void set_searched_point(int n_a, int n_b);
void prohibit(int n);
bool pass_search(int x,int y);
};
void Search::set_searched_point(int n_a, int n_b) {
a = n_a;
b = n_b;
count = 0;
se... | #include <iostream>
using namespace std;
int cross[16][16];
void init() {
for (int i = 0; i < 16; i++) {
for (int j = 0; j < 16; j++) {
cross[i][j] = -1;
}
}
cross[0][0] = 1;
}
int main() {
while (true) {
int a, b; cin >> a >> b;
if (a == 0 && b == 0) break;
... | 1 | 13,330,215 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+7;
int a[N];
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
int s,n;
cin>>s>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
if(n==1||n==0){
cout<<0<<endl;
return 0;
}
int maxl = 0;
for(int i=1;i<n;i++){
... | #include <iostream>
#include <vector>
int main(){
int K, N;
std::cin >> K >> N;
int A;
int max_dist = 0;
std::vector<int> As;
for (int i = 0; i < N; i++){
std::cin >> A;
As.push_back(A);
if (i != 0){
if (As[i] - As[i - 1] > max_dist) max_dist = As[i] - As[i - 1];
}
}
if (As[0] + K... | 1 | 43,355,842 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h;
cin >> h;... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
#define NIL -1
#define N 500001
int A[N], n;
int par(int i){ return i / 2; }
int lef(int i){ return i * 2; }
int rig(int i){ return i * 2 + 1;... | 1 | 10,615,210 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int s;
cin>>s;
bool flag=0;
int n=1;
vector<int>a(n);
a[0]=s;
while(flag==0){
if(a[n-1]%2==1){
n++;
a.resize(n);
a[n-1]=a[n-2]*3+1;
}
else{
n++;
a.resize(n);
a[n-1]=a[n-2]/2;
}
for(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,l,r) for(ll i=(l); i<(r); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& ... | 1 | 51,163,021 |
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int a,b,d,r;
double f;
cin>>a>>b;
f=static_cast<double>(a)/static_cast<double>(b);
cout<<a/b<<" "<<a%b<<" "<<fixed<<f<<"\n";
} | #include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
double A = a;
double B = b;
double C = A / B;
printf("%d %d %lf\n", a/b, a%b, C);
return 0;
} | 1 | 66,707,868 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | #include <bits/stdc++.h>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
const ll mod = 1000000007;
const ll N = 200005;
const ll inf = 10000000000000000;
... | 1 | 69,468,209 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int,int> pairii;
typedef vector<int> veci;
const double pi=3.1415926535;
const ll mod=1000000007;
int main() {
int a,b,c,d,ans=0;
cin>>a>>b>>c>>d;
a... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int left, right;
if (A < C) {
left = C;
} else {
left = A;... | 1 | 85,064,113 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
string a,b;
cin >> a >> b;
int c = a.size(),d = b.size(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 1 | 1,230,572 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int R = 0;
cin >> N;
for(int i = 0; i < N; i++){
int l, r;
cin >> l >> r;
while(l <= r){
R++;
l++;
}
}
cout << R << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,l,r,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>l>>r;
sum+=r-l;
sum++;
}
cout<<sum<<endl;
} | 1 | 69,252,977 |
#include <bits/stdc++.h>
using namespace std;
const long long INF=(long long)1e18;
int main(){
long long n,res,ans;
cin>>n;
ans=INF;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
res=i+n/i;
ans=min(ans,res);
}
}
cout<<ans-2<<endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 1 | 14,095,466 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.