code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll x, y, i;
int main() {
cin >> x >> y;
if(x%y==0) return puts("-1")*0;
for(i=2; ; i++) {
if(x*i<0) return puts("-1")*0;
if(x*i%y) break;
}
cout << x*i;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >>a>>b;
if(a%b==0){
cout<<-1<<endl;
return 0;
}
for(int i=a;i<=1000000000;i=i+a){
if(i%b!=0){
cout<<i<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
} | 1 | 31,696,947 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) c... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
void run() {
int n;
cin >> n;
vector<int> a(n);
vector<int> has(1000001), cnt(1000001);
for (int i = 0; i < n; i++) {
cin >> a[i];
++has[a[i]];
}
for (int i = 1; i <= 1000000; i++) if (has[i]) {
for ... | 1 | 29,967,439 |
#include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | #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, p;
scanf("%d%d", &n, &p);
int m = 0;
rep(i, n) {
int a;
scanf("%d", &a);
if(a % 2 == 1) m++;
}
if(m == 0) {
if(p == 0) printf("%lld\n", 1ll << n);
else printf("0\n... | 1 | 12,990,681 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #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 a,b;
cin >> a >> b;
int counts = 0;
for(int i = a; i <= b; i++){
string s = to_string(i);
if(s[0] == s[4] && s[1] == s[3]) counts++;
}
cout << counts << e... | 1 | 63,063,834 |
void solve();
int main() {
solve();
return 0;
}
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
using namespac... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for(int i = 0; i < (a); ++i)
#define pb push_back
#define sz(x) (int)x.size()
#define f first
#define s second
ll mod=1e9+7;
ll... | 1 | 65,975,331 |
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
struct point{
float x,y;
};
void kehe(point a,point b,int n){
if(n==0){
if(fabs(a.x-0.0)<0.000001)printf("%.6f %.6f\n",a.x,a.y);
printf("%.6f %.6f\n",b.x,b.y);
}
else{
double pi=M_PI/3.0;
point ... | #include<iostream>
#include<cmath>
using namespace std;
struct Point {double x, y; };
void coch(Point p1, Point p2, int n) {
double th = M_PI * 60.0 / 180.0;
if (n == 0)
return;
Point s, t, u;
s.x = (2 * p1.x + p2.x) / 3;
s.y = (2 * p1.y + p2.y) / 3;
t.x = (p1.x + 2 * p2.x) / 3;
t.y = (p1.y + 2 * p2.y... | 1 | 75,830 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | 1 | 47,670,247 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
#include <ctime>
using namesp... | #include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
#define MAX_N (105)
int n;
bool G[MAX_N][MAX_N];
int dist[MAX_N];
int main()
{
queue<int> q;
scanf("%d", &n);
for ( int i = 1; i <= n; i++ ) {
int u, k;
scanf("%d %d", &u, &k);
for ( int j = 0; j < k; j++ ) {
int d;
sc... | 1 | 41,396,875 |
#include <stdio.h>
#include <string.h>
void deleteFirst(int**);
void deleteLast(int**);
void insertOne(int**, int**, int, int);
bool deleteOne(int**, int**, int);
int main(void){
int xs[2000001] = {};
int* default_ptr = xs + 2000000;
int* fp = default_ptr;
int* lp = default_ptr;
int len = 0;
int... | #include <cstdio>
#include <list>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
char s[15];
list<int>l;
while(n--){
int m;
scanf("%s", s);
if(s[0] == 'i'){
scanf("%d", &m);
l.push_front(m);
}
... | 1 | 47,157,559 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,m;
cin >> a >> b >> m;
vector <int> priceA(a),priceB(b),x(m),y(m),c(m);
int niceA = -1,niceB = -1;
int minA = -1, minB = -1;
for(int i = 0; i < a; i++){
cin >> priceA[i];
if(i==0){
minA = priceA[i];
... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 1 | 65,626,925 |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1,... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<cfloat>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FO... | 1 | 95,690,002 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | 1 | 69,559,856 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m... | #include<bits/stdc++.h>
using namespace std;
int main() {
set<char> letters;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
letters.insert(s[i]);
}
if (letters.size() == 2) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
return 0;
} | 1 | 2,704,887 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(1, 1);
for (int i = 6; i <= ... | 1 | 7,508,404 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 1 | 89,359,487 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(void){
int a,b,d,r;
double a1,b1,f;
cin >> a >> b;
d = a / b;
r = a % b;
a1 = (double)a;
b1 = (double)b;
f = a1 / b1;
cout << d << " " << r << " ";
printf("%lf\n",f);
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
unsigned long a, b;
cin >> a >> b;
cout << a/b << ' ' << a%b;
printf(" %.6f\n", (double)a/(double)b);
} | 1 | 49,295,031 |
#include <iostream>
using namespace std;
int main() {
int n;
long long x = 1;
cin >> n;
for (int i=2; i<=n; i++) {
x *= i;
}
cout << x << endl;
} | #include <iostream>
long long int fractorial(int n){
if(n == 0)
return 1;
else
return n*fractorial(n-1);
}
int main() {
int n;
std::cin >> n;
std::cout << fractorial(n) << std::endl;
return 0;
} | 1 | 70,206,205 |
#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<(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 vector<ll> vl;
... | #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... | 1 | 95,569,169 |
#include<bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
#define Twovec(a,n,m) vecto... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | 1 | 52,982,745 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, clas... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n,k;
cin >> n >> k;
string s;
cin >> s;
vector<int> cnt(n,0);
int idx = 0;
int c = 1;
if (s[0] == '0') {
cnt[0] = 0;
... | 1 | 60,419,923 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,t,ans=0;
cin >> a>>b>>c;
while(1){
t=c;
t%=a;
if(t==0) {ans++;};
if (b==a) break;
a++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a , b, c, i, j;
cin >> a >> b >> c;
i = 0;
for(j = a;j < b + 1;j++)
{
if (c % a == 0)
{
i++;
}
a++;
}
if(a == 0 && b == 0)
{
cout << 0 << endl;
}
else
{
cout << i << endl;
}
return 0;
} | 1 | 84,261,761 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
int Q;
ll solve(ll a, ll b) {
if (a > b) {
swap(a, b);
}
if (b - a <= 1) {
return 2 * a - 2;
}
ll c = sqrt(a * b);
if (c * c == a * b) {
c--;
... | #include<cmath>
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int T;
long long int a,b;
scanf("%d",&T);
while(T--){
scanf("%lld%lld",&a,&b);
if(a>b) swap(a,b);
if(a==b) printf("%lld\n",2*a-2);
else if(a+1==b) printf("%lld\n",2*a-2);
else{
long long int c=sqrt(a*b);
if(c*c==a*b... | 1 | 84,794,284 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
vector<int> to[200005];
const int MAX=1000000000;
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
a--;b--;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,a,b) for (int i = (a); i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main () {
int N, M;
cin >> N >> M;
int a[M], b[M];
se... | 1 | 45,652,903 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>a(n);
int b=0;
for(int i=0;i<n;i++){
cin>>a.at(i);
b=max(b,a.at(i));
}
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(a.at(i)==b){
c++;
}
else{
d=max(d,a.at(i));
}
}
for(int i=0;i... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 71,611,694 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
int main(){
string S;
cin >> S;
int N=S.size();
int red=0, blue=0;
rep(i,N){
if(S[i]=='0') red++;
else blue++;
}
cout << min(red,blue)*2 << endl;
return 0;
} | 1 | 52,191,089 |
#include<stdio.h>
#include<algorithm>
#include<string>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
#define REP(i,n) for(long long int (i)=0;(i) < (n);(i)++)
int n,m;
char from,to,tmp;
int main(){
cin >> n;
while(n){
map<char,char>dict;
REP(i,n){
cin >> ... | #include<iostream>
#include<map>
#include<string>
#include<cstdio>
using namespace std;
int main()
{
map<char,char> mp;
int n,m;
char od,nw;
while(1){
mp.clear();
scanf("%d",&n);
if(n == 0)break;
while(n--){
scanf(" %c %c",&od,&nw);
mp[od] = nw;
}
scanf(" %d",&m);
char an... | 1 | 47,987,143 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll t,p,q,x,c1,c2,c3,d,e,f;
ll n,m,z;
vector<ll>v;
cin>>n>>m>>z;
if(z<=m) cout<<"delicious"<<endl;
else if(z>n+m) cout<<"dangerous"<<endl;
else if(z>m && z<=(n+m)) cout<<"safe"<<endl;
} | 1 | 92,870,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_boun... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 10000;
for(int i=0; i<s.size()-2; i++)
{
string subs = s.substr(i, 3);
int a = atoi(subs.c_str());
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
return 0;
} | 1 | 20,570,886 |
#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 <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 | 89,973,872 |
#include <bits/stdc++.h>
using namespace std;
int n;
int t[105], v[105];
vector <int> lim;
double dp[40005][205];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++ i) scanf("%d", &t[i]);
for (int i = 0; i < n; ++ i) scanf("%d", &v[i]);
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < 2 * t[i]; ++ j) {
... | #include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int N;
cin >> N;
int T[110] = {};
int V[110] = {};
int S[110] = {};
for(int i = 1; i <= N; i++){
cin >> T[i];
S[i] = S[i-1] + T[i] * 2;
}
for(int i = 1; i <= N; i++){
cin >> V[i];
}
int A[40010] = {};... | 1 | 6,299,495 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(void){
int N,C,K;
int T[100000];
int cnt = 0;
scanf("%d%d%d",&N,&C,&K);
for(int i = 0; i < 100000; i++){
scanf("%d",&T[i]);
}
sort(T, T + N);
for(int i = 0; i < N; i++){
int c = C -1;
int max_ti... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 1 | 34,648,847 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
if(S.at(0)!='k'){
if(S.substr(S.size()-7,7)=="keyence") cout << "YES" << endl;
else cout << "NO" << endl;
}
else if(S.at(S.size()-1)!='e'){
if(S.substr(0,7)=="keyence... | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include<set>
#include<queue>
#include <iomanip>
typedef long long ll;
#de... | 1 | 82,662,762 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,start,end) for(int i=(start);i<=(end);i++)
#define all(n) begin(n),end(n)
#define DEBUG
int ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
puts(a + b >= c ? "Yes" : "No");
return 0;
} | 1 | 33,239,378 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
int ans=n/3;
cout << ans << endl;
} | 1 | 30,753,869 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
const int MOD = 1000000007;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
int main() {
ll a,b; cin >> a >> b;
cout << (ll)LCM(a,b);
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int a,b;
cin>>a>>b;
long long int k=__gcd(a,b);
cout<<(a*b)/k<<endl;
return 0;
} | 1 | 25,720,079 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
const int maxn = 200000;
ll mod = INF;
ll a[maxn];
ll n;
int main(){
cin >> n;
rep(i,n)cin >> a[i];
sort(a,a+n);
rep(i,n-1){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
set<int> s;
rep(i,n) {
int a;
cin >> a;
s.insert(a);
}
if(s.size() == n)
cout << "YES" << endl;
else
cout << "NO" << endl;
re... | 1 | 96,269,035 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A;
int min_a = INT_MAX;
int max_a = -INT_MAX;
rep(i, N) {
cin >> A;
min_a = min(min_a, A);
max_a = max(max_a, A);
}
cout << max_a - min_a << end... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
v... | 1 | 40,683,229 |
#include<iostream>
using namespace std;
#include<stdio.h>
#include<string>
void max_heapify(int* A, int i, int H)
{
int l = 2 * i, r = 2 * i + 1;
if(l > H && r > H) return;
int maxid = i, x;
if(l <= H) maxid = (A[l] > A[maxid] ? l : maxid);
if(r <= H) maxid = (A[r] > A[maxid] ? r : maxid);
if(ma... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s;
priority_queue<int> pq;
while (cin >> s, s != "end") {
if (s == "insert") {
cin >> n;
pq.push(n);
}
else {
cout << pq.top() << endl;
pq.pop();
}
}
return 0;
} | 1 | 43,817,324 |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=2e5;
int dep[N],f[20][N],fst[N],to[N],n,L,q,x[N],mm,sum[N];
int query(int l,int r)
{
int ans=0;
for(int i=17;i>=0;i--)if(f[i][l]&&f[i][l]<r)ans+=1<<i,l=f[i][l];
return ans+(l!=r);
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",x+i... | #include<bits/stdc++.h>
using namespace std;
#define maxn 100005
int n,l,q,x[maxn],fa[maxn][18],sum[maxn],summ;
inline void pre()
{
register int i,j=2;
for(i=1;i<=n;++i)
{
while(summ+sum[j]-sum[j-1]<=l&&j<=n) summ+=sum[j]-sum[j-1],++j;
fa[i][0]=j-1;
summ-=sum[i+1]-sum[i];
}
for(i=1;i<=17;++i)
for(j=1;j<=n;... | 1 | 56,977,135 |
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define dou... | #include<iostream>
using namespace std;
int main()
{
int n,k,count=0;
cin>>n>>k;
while(n>=k)
{
count++;
n--;
}
cout<<count;
} | 1 | 35,222,532 |
#include<iostream>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define chmin(a,b) (a>(b)?a=(b),1:0)
#define abs(n) max((n),-(n))
#define dist(a,b) max((a)-(b),(b)-(a))
#define chmax(a,b) (a<(b)?a=(b),1:0)
#define repa(i,a,n) for(int i=(a)... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll n, m;
cin>>n>>m;
ll f = 1, s = n;
bool ok = false;
if(n&1){
ll cur = 0;
... | 1 | 19,781,828 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, m;
int cnt[101] = {0};
while(cin >> n){
cnt[n]++;
}
m = *max_element(cnt+1, cnt+101);
for(int i=1; i<101; i++){
if(cnt[i] == m){
cout << i << endl;
}
}
return 0;
} | #include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
using namespace std;
int main() {
vector<int> s,t;
int a,i,j,k,l,len;
int max = 0;
for (i = 0; i <= 100; i++) {
s.push_back(0);
}
while (cin >> a) {
s[a] += 1;
}
for (j = 0; j <= 100; j++) {
if (max < s[j]) {
max = s[j];
}
}
for... | 1 | 17,687,001 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#define Emax 9900
#define Vmax 100
#define Dmax (10000000)
#define INF (100000000000L)
using namespace std;
typedef unsigned int uint;
typedef long long int llint_t;
struct Edge {
int from, to, cost;
};
Edge edges[Emax];
static llint_t d[Vmax][... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vi=vector<int>;
using vb=vector<bool>;
using pii=pair<int,int>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;... | 1 | 70,447,478 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void)
{
int n;
cin >> n;
int cnt = 0;
while(n)
{
int rem = n % 10;
if(rem == 7)
cnt++;
n /= 10;
}
if(cnt)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin>>s;
if(s[0]=='7' || s[1]=='7' || s[2]=='7')
cout<<"Yes";
else
cout<<"No";
return 0;
} | 1 | 97,883,401 |
#include <bits/stdc++.h>
using namespace std;
int main(int args, char *argv[])
{
long N, M;
cin >> N;
cin >> M;
if (N == 1 && M == 1)
{
cout << 1 << endl;
}
else if (N == 1)
{
cout << M - 2 << endl;
}
else if (M == 1)
{
cout << N - 2 << endl;
}
else
{
cout << (N - 2) * (M - 2... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll n, m; cin >> n >> m;
if (n == 1 ... | 1 | 52,575,821 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n,i,d,dd,x,y,sum=0;
cin>>n;
long long a[n+2];
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
x=a[0];
y=sum-a[0];
d=abs(x-y);
for(i=1;i<n-1;i++)
{
x+=a[i];
y-=a[i];
... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl;
#define SANKOU(n,a,b) ... | 1 | 52,733,736 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, doko;
long long ans = 0;
cin >> N >> K;
vector<int> H(N),hissatsu(K);
for(int i=0;i<N;i++)
{
cin >> H.at(i);
}
sort(H.begin(), H.end());
for(int i=0;i<N-K;i++)
{
ans += H.at(i);
}
cout <<... | 1 | 26,112,702 |
#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>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 1 | 61,353,557 |
#include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<string.h>
using namespace std;
int main(){
long long n;
cin>>n;
double a,z;
a=n/3.0;
z=a*a*a;
printf("%.6f",z);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int l;
cin >> l;
double d = l/3.0;
printf("%.10lf",d*d*d);
} | 1 | 9,529,608 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000 + 10;
int n; char s[N];
int main() {
scanf("%s",s+1);
int c=0;n=strlen(s+1);
for(int i=1;i<=n;i++){
if(s[i]=='o')c++;
}
c+=15-n;
printf("%s\n", c>=8?"YES":"NO");
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++ )
#define repf(i,m,n) for(int (i)=m;(i)<n;(i)++)
#define all(v) (v).begin(), (v).end()
#de... | 1 | 67,374,734 |
#include <set>
#include <string>
#include <iostream>
using namespace std;
int main() {
int n;
string a,b;
typedef set<string> set_t;
set_t A;
cin >> n;
for (int i=1; i<=n; i++){
cin >> a >> b;
if (a == "insert"){
A.insert(b);
}else{
cout << (A.count(b) ? "yes" : "no") << endl;
}
}
} | #include<bits/stdc++.h>
#define M 1046527
using namespace std;
int hs(string);
int matoi(char);
int h1(int k){return k%M;}
int h2(int k){return 1+(k%(M-1));}
int main(){
vector<string> a(M,"");
int n;
cin >> n;
for(int j=0;j<n;j++){
string fu;
string st;
cin >> fu >> st;
int ke=hs(st);
if(fu... | 1 | 84,493,966 |
#include<bits/stdc++.h>
using namespace std;
vector<int> dp(100000,0);
int main(){
int n;cin>>n;
int a,b,c;
a=1;b=6;c=9;
for(int i=1;i<n+1;i++){
if(i>=b*6) b*=6;
if(i>=c*9) c*=9;
if(i<6) dp[i]=i;
else if(i<9) dp[i]=min(dp[i-a]+1,dp[i-b]+1);
else dp[i]=min({dp[i-a]... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
ll pow(int x, int n){
if(n==0)return 1;
else return x * pow(x, n-1);
}
int main(){
int N;
cin >> N;
vector<ll> dp(N+1, INF);
dp.at(0) = 0;
for(int i=0; i<N; i++){
dp.at(i+1) = min(dp.at(i+1), dp.a... | 1 | 2,471,502 |
#include<bits/stdc++.h>
#define MAX 300005
using namespace std;
int use[MAX];
vector<int> a;
int main(){
int n,x;
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
use[x]++;
}
int cnt = 0;
for(int i=1;i<=n;i++){
if(use[i])a.push_back(use[i]);
}
sort(a.begin(),a.end());
int sum = n;
for(int i=1;i<=n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | 1 | 6,619,082 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define MAX_NUM 2000000
#define MAX_VALUE 10000
void print_array(int A[], int n) {
for(int i=0; i<n; i++) {
printf("%d", A[i]);
if(i != n-1) {
printf(" ");
}
}
}
void counting_sort(int A[], int B[], int n) {
int cnt[... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloa... | 1 | 47,104,983 |
#include <stdio.h>
#include <iostream>
#include <fstream>
using std::cin;
using std::cout;
using std::endl;
using std::terminate;
void solve() {
int A, B; cin >> A >> B;
for (int i = 1; i <= 1250; ++i) {
if (i * 8 / 100 == A && i * 10 / 100 == B) {
cout << i << endl;
return ;
... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
int a, b;
cin>>a>>b;
for(int i = 1; i < 1100; i++){
if(i*8/100 == a && i*10/100 == b)... | 1 | 49,200,336 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<string>x;
string y;
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>y;
x.push_back(y);
}
sort(x.begin(),x.end());
for(int i=0;i<n;i++){
cout<<x[i];
}
} | #include <iostream>
#include<bits/stdc++.h>
#include <string>
#define loop(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main()
{
int n;
cin>>n;
int l;
cin>>l;
string s[n];
loop(i,n) cin>>s[i];
sort(s,s+n);
string ans;
loop(i,n) ans=ans+s[i];
cout<<ans;
} | 1 | 72,643,665 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF 10000... | #include<bits/stdc++.h>
#define LL long long
#define clr(x,i) memset(x,i,sizeof(x))
using namespace std;
const int N=16035;
char s[16005];
int n,ex,ey,q[2][N];
bool visx[2][N],visy[2][N];
#define fx(i,j) visx[i][j+8000]
#define fy(i,j) visy[i][j+8000]
int main()
{
scanf("%s%d%d",s+1,&ex,&ey); n=strlen(s+1);
int now=0... | 1 | 65,500,923 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1000;
ll n, m;
ll a[N][3];
ll ans = -1e18;
void f(string s) {
if (s.size() == 3) {
ll mul[3];
for (int i = 0; i < 3; ++i) {
if (s[i] == '+') mul[i] = 1;
else mul[i] = -1;
}
ll sc... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
struct Info{
ll x,y,z;
};
struct Data{
Data(int arg_index,ll arg_value){
index = arg_index;
valu... | 1 | 89,033,265 |
#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 main() {
int h, w;
cin >> h >> w;
int a[] = {1, 0, -1, 0};
int b[] = {0... | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 1 | 91,026,429 |
#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;
for(int i=1;i<4;i++){
if(i != a && i != b)
cout << i << endl;
}
} | #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 a,b;
cin >> a >> b;
if(a == 1 && b == 2) cout << 3 << endl;
if(a == 2 && b == 1) cout << 3 << endl;
if(a == 1 && b == 3) cout << 2 << endl;
if(a == 3 && b == ... | 1 | 78,610,986 |
#include<iostream>
#include<vector>
#include<string>
const int ALPHABET = 'z' - 'a' + 1;
int main(){
int n;
std::cin >> n;
std::vector<std::vector<int>> alphabet(n, std::vector<int>(ALPHABET, 0));
for(int i = 0; i < n; i++){
std::string S;
std::cin >> S;
for(int j = 0; j < S.size... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
using namespace std;
int main()
{
int n;
cin >> n;
vector<string> S(n);
for (auto& x : S) {
cin >> x;
sort(x.begin(), x.end());
}
string ans = S[0];
for (int i = 1; i < n; ++i) {
string tmp;
set_intersection(... | 1 | 45,786,755 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5],i;
for(i=0;i<5;i++){
cin >> a[i];
}
sort(a,a+5,greater<int>());
for(i=0;i<5;i++){
cout << a[i];
if(i<4)cout << ' ';
else cout << endl;
}
return 0;
} | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int n[5];
int main()
{
for(int i = 0; i < 5; i++)
{
scanf("%d",n + i);
}
sort(n,n + 5);
printf("%d %d %d %d %d\n",n[4],n[3],n[2],n[1],n[0]);
return 0;
} | 1 | 85,290,585 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG 1
#define cerr if (DEBUG) cerr
#define test cerr << "hi\n";
mt19937_64 rng(c... | 1 | 94,821,138 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char A;
cin >> A;
if ('A' <= A && A <= 'Z')
cout << 'A' << endl;
else
cout << 'a' << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef vector<int> vi;
typedef unsigned long ul;
typedef vector<ll> vl;
typedef pa... | 1 | 53,886,769 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
string s, ans;
int w;
cin >> s >> w;
for (int i = 0; i < s.size(); i+=w) {
ans += s[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 1 | 18,548,296 |
#include<bits/stdc++.h>
#define lld long long int
#define llf long double
#define pb push_back
#define mp make_pair
#define IN insert
#define loopN(n) for(lld i=0;i<n;i++)
#define loop(p,n) for(lld i=p;i<=n;i++)
#define rloop(p,n) for(lld i=n;i>=p;i--)
#define loop2(p,n)... | #pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll lon... | 1 | 49,377,159 |
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
string s;
void input() {
cin >> s;
}
void solve() {
string ans = "No";
if (s.find('7') != string::npos)
ans = "Yes";
cout <... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int p;
while(n>0)
{
p=n%10;
if(p==7)
{
cout<<"Yes";
return 0;
}
n=n/10;
}
cout<<"No";
} | 1 | 53,762,010 |
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
#include <algorithm>
#include <vector>
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=... | 1 | 55,624,126 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,A,B;
cin >> X >> A >> B;
if(A>=B){
cout << "delicious";
}else{
int after = B-A;
if(after <= X){
cout << "safe";
}else{
cout << "dangerous";
}
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main() {
int x,a,b;
cin >> x >> a >> b;
if(b-a <= 0) cout << "delicious" << endl;
else if(b-a <= x) cout << "safe" << endl;
else cout << "dangerous" << endl;
} | 1 | 44,865,799 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef lon... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{... | 1 | 2,198,829 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
signed main() {
int N; cin >> N;
vector<int> A(N);
rep(i, N) {
int a; cin >> a;
if(i == 0) A[i] = a;
else A[i] = A[i-1]+a;
}
int ans = 0;
uno... | 1 | 100,729,461 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char A, B;
cin >> A >> B;
string ans = "123";
ans.erase(remove(ans.begin(), ans.end(), A), ans.end());
ans.erase(remove(ans.begin(), ans.end(), B), ans.end());
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
vector<int> s(3);
int a,b;
cin>>a>>b;
s[a-1]++;
s[b-1]++;
for(int index =... | 1 | 40,257,624 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include <iostream>
#include <numeric>
int main(){
int n;
std::cin >> n;
int ans = 0;
for (int i = 0; i < n; i++)
{
int a;
std::cin >> a;
ans = std::gcd(ans, a);
}
std::cout << ans << std::endl;
return 0;
} | 1 | 29,204,972 |
#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 rrep(i, m, n) for(ll i = m; i > n; i--)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 1 | 61,739,537 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> red(N), blue(N);
vector<bool> used(N, false);
for (int i = 0; i < N; i++) {
int a, b; cin >> a >> b;
red[i] = {b, a};
}
for (int i = 0; i < N; i++) {
int c, d; cin >> c >> d;
blue[i] = {c, ... | #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() {
int n;
cin >> n;
vector<P> RED;
rep(i, n) {
int a, b;
cin >> a >> b;
RED.push_back({-b, a});
}
sort(RED.begin(),... | 1 | 17,931,743 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
ll n, k;
cin >... | #include <iostream>
#include <map>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
long long K;
cin >> N >> K;
map <int, long long> count;
for(int i = 0 ; i < N ; ++i){
int a, b;
cin >> a >> b;
count[a] += b;
}
long long pos = 0;
for(const aut... | 1 | 15,344,709 |
#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 rep(i, n) for... | #include <iostream>
#include <algorithm>
using namespace std;
long long keta(long long n){
long long cnt = 0;
while (n > 0){
n /= 10;
cnt++;
}
return cnt;
}
int main(void){
long long n;
cin >> n;
long long ans = 100;
for (long long i = 1; i * i <= n; i++){
if (n % i !=... | 1 | 65,588,497 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 5010;
int n, k;
int p[N], c[N];
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++)
{
scanf("%d", &p[i]);
}
for(int i = 1; i <= n; i++)
{
scanf("%d", &c[i]);
}
ll an... | #include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#define input \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#else
#define debug(...) 4
#define input 4
#endif
using ll = long long;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
#define int long long
int3... | 1 | 51,099,508 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
string s;
cin >> s;
int n = s.size();
bool kaibun(string);
string t,u;
rep1(i, (n-1)/2){
t.push_back(s[i]);
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
... | 1 | 82,520,548 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N;
string s[N];
for(int i=0;i<N;i++){
cin >> s[i];
}
cin >> M;
string t[M];
for(int i=0;i<M;i++){
cin >> t[i];
}
int max,count;
for(int i=0;i<N;i++){
for(int k=0;k<N;k++){
if(s[i]==s[k]) count++;
}
f... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,M;
cin>>N;
vector<string>S(N);
for(int i=0;i<=N-1;i++){
cin>>S[i];
}
cin>>M;
vector<string>T(M);
for(int i=0;i<=M-1;i++){
cin>>T[i];
}
int countplus=0;
int countminus=0;
int an... | 1 | 64,557,767 |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <math.h>
#include<bitset>
#include<stdio.h>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF = 100000000;
bool isOK(int a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int A, B, X; cin >> A >> B >> X;
if (A > X) cou... | 1 | 7,175,938 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()... | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF (1<<30)
int main(void) {
int N; cin >> N;
vector<int> vec(N, 0);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++)
cin >> vec[i];
for (int i = 0; i < N; i++) {
*lower_bound(dp.begin(), dp.en... | 1 | 57,978,768 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) {
if (a % b == 0) return b;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a / gcd(a,b) * b;
}... | #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... | 1 | 23,147,303 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main(){
lint N, K; cin >> N >> K;
vector<lint> a(N);
lint ans = 1e18;
for(lint i = 0; i < N; i++) cin >> a[i];
for(lint bit = 0; bit < (1 << N - 1); bit++){
lint counter = 0;
for(lint i = 0; i < N - 1; i++){
if(bit & 1 ... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,l,n) for(int i=(l);i<(n);i++)
int main(){
int N,K;
ll money=2e10;
cin >> N >> K;
int height[N];
rep(i,N) cin >> height[i];
for(int bit = 0;bit < 1 << N;bit++){
int ma... | 1 | 3,086,203 |
#include <algorithm>
#include <cmath>
#include <iostream>
int a, b;
int main() {
std::cin >> a >> b;
for (int i = 1; i <= 1000; i++) {
int a2 = i * 0.08;
int b2 = i * 0.1;
if (a2 == a && b2 == b) {
std::cout << i << std::endl;
return 0;
}
}
std::co... | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
float a, b;
cin >> a >> b;
for (int i = 13; i < 1005;i++) {
if (0.08 * i >= a && 0.08 * i < a+1 && 0.1 * i >= b && 0.1 * i < b + 1) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
... | 1 | 8,544,116 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 1 | 86,707,793 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#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 rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int t[100010],x[100010],y[100010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t[i] >> x[i] >> y[i];
}
bool f = 1;
for (int i = 1; i <= n; i++) {
int tt = t[i] - t[i-1];
int xx = abs(x[i] - x[i-1]);
i... | 1 | 86,258,463 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #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"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 1 | 64,973,067 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 1e6+10;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define r... | 1 | 57,543,260 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
ll ans = K;
if (N >= 2) {
for (int i = 0; i < (N - 1); i++) {
ans = ans * (K - 1);
}
}
cout << ans << endl;
} | 1 | 34,366,237 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
map<int ,bool> AC;
map<int ,int> WA;
cin >> n >> m;
for (int i = 0; i < m; i++){
int no;
string res;
cin >> no >> res;
if (res == "AC") {
AC[no] = 1;
} else {
if (!AC.count(no)) {
WA[no]++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int N,M;
cin >> N >> M;
int P[M];
string S[M];
REP(i,M) cin >> P[i] >> S[i];
int ac = 0;
int wrong[N];
int ... | 1 | 91,880,897 |
#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>;
const long long mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
string ans = "";
ans += s[0];
rep(i, n - 1) {
if(s[i] == s[i + 1])
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 1 | 57,654,019 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 1 | 97,731,888 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin>>n;
vector<ll> p(n+1), q(n+1);
rep(i,n... | #include <string>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <unordered_map>
#include <iostream>
using namespace std;
vector<string>split(string s, char delim){
int len = s.length();
string currStr = "";
vector<string>retVec;
for(int i = 0;i<len;i++){
char ch = s[i];
if(ch==delim)... | 1 | 48,380,026 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
bool eval(string & s) {
int n=s.size();
for (int i=0; i<n/2; ... | #include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <string>
#include <algorithm>
#include <set>
#include <sstream>
#include <bit>
#include <time.h>
#include <bitset>
#include <iomanip>
#include <queue>
typedef long long int ll;
using namespace std;
int main() {
string S; cin >> S;
int n =... | 1 | 39,793,537 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int k, a, b; cin >> k >> a >> b;
cout << (a <= b / k * k ? "OK" : "NG") << endl;
return 0;
} | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int k,a,b;
cin>>k;
cin>>a;
cin>>b;
int x=b/k;
int y=x*k;
if(y>=a && y<=b)
cout<<"OK";
else
cout<<"NG";
return 0;
} | 1 | 51,590,406 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, sum = 0;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) cin >> s[i];
cin >> m;
string t[m];
for (int i = 0; i < m; i++) cin >> t[i];
for (int i = 0; i < n; i++)
{
int r = 0;
for (int j = 0; j < n... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
map<string,int>mp;
int n,m,ans=0;
str... | 1 | 29,058,118 |
#include<iostream>
using namespace std;
int main(){
int n, x, count=0;
while(1){
cin >> n >> x;
if (n*n+x*x==0) break;
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+k==x) count++;
}
}
}
cout << count << "\n";
count = 0;
}
r... | #include<iostream>
#include <stdio.h>
using namespace std;
int main(){
int n,x;
int c;
int i,j,k;
for (;;){
cin >> n >> x;
c=0;
if (n==0 && x==0)break;
for (i=0;i<n;i++){
for (j=0;j<n;j++){
for (k=0;k<n;k++){
if (i + j + k +... | 1 | 41,905,622 |
#include <iostream>
using namespace std;
const int N= 200001;
int parent[N];
int rnk[N];
void make_set(int r){
parent[r]=r;
rnk[r]=0;
}
int find_set(int r){
if(parent[r]==r){
return r;
}else{
return parent[r]=find_set(parent[r]);
}
}
void union_set(int a, int b){
a= find_set(a);
... | #include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
const double PI = 3.1415926535897932384626;
const double EPS = 1e-10;
const ll MODN = 10000... | 1 | 60,109,132 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<double> x(n);
vector<string> u(n);
double ans=0,BTC=0;
for(int i=0;i<n;i++){
cin>>x.at(i)>>u.at(i);
if(u.at(i)=="JPY")
ans+=x.at(i);
else
BTC+=x.at(i);
}
ans+=BTC/1*3800... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
int main() {
int n;
double x[11];
string u[11];
double total = 0.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> u[i];
}
for (int i = 0; i < n; i++) {
if (u[i] == "BTC") {
total += x[i] * 380000.0;
}
e... | 1 | 25,229,132 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.