code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 1 | 88,536,964 |
#include <iostream>
using namespace std;
int main(void){
int radius;
cin >> radius;
cout << radius * radius << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<iomanip>
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main(){
int n;
cin >> n;
int ans = n*n;
cout << ans << endl;
return 0;
} | 1 | 94,736,621 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin>>n;
int T=0,px=0,py=0;
for(int i=0;i<n;i++){
int t,x,y;
cin>>t>>x>>y;
int dt=t-T;
int dxy=abs(x-px)+abs(y-py);
if(dt... | #include <iostream>
#include <string>
using namespace std;
typedef struct{
int x,y,t;
} acord_t;
int main(void)
{
int N;
cin >> N;
acord_t point[N];
for(int i=0; i<N; i++){
cin >> point[i].t;
cin >> point[i].x;
cin >> point[i].y;
}
for(int j=0; j<N; j++){
int x_... | 1 | 19,698,777 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <stack>
#include <cmath>
#define ll long long
#define LINF 0x3f3f3f3f3f3f3f3f
#define INF 0x3f3f3f3f
#define PI 3.14159265
using nam... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 998244353
using namespace std;
int main() {
ll k;
cin >> k;
vector<ll> a(50, k / 50 + 1);
for(int i = 0; i < 50; i++) {
a[i] += i;
}
int q = 50 - k % 50;
while(q--) {
auto ind = m... | 1 | 20,240,725 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n,m,x,y;
cin >> n>>m>>x>>y;
int xma = -1000, ymi = 1000;
int a;
rep(i, n){
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
int N,M,X,Y;
cin>>N>>M>>X>>Y;
vector<int>x(N);
vector<int>y(M);
for(int i=0;i<N;i++){
cin>>x[i];
}
x.push_back(X);
for(int i=0;i<M;i++){
cin>>y[i];
}
y.push_back(Y);
for(int i=-100;i<=100;i++){
int miny=*min_element(y... | 1 | 81,198,899 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
int r;
r = a % b;
if(r == 0) return b;
else return gcd(b, r);
}
int main(){
int X, G;
cin >> X;
G = gcd(X, 360);
cout << 360 / G << endl;
} | #include <bits/stdc++.h>
int n;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
scanf("%d", &n), n %= 360;
printf("%d\n", 360 / gcd(n, 360));
return 0;
} | 1 | 75,627,405 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
map<int,int> m;
rep(i,0,n){
int a;
cin>>a;
m[a]++;
}
int ans=0;
for(auto p:m){
if(p.second>=p.first){
ans+=p.s... | #include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main (void) {
int arr[100001];
int size,
rem, coun, res;
cin >> size;
for (int it = 0; it < size; ++it) cin >> arr[it];
sort(arr, arr + size);
rem = arr[0];
coun = 1;
res = 0;
for (int it = 1; it < size; ++it) {
if (arr[i... | 1 | 20,946,542 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
bool prime[101];
void init(){
int i,j;
prime[0] = prime[1] = false;
fill(prime+2,prime+101,1);
for(i=2;i<=7;i++){
if(!prime[i]) continue;
for(j=i+i;j<=100;j+=i) prime[j... | 1 | 64,757,213 |
#include <iostream>
using namespace std;
int main()
{
char a;
cin>>a;
if(isupper(a))
{
cout<<"A";
}
else
{
cout<<"a";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
char c;
cin >> c;
if (c <= 'Z') {
cout << 'A' << endl;
} else {
cout << 'a' << endl;
}
} | 1 | 16,913,780 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
char a, b, c;
a = (int)s1.at(0) - 32;
b = (int)s2.at(0) - 32;
c = (int)s3.at(0) - 32;
cout << a << b << c << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
string a, b, c; cin >> a >> b >> c;
cout << (char)(a.at(0) + ('A' - 'a')) << (char)(b.at(0) + ('A' - 'a')) << (char)(c.at(0) + ('A' - 'a')) << endl;
} | 1 | 76,042,091 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>pii;
int main(){
int H,W,D;
map<int, pii> m;
cin >> H >> W >> D;
ll ans = 0;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
int tmp;
cin >> tmp;
tmp--;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
int h,w,d;
cin>>h>>w>>d;
int x[90009],y[90009];
rep(i,h) rep(j,w){
int a;
cin>>a;
a--;
x[a]=i;
y[a]=j;
}
int sums[... | 1 | 55,797,514 |
#include <iostream>
using namespace std;
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++){
int x, y, z;
cin >> x >> y >> z;
int ma = max(x, max(y, z));
int mi = min(x, min(y, z));
int cen = (ma != x && mi != x ? x ... | #include<stdio.h>
void right_triangle(int x, int y, int z);
int main(void)
{
int n;
scanf("%d", &n);
int i = 0;
int x, y, z;
while (i < n) {
scanf("%d %d %d", &x, &y, &z);
right_triangle(x, y, z);
i++;
}
return 0;
}
void right_triangle(int x, int y, int z)
{
int i, j, k;
i = x * x;
j... | 1 | 23,439,675 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N, M;
cin >> N >> M;
vector... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | 1 | 72,872,123 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N;
cin >> S;
N = S.size();
int x = 0;
for (int i=0; i<N; i++) {
if (S[i] == 'x') {
x++;
}
}
if (x >= 8) {
cout << "NO" << endl;
}
else {
cout << "YES" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
if(s.size()<8){
cout<<"YES"<<endl;
return 0;
}
int win=0;
for(int i=0;i<s.size();i++){
if(s[i]=='o') win++;
}
if(win+(15-s.size())<8){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
}
} | 1 | 13,341,657 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
while (1)
{
int n, x;
cin >> n >> x;
if (n == 0 && x == 0)
{
break;
}
int count = 0;
for (int i = 1; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)... | #include <iostream>
using namespace std;
int main()
{
int n=0,x=0;
cin>>n>>x;
while (n != 0 || x != 0)
{
int count=0;
for(int i=1;i<=n-2;i++)
{
for(int j=i+1;j<=n-1;j++)
{
for(int k=j+1;k<=n;k++)
{
if(i+j... | 1 | 43,114,425 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<declt... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin >> x >> y;
if(abs(x-y)<=1) cout << "Brown" << end... | 1 | 70,578,832 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll gcd(ll a,ll b){
if(b==0){
return a;
}
return gcd(b,a%b);
}
int main() {
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll lcm=c/gcd(max(c,d),min(c,d))*d;
ll l=(a-1)-((a-1)/c+(a-1)/d-(a-1)/lcm);
ll r=b-(b/c+b/d-b/lc... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = ... | 1 | 13,253,123 |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <fstream>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
while(cin>>a>>b>>c,a){
int p[a];
for(int i=0;i<a;++i) cin>>p[i];
sort(p,p+a);
int x=0, y;
for(int i=a-b;i>=a-c;--i)
if(p[i]-p[i-1]>=x) x=p[i]-p[i-1], y=i;
cout<<a-y<<endl;
}
return 0;
} | 1 | 4,900,283 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<tuple<int, int, int>> t(5);
for (int i = 0; i < 5; i++) {
int x;
cin >> x;
t.at(i) = make_tuple(x, (((x + 9) / 10) * 10), ((10 - (x % 10)) % 10));
}
sort(t.begin(), t.end(), [](auto &a, auto &b){
return get... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> V(5);
int ans = 1000;
for(int i = 0; i < 5; ++i) cin >> V[i];
for(int i = 0; i < 5; ++i){
int buf = 0;
for(int j = 0; j < 5; ++j){
if(j != i){
if(V[j] % 10 > 0) buf += 10*(V[j]/10+1);
... | 1 | 70,828,841 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << ... | 1 | 17,176,755 |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n;
cin >> n;
long long a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
if(a[i] == 0){
cout << 0 << endl;
return 0;
}
}
long long ans = 1LL;
for(int i = 0; i < n; i++){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
#define all(x) x.begin(), x.end()
#define allr(x... | 1 | 36,043,952 |
#include <bits/stdc++.h>
#define rep(i, a) for (ll i = 0; i < (a); ++i)
#define pb push_back
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
#define reverse(v) reverse(v.begin(),v.end())
typedef long long ll;
typedef long double la;
usin... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
#define all(v) v.begin(), v.end()
int main(){
ll S;
cin >> S;
cout << 0 << " " << 0 << " " << 1000000000 << " " << 1 << " ";
cout << 10000000... | 1 | 79,678,281 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
ll maxv = a[n - 1];
double half = maxv / 2.0;
auto iter = lower_bound(a, a + n, half);
int i... | #include <iostream>
#include <cstdio>
using namespace std;
int n, mx, m, x, i, j, t, a[100005];
int main()
{
cin >> n;
for (i = 0; i < n; i++) {
scanf ("%d", &a[i]);
mx = max(mx, a[i]);
}
for (i = 0; i < n; i++) {
t = min(a[i], mx - a[i]);
if (t > m) {
m = t;
x = a[i];
}
}
cout << mx << " " << x;
... | 1 | 24,900,374 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin>>a>>b;
if(a.length()>b.length()) cout<<"GREATER";
else if(a.length()<b.length()) cout<<"LESS";
else{
int c1, c2;
bool bb=true;
for(int i=0; a[i]; i++){
if(a[i]==b[i]){}
else{
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 998244353;
signed main(){
cout << std::fixed << std::setprecision(15);
string a,b;
cin>>a>>b;
if(a.size()>b.size()){
cout<<"GREATER"<<endl;
return 0;
}
if(a.size()... | 1 | 50,936,497 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep_start(a,i,n) for(ll i=a;i<=n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define rev1(i,n) for(ll i=n;i>0;i-... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int k, a, b;
cin >> k >> a >> b;
bool ok = false;
for(int i=a; i<=b; i++){
if(i % k == 0) ok = true;
}
if(ok) cout ... | 1 | 44,433,512 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans ... | 1 | 5,953,615 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int C[5];
int main(void){
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
C[a]++; C[b]++; C[c]++; C[d]++; C[e]++; C[f]++;
for(int i=1;i<=4;i++){
if(C[i]>=3){
cout<<"NO"<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
map<int,int> A;
for(int i=0;i<3;i++){
int a,b;
cin>>a>>b;
A[a]++;
A[b]++;
}
for(pair<int,int> i:A){
if(i.second==3){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
} | 1 | 30,304,763 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | 1 | 35,275,582 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K; cin>>N>>K;
int f = N/K;
long long ans = (long long)f*f*f;
if(K%2 == 0){
int h = N/(K/2) - f;
ans += (long long)h*h*h;
}
cout<< ans <<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | 1 | 78,408,545 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
bo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll q,h,s,d;
ll n;
cin >> q >> h >> s >> d >> n;
ll ans = 0;
ans += (n/2)*(min({8*q,4*h,2*s,d}));
n -= (n/2)*2;
ans += (n/1)*(min({4*q,2*h,s}));
cout << ans << endl;
} | 1 | 76,798,722 |
#include <iostream>
#include <cmath>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main(){
int ans[26];
int tmp[26];
int n;
cin>>n;
rep(i,26)ans[i]=0;
rep(i,n){
string s;
cin>>s;
rep(i,26)tmp[i]=0;
for(int... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 70,466,511 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <utility>
#include <climits>
#include <string>
typedef long long ll;
using namespace std;
void solve(){
string s, p;
cin >> s >> p;
for(int i = 0; i < s.length(); i++){
string str;
if(i < s... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string s, p;
cin >> s >> p;
int a=0, count;
for (int i=0;i<=s.size();i++)
{
count=0;
if (p[0] == s[i])
{
for (int j=0;j<=p.size()-1;j++)
{
if (s.size() > i+j)
{
if (s[i+j] != p[j])
{
count++;
}
... | 1 | 98,173,669 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << x2 - (y2 - y1) << " " << y2 + (x2 - x1) << " " << x2 - (y2 - y1) - (x2 - x1) << " " << y2 + (x2 - x1) - (y2 - y1);
} | #include<iostream>
using namespace std;
int main(){
int x1,y1,x2,y2,x3,y3,x4,y4;
cin >> x1 >> y1 >> x2 >> y2;
x3=x2+y1-y2;
y3=y2-x1+x2;
x4=x1-y2+y1;
y4=x2-x1+y1;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
} | 1 | 83,420,784 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 1 | 50,498,330 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,a,b;
cin>>x>>a>>b;
if(b<=a)
{
cout<<"delicious\n";
}
else if(b>a)
{
if(b-a<=x)
{
cout<<"safe\n";
}
else
{
cout<<"dangerous\n";
}
}
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 1 | 87,703,923 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using Graph = std::vector<std::vector<int>>;
u... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int a,b,k; scanf("%d%d%d",&a,&b,&k);
rep(i,k){
if(i%2==0){
if(a%2==1) a--;
b+=a/2;
a/=2;
}
else{
if(b%2==1) b--;
a+=b/2;
b/=2;
}
}
printf("%d %d\n",a,b);
return 0;
} | 1 | 2,721,260 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int main(){
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> X(N);
rep(i, N){
cin >> X[i].first >> X[i].... | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define all(a) (a)... | 1 | 9,457,967 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a;
cin>>b;
cin>>c;
cin>>d;
if(a<=b){
if(c<=d){
cout<<a+c;
}
else{
cout<<a+d;
}
}
else{
if(c<=d){
cout<<b+c;
}
else{
cout<<b+d;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int a,b,c,d; cin >> a >> b >> c >> d;
cout << min(a,b) + min(c,d) << en... | 1 | 42,143,757 |
#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
using namespace std;
int main(){
int count=0;
string s;
cin>>s;
char temp=s[0];
for(int i=1;i<s.length();i++){
if(s[i]!=temp){
count++;
}
temp=s[i];
}
if (count==0){
cout<<0;
}else... | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
string S;
cin >> S;
int m=0;
for (int i=0; i<S.size()-1; i++) {
if (S[i]!=S[i+1]) {m++;}
}
cout << m << endl;
} | 1 | 60,439,652 |
#include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i,n) for(int i=0;i<n;++i)
#define fore(i,a,b) for(int i=a;i<=b;++i)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define vv vector<int>
#define endl "\n"
#define test(i) cout<<i<<endl
#define ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int m=a-b;
if(m>c)
{
cout<<0<<endl;
}
else
{
cout<<c-m<<endl;
}
exit(0);
} | 1 | 98,346,930 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<... | #include <bits/stdc++.h>
using namespace std;
using ll= unsigned long long;
#define double long double
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _set(x) __builtin_popcount(x)
#define _setl(x) __builtin_popcountll(x... | 1 | 72,492,656 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void debug(string t, T input) {
cout<<t<<"-> "<<input<<"\n";
}
template <typename T>
void debug(int i,string t, T input) {
cout<<"Case#"<<i<<" "<<t<<"-> "<<input<<"\n";
}
const long long mod=1e9+7;
lo... | #include<bits/stdc++.h>
using namespace std;
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define pll pair<ll,ll>
#define pii pair<int,int>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FO ifstream fin("a.in");ofstream... | 1 | 96,980,631 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define pb push_back
#define fi first
#define se second
#define MAXN 200064
#define mod 1000000007
#define... | #include<iostream>
#include<vector>
#include<deque>
using namespace std;
const int MAX=1e5+5;
const int inf=100000000;
deque<int>q;
vector<int>e[MAX];
int a[MAX];
int v[MAX];
int book[MAX];
int ans[MAX];
void bfs()
{
int p;
while(!q.empty())
{
p=q.front();
q.pop_front();
for(int i=0;i<a[p];i++)
{
if(!book... | 1 | 83,016,663 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
cin >> s;
if(s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I')
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
string yaki = "YAKI";
if (S.size() < 4) {
flag = false;
} else {
for (int i; i < 4; i++) {
if (S.at(i) != yaki.at(i)) {
flag = false;
}
}
}
if (flag) {
cout << "Yes" << ... | 1 | 84,941,705 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main(){
int H, W, D, Q;
cin >> H >> W >> D;
vector<vector<int>> A(H, vector<int>(W));
vector<pair<int, int>> pa(W * H);
rep(i, 0, H){
rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 1 | 70,684,856 |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const long long int mod = 1000000007;
int main()
{
ll n,m;
cin>>n>>m;
float f=(float)m/n;
if(f>500)
cout<<"No";
else
cout<<"Yes";
} | 1 | 74,273,104 |
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int h,w,n;
cin >> h >> w >> n;
set<pii> st,table;
for(int i=1;i<=n;i++) {
int x,y;
cin >> x >> y;
for(int i=-2;i<=0;i++)
for(int j=-2;j<=0;j++) {
int nx = x + ... | #include <bits/stdc++.h>
using namespace std;
int main(){
long h,w,n;
cin >> h >> w >> n;
map<pair<long,long>,long> mp;
for(int k=0;k<n;k++) {
long a,b;
cin >> a >> b;
a--;
b--;
for(int i=0;i<3&&a-i>=0;i++){
for(int j=0;j<3&&b-j>=0;j++) mp[make_pair(a-i,b-j)]++;
}
}
vector<lon... | 1 | 28,068,692 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef dou... | #include "bits/stdc++.h"
using namespace std;
bool dp[2][16001];
int main() {
string s;
cin >> s;
int x, y;
cin >> x >> y;
vector<int> X, Y;
int pos = 0;
while (pos < s.size() && s[pos] == 'F') pos++, x--;
bool moveX = 1;
int d = 0;
while (pos < s.size()) {
if (s[pos] == 'F') {
d++;
}
else {
if (m... | 1 | 9,666,619 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, long long K, std::vector<long long> a, std::vector<long long> b) {
vector<ll> bucket(1e5 + 1);
rep(i, N) { bucket[a[i]] += b[i]; }
ll prevcnt = 0;
for (ll i = 1... | 1 | 43,503,768 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
#endif
int a,b;
cin>>a>>b;
int i=1;
int ans=-1;
while(true)
{
int r1=floor(i*0.08);
int r2=floor(i*0.1);
if(r1==a && r2==b)
{
ans=i;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int a, b, res = INT_MAX;
cin >> a >> b;
for(int i = 1; i <= 10000; ++i)
{
int x = i * 0.08;
int y = i * 0.1;
if(x == a && y == b)
res = min(res, i);
}
cout << (res == INT_MAX ? -1... | 1 | 85,455,224 |
#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 s;
cin >> s;
int res = 0;
res = pow(10,9);
for(int i = 0;i < s.size()... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans, t;
cin >> s;
ans = 1000;
for ( int i = 2;i < s.size(); i++ ) {
t = (s[i-2] - '0') * 100 + (s[i-1] - '0') * 10 + s[i] - '0';
ans = min(ans, abs(t-753));
}
cout << ans << endl;
return (0);
} | 1 | 55,712,109 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <bits/stdc++.h>
using namespace std;
bool first(pair<long int, long int> a, pair<long int, long int> b) {
if (a.first != b.first) return a.first < b.first;
else return a.second < b.second;
}
int main(){
int N, K;
cin >> N >> K;
vector<pair<long int, long int>> point(N);
for (int i = 0; ... | 1 | 40,636,056 |
#include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair... | #include <bits/stdc++.h>
#include <string>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static ... | 1 | 72,073,269 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x) for (auto&& v : (x))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
int m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
int a[n],b[n];
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
int line[n];
rep(i,n) line[i] = i+1;
int count = 1;
int ansa = 0, ansb = 0;
bool flag = tr... | 1 | 69,572,978 |
#include <iostream>
#include <sstream>
int main(int argc, char const *argv[]) {
short m, f, r;
std::string Result;
while (true) {
while (true) {
std::string Param;
getline(std::cin, Param);
std::istringstream iss(Param);
iss >> m >> f >> r;
if (m < -1 || m > 50 || f < -1 || f > 5... | #include<iostream>
using namespace std;
char appreciation(int mid,int last,int re) {
int sum = 0;
if ((mid == -1) || (last == -1)) return 'F';
sum = mid + last;
if (sum >= 80) {
return 'A';
} else if (sum < 80 && sum >= 65) {
return 'B';
} else if (sum < 65 && sum >= 50) {
... | 1 | 79,592,932 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll arr[250000],n;
bool comp(ll a,ll b)
{
return a>b;
}
ll segment(ll i)
{
if(i==n)
return i-1;
if(arr[i]!=arr[i+1])
return i;
return segment(i+1);
}
int main()
{
ll tc,m,i,a=1,b,flag=0,cnt=0;
cin>>n;
for(i=0;i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long int n;
cin>> n;
vector<long long int> vec;
long long int input;
for(int i=0; i < n; i++)
{
cin>> input;
vec.push_back(input);
}
sort(vec.begin(),vec.end());
reverse(vec.begin(),vec.end());
long long in... | 1 | 57,835,466 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
int b;
cin >> a >> b;
if ( a*b%2 == 0 )
cout << "Even" << endl;
if ( a*b%2 == 1 )
cout << "Odd" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 1 | 42,769,074 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<tuple>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define sc... | #include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff firs... | 1 | 78,819,159 |
#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 n;
cin >> n;
vector<double> a(n);
rep(i, n) cin >> a[i];
double ans = 0.0;
rep(i, n) ans += 1.0 / a[i];
ans = 1.0 / ans;
printf("... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
double sum = 0;
rep(i, n) {
double a;
cin >> a;
sum += 1 / a;
}
printf("%12f", 1 / sum);
} | 1 | 7,430,738 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a, b; cin >> a >> b;
double x; cin >> x; x /= (a*a);
if(x<=(b/2)){
double y = 2*a*x / b;
double res = acos(y/(sqrt(b*b+y*y)));
res = res*180/M_PI;
cout << fixed << setprecision(15) << res << endl;
}
else... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 1 | 17,844,211 |
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> P;
vector<ll> C;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int64_t M_score = -2000000000LL;
scanf("%d %d", &n, &k);
vector<int> p(n + 1), c(n + 1);
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= n; i++) cin >> c[i];
for(int i = 1; i <= n; i++) {
int move = 0, masu = i;
in... | 1 | 37,233,554 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
int a,b; cin >> a >> b;
cout << ((a*3)+b)/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int a,p;
cin>>a>>p;
int ans;
ans=3*a+p;
ans/=2... | 1 | 92,522,848 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main(int argc, char *argv[]){
long double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
long double distance = sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
cout << fixed << std::setprecision(8) << distance << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(){
double a,b,c,d,r;
cin >> a >> b >> c >> d;
r = (a-c)*(a-c)+(b-d)*(b-d);
printf("%.4lf\n",sqrt(r));
return 0;
} | 1 | 73,606,653 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
ll SUM(ll n){
return n*(n+1)/2;
}
int main(){
ll X;
cin >> X;
ll sum=0;
for(ll i=1; i<=X; i++)
sum+=SUM(X/i)*i;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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& a, T b) {
if (a > b) { a = b; return 1; }
r... | 1 | 11,557,907 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 10000000... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-ffloat-store")
#pragma GCC optimize ("-fno-defer-pop")
#define all(a) a.begin(),a.end()
#define bs binary_search
#define ll long long int
#define ld long double
ll power(ll a,ll b,ll... | 1 | 37,780,294 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void ans(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
const ll INF=1001001001;
const ll mod=10000000007... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
LLI x, y, ans = 0;
cin >> x >> y;
while( x <= y )
{
x *= 2;
ans++;
}
cout << ans;
} | 1 | 12,436,854 |
#include <iostream>
#include <algorithm>
#include <cstdio>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
if(a > b) std::swap(a, b);
if(b > c) std::swap(b, c);
if(a > b) std::swap(a, b);
printf("%d %d %d\n", a, b, c);
return 0;
} | #include "iostream"
using namespace std;
int main()
{
int n[3];
cin >> n[0] >> n[1] >> n[2];
if (n[0] > n[1]) {
int m = n[0];
n[0] = n[1];
n[1] = m;
}
if (n[1] > n[2]) {
int m = n[1];
n[1] = n[2];
n[2] = m;
}
if (n[0] > n[1]) {
int m = n[0];
n[0] = n[1];
n[1] = m;
}
cout << n[0] << " " << n[1... | 1 | 71,733,978 |
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | 1 | 68,426,363 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007;
const ll INF = 10000000000000;
ll kaizyo(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
sum *= i;
sum = sum % ATCODER_A... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,C,K;
cin >> N >> C >> K ;
vector<int> T(N);
for(int i=0; i<N; i++){
cin >> T.at(i);
}
sort(T.begin(),T.end());
int bus_cnt = 0;
for(int i=0; i<N;){
int start = T.at(i);
int time = start;
int ... | 1 | 53,722,136 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 1 | 20,238,954 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double n,d;
int cnt=0;
cin >> n >> d;
vector<vector<double>> x(n , vector<double>(d));
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
cin >> x.at(i).at(j);
}
}
double sum;
for(int i=0; i<n; i++){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,d;
cin>>n>>d;
int x[n][d];
int cnt=0;
rep(i,n)rep(j,d)cin>>x[i][j];
int ians=0;
double fans=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<d;k++){
ians+=(x[i][k]-x[j... | 1 | 78,946,451 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 1e8;
int main(){
int n, m, R;
cin >> n >> m >> R;
vector<int> r(R);
rep(i,R) cin >> r[i], r[i]--;
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
const ll mod = 1000000007;
const ll inf = 1LL<<60;
int main()
{
int n,m,p;cin>>n>>m>>p;
vector<ll> r(p);
rep(i, p) {
cin>>r[i];
r[i]--;
}
sort(r.begin(),r.end());
vector<vector<ll>> d(... | 1 | 43,219,276 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | #include<iostream>
#include<string>
using namespace std;
int main(){
string str[9];
str[0] = ".,!? ";
str[1] = "abc";
str[2] = "def";
str[3] = "ghi";
str[4] = "jkl";
str[5] = "mno";
str[6] = "pqrs";
str[7] = "tuv";
str[8] = "wxyz";
string a;
int h,t = 0;
cin >> h;
while (t < h) {
cin >> ... | 1 | 50,215,170 |
#include <iostream>
using namespace std;
void Solution()
{
int n;
int m =1;
while(cin>>n, n)
{
cout<<"Case "<<m<<": "<<n<<endl;
m++;
}
}
int main()
{
Solution();
return 0;
} | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
for(int i=1;;i++){
int x;
scanf("%d",&x);
if(x){
printf("Case %d: %d\n",i,x);
}else{
... | 1 | 56,600,768 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int H, W;
cin >> H >> W;
vector<string> C(H... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
for (int i=0; i<H; i++){
vector<char> vec(W);
for (int j=0; j<W; j++){
cin >> vec.at(j);
}
for (int j=0; j<2; j++){
for (int k=0; k<W; k++){
cout << vec.at(k);
}
cout << endl;
}
... | 1 | 39,467,676 |
#include<iostream>
using namespace std;
void solve()
{
string S,T;
cin>>S>>T;
T.pop_back();
if(S==T)
{
cout<<"Yes"<<endl;
}
else
{ cout<<"No"<<endl;
}
}
int main()
{
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
string s;
cin>>s;
string t;
cin>>t;
string ans="";
for(int i=0; i<t.size()-1; i++)
ans+=t[i];
if(ans==s)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | 1 | 50,894,397 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
usi... | #include <iostream>
#include <cstdio>
#include <vector>
#define N 1005
using namespace std;
typedef long long ll;
ll n, mx, x[N], y[N];
vector<ll> a;
ll Abs(ll p) {return p > 0 ? p : -p;}
int main()
{
ll i, j, t;
cin >> n;
for (i = 0; i < n; i++) {
scanf("%lld %lld", &x[i], &y[i]);
t = Abs(x[i]) + Abs(y[i]);
i... | 1 | 90,735,206 |
#include<iostream>
using namespace std;
int main(){
while(1){
int d,c;
cin >> d >>c;
if(d==0 && c==0)break;
for(int i=0;i<c;i++){
cout<<"#";
}
cout<<"\n";
for(int j=0+1;j<d-1;j++){
cout<<"#";
for(int j=0+1;j<c-1;j++){
... | #include <iostream>
using namespace std;
int main(){
int i,l,H,W;
for(;;){
cin >> H >> W;
if(H==0 && W ==0)return 0;
for(i=0; i<H; i++){
for(l=0; l<W; l++){
if(i==0 || i==H-1)
{
cout << "#";
}
else if (i!=0 || i!=H-1)
{
if(l==0 || l==W-1){
cout << "#";
}
... | 1 | 22,056,867 |
#include <iostream>
using namespace std;
int main() {
char str[21] = "";
cin>>str;
for (int i=19;i>=0;i--) {
if (str[i]!=NULL)
cout<<str[i];
}
cout<<endl;
return 0;
} | #include <cstdio>
#include <cstring>
using namespace std;
int main() {
char s[21];
scanf("%s", s);
for (int i=strlen(s)-1;i>=0;i--) putchar(s[i]);
putchar('\n');
return 0;
} | 1 | 82,540,641 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
typedef long long ll;
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin >> s >> t... | 1 | 59,362,160 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1'000'000'007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 1 | 32,651,870 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rev(x) greater<x>()
#define MOD 1000000007
#define INF 1000000000
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.second < b.s... | 1 | 69,361,650 |
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | 1 | 9,140,990 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 100005;
const ll MOD = 1e9+7;
ll dp[MAX_N][2];
int main()
{
string L;
cin >> L;
int N = L.size();
dp[0][0] = 2; dp[0][1] = 1;
rep(i,N-1)
{
if (L[i+1] == '1')... | 1 | 646,230 |
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long a[2005];
void sq()
{
a[0]=a[1]=a[2]=1;
for(int i=3;i<=2000;i++)
a[i]=(a[i-3]+a[i-1])%mod;
}
int main()
{
int n;
cin>>n;
sq();
if(n<3)
cout<<0<<endl;
else
cout<<a[n-3]<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define vii vector<int>
#define vcc vector<char>
#define pll pair<long long, long long>
#define mem memset
#define sof sizeof
#define co1 __builtin_popcountll
#define P... | 1 | 5,452,103 |
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long prefix[n + 1];
prefix[0] = 0;
for (int i = 1; i <= n; ++i) {
scanf("%lld", &prefix[i]);
prefix[i] += prefix[i - 1];
}
long long min = abs(2 * prefix[1] - prefix[n]);
long long temp;
for (int i = 2; i < n; ++i) {
temp ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int N; cin >> N;
vector<long long> a(N + 1); for (int i = 1; i <= N; i++) cin >> a[i];
for (int i = 2; i <= N; i++) a[i] += a[i - 1];
long long ans = 200000000000001;
for (int i = 1; i < N; i++) ans =... | 1 | 84,861,297 |
#include<iostream>
using namespace std;
int main()
{
int m, f, r, sum;
while(1)
{
cin >> m >> f >> r;
if ( m == (-1) && f == (-1) && r == (-1) )break;
else{
sum = m + f;
if ( m != (-1) && f != (-1) && sum >= 80)cout... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int m, f, r;
while(1) {
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1) break;
st... | 1 | 66,133,423 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define cerr if(1)cerr
#define size(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define temptts template <class T, class... Ts>
const int N = 55, mod = 1e9 + 7, inf = 2e9;
int n;
ll ans = 0, a[N];
int main() { cin.tie(0)->sync_with_stdio(0);
ci... | 1 | 47,027,421 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
int main() {
string o, e;
cin >> o >> e;
if (o.size() == e.size()) {
rep(i, o.size()) {
cout << o[i] << e[i];
}
} else {
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string o, e;
cin >> o >> e;
rep(i, min(o.size(), e.size())) { cout << o[i] << e[i]; }
if (o.size() > e.size()) cout << o[o.size() - 1];
if (o.size() < e.size()) cout << e[e.size() - 1];
cout << endl;
r... | 1 | 64,621,846 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t,n;
cin>>n>>t;
vector<int>v(t);
long long cnt=0;
for(int i=0;i<t;i++)
{
cin>>v[i];
cnt+=v[i];
}
if(cnt>=n)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | 1 | 92,986,842 |
#include <iostream>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef long long ll;
typedef... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1<<30;
int main(){
int h, w;cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
string s;cin>>s;
if(s=="snuke")cout<<char('A'+j)<<i+1<<endl;
}
}
} | 1 | 58,124,280 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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& a, T b) { if (a > b) { a = b; return 1; } re... | #include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int read(){
int x=0;
char ch=getchar();
while(!isdigit(ch)) ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x;
}
const int N = 100005;
typedef long long ll;
int n,m,v,p;
int a[N];
ll s[N];
bool cmp(int x,int y) { retur... | 1 | 90,081,041 |
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int lmax = l[0], rmin = r[0];
for (int i = 1; i < m; i++) {
if (lmax < l[i]) lm... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#de... | 1 | 98,662,384 |
#include <iostream>
#include <string>
#include <cstdint>
using namespace std;
int main() {
uint64_t a; cin >> a;
string b; cin >> b;
cout << (a * ((b[0] - '0') * 100 + (b[2] - '0') * 10 + (b[3] - '0') * 1) / 100) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t a;
long double b;
cin >> a >> b;
int64_t b100 = (int64_t)(b * 100 + 0.001);
cout << (int64_t)(a * b100) / 100 << endl;
} | 1 | 46,478,864 |
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int h, w;
vector<string> m;
int bfs() {
vector<vector<int>> cost(h, vector<int>(w, -1));
queue<pair<int, int>> que;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
if (m[i][j]=='#') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
vi dy = { 0,0,1,-1 };
v... | 1 | 69,840,539 |
#include <iostream>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[])
{
int money;
while( cin >> money, money ){
int coin_count=0;
int rest =1000;
rest -= money;
int tmp =0;
... | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | 1 | 49,572,364 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | 1 | 2,316,295 |
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int>v[10000];
vector<bool>vis(10000);
stack<int>order;
void dfs(int u){
vis[u]=1;
for(auto i:v[u]){
if(!vis[i])dfs(i);
}
order.emplace(u);
}
int main(){
cin>>n>>m;
while(m--){
int l,r;
cin>>l>>r;
v[l].emplace_back(r);
}
for(int i=0;i<n;i++){
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<29);
vector<int> G[MAX];
list<int> out;
bool V[MAX];
int N;
int indeg[MAX];
void dfs(int u) {
V[u] = true;
for (int i = 0; i < G[u].size(); i++)... | 1 | 11,810,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> v = {2,5,5,4,5,6,3,7,6};
int n,m;
cin >> n >> m;
... | #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 | 77,550,283 |
#include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
string s;
cin >> s;
vector<int> num(26);
vector<int> coun... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
string s;
int i;
cin >> s;
bool can[26];
for(i=0; i<26; i++)
can[i] = false;
for(i=0; i<s.length(); i++){
for(char c='a'; c<='z'; c++){
if(s[i] == c){
can[s[i] - 'a'] = true;
break;
}
}
... | 1 | 37,376,143 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.