code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define all(x) x.begin(),x.end()
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define sll set<ll>
#define pll pair<ll, ll>
#define vpll ... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(auto i=0;i<n;++i)
#define REPR(i,n) for(auto i=n;i... | 0 | 95,151,668 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
if(n < 105){
cout << 0 << endl;
return 0;
}
int r = 0;
for(int i = 105;i <= n;i += 2){
int cnt = 0;
for(int j = 1;j * j < i;j++){
if(i % j == 0){
cnt++;
... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
... | 0 | 45,521,070 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
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; retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 1e5;
int N;
int P[MAX_N];
ll solve() {
vector<pii> ps;
for (int i = 0; i < N; i++) {
ps.push_ba... | 0 | 25,343,635 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;
int main() {
... | #include <stdio.h>
int main() {
int n, m, l, tmp;
scanf("%d", &n);
int M[n][n];
for (int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
M[i][j] = 0;
}
}
for (int i=0; i<n; i++) {
scanf("%d %d", &m, &l);
for (int j=0; j<l; j++) {
scanf("%d", &tmp... | 0 | 80,192,530 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
int main() {
while(... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 48,447,632 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long n, s, x, mn, a[200005];
int main() {
int i;
scanf("%lld", &n);
for(i=0; i<n; i++) scanf("%lld", &a[i]), s += a[i];
x = a[0];
mn = abs(s-2*x);
for(i=1; i<n-1; i++) {
x += a[i];
mn = min(mn, (long long)abs(s-2*x));
}
printf(... | 0 | 25,774,363 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e9;
signed main(){
int S;cin>>S;
cout<<0<<" "<<0<<endl;
cout<<N<<" "<<1<<endl;
int y3=S/N+bool(S%N);
cout<<N*y3-S<<" "<<y3<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(3,0);
for(int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for(int i = 0; i < a.size() - 1; i++) {
cout << a[i] << " ";
... | 0 | 41,537,273 |
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mk make_pair
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
#define print_vec... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
ll g... | 0 | 34,560,299 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include<iostream>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int x = 0; x <= n / r; x++) {
int max_y = (n - r * x) / g;
for (int y = 0; y <= max_y; y++) {
if (... | 0 | 96,463,395 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<vector<int>> r(n,vector<int>(0));
vector<int> sig(n,200005);
for(int i=0;i<m;i++){
int a,b;
scanf("%d",&a);
scanf("%d",&b);
r[a-1].push_back(b);
r[b-1].push_back(a);
}
queue<int> p;
p.push(1);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
int main() {
int A,B;
cin >> A >> B;
string S;
cin >> S;
int count = 0;
rep(i,A) {
if ... | 0 | 39,524,054 |
#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;;
int main(){
int w,h,n;
cin >> w >> h >> n;
int maxx=0,minx=w,maxy=0,miny=h;
int x,y,a;
for (int i = 0; i < n; i++){
cin >> x >> y >> a;
if (a==2){
minx = min(x,minx);
}else if (a==1){
maxx = max(maxx,x);
... | 0 | 100,122,594 |
#include <stdio.h>
int main(){
int n,x,r,i,j,k;
while(1){
scanf("%d %d",&n,&x);
if (n != 0 || x != 0){
r=0;
for(i = 0; i < n; i++){
for(j = 0; j < i; j++){
for(k = 0; k < j; k++){
if (i+j+k+3 == x){
r++;
}
}
}
}
printf("%d\n",r);
} else {
break;
... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
#define for1(n) for... | 0 | 36,711,509 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
u... | 0 | 14,611,117 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
ii a[N];
int l1[N], l2[N], r1[N], r2[N];
... | #include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
int main() {
int32_t n;
cin >> n;
vector<int32_t> r(n), c(n);
for (int32_t i = 0; i < n; i++) {
cin >> r[i] >> c[i];
}
vector<int32_t> table(n*n);
for (int32_t i = 0; i < n; i++) {
table[i*n+i] = 0;... | 0 | 84,981,524 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int countBit(int bit){
if(b... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 17,839,195 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll H, W;
cin >> H >> W;
vector<string> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template<class T>
inline bool ... | 0 | 83,253,766 |
#include<bits/stdc++.h>
#define mod 1000000007
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const ll inf = LONG_LONG_MAX;
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1){
res = (res * a)%mod;
}
a = (a * a)%mod;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
struct UnionFind{
vector<int> Par;
UnionFind(int N) : Par(N) {
for(int i = 0; i < N; i++) Par[i] = i;
}
int root(int X){
if( Par.at(X) == X ) return X;
else return Par.at(X) = root(Par.at(X));
}
bool same(int X, int Y){
retu... | 0 | 28,443,817 |
#include <bits/stdc++.h>
#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 rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(... | #include <iostream>
#include <string>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.size() < b.size()) puts("LESS");
else if(b.size() < a.size()) puts("GREATER");
else {
for(int i = 0; i < a.size(); i++) {
if(a[i] - '0' < b[i] - '0') {
puts("LES... | 0 | 79,351,246 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i <= n / 4; i++) {
for (int j = 0; j <= n / 7; j++) {
if (4 * i + 7 * j == n) {
cout << "Yes" << endl;
exit(0);
}
}
}
cout << "No" << endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
const int N=100010;
int n,x,y;
vector<int> vec[N];
int dfs(int ... | 0 | 44,353,937 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <fstream>
#include <cst... | #include<cstdio>
typedef long long ll;
using namespace std;
int main(){
int f;
ll l,r,mid,a[50],n,sum,ans=0,x;
scanf("%lld",&n);
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
}
do{
f=1;
sum=0;
for(int i=0;i<n;i++){
sum+=a[i]/n;
}
for(int i... | 0 | 87,604,947 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 9,029,564 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int A, B, C;
cin >> A... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 66,186,387 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int x, y; cin >> x >> y;
if(x < y) {
if(x < 0 && y >= 0) cout << ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#d... | 0 | 44,740,585 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll count = 0;
while(count * (count + 1LL) / 2LL < n) {
count++;
}
ll total = n;
vector<ll> ans;
for (ll i = count; i > 0; i--) {
if (total >= i) {
total -= i;
ans.push_back(i);
}
}
for (ll... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T... | 0 | 34,322,570 |
#include<stdio.h>
int main(void){
int i,j,H,W;
for(scanf("%d%d",&H,&W);H!=0||W!=0;scanf("%d%d",&H,&W)){
for(i=0;i<H;i++){
for(j=0;j<W;j++){
if(i==0||i==H-1||j==0||j==W-1)putchar('#');
else putchar('.');
}
putchar('\n');
}
putchar('\n');
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int kind[5] = {' ','A','C','G','T'};
typedef struct{
vector<int>data;
}H;
H hash[5000000];
int convertion(string s){
int d = 1;
int sum = 0;
for(int i = s.size() - 1;i >= 0;i--){
for(int j = 1;j < 5;j++){
if(kind[j] == s[i]){sum += d * j;break;}
}
... | 0 | 38,506,253 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#define cs ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M 1000000007
#define rep(i,b) for(int i=0;i<(int)(b);i++)
#define Rep(i,n) for(int i=1;i<(int)(n);i++)
#define repp(i,a,b) for(int i=a;i<=(int)(b);i++)
#define Repp(i,a,b) f... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
#define int ll
signed main(){
int H,W;
cin >> W >> H;
vector<int>p(W),q(H);
for(auto & e : p) cin >> e;
for(auto & e : q) cin >> e;
using pi = pair<int,int>;
vector<pi>v;
for(auto e : p)
... | 0 | 76,736,803 |
#include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c >= 'A' && c <= 'Z') cout << 'A' << endl;
else cout << 'a' << endl;
return 0;
} | #include<bits/stdc++.h>
#include<vector>
#include<cmath>
#include<string>
#define mod 1000000007
#define lp(i,n) for(int i=1;i<=n;i++)
#define lpp(i,a,b) for(int i=a,i<=b;i++)
#define stlp(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define ull unsigned long lon... | 0 | 63,418,369 |
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
struct node{
int data;
node* prev;
node* next;
};
void printforward(node* head);
void insert(node*& head, node*& tail, node*& e);
void deleteFirst(node*& head, node*& tail);
void deleteLast(node*& head, node*& tail);
void deleteElement(nod... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string str,com;
cin >> str;
int q,num1,num2;
cin >> q;
for(int i=0;i<q;i++){
cin >> com >> num1 >> num2;
if(com=="print"){
for(int j=num1;j<=num2;j++){
cout << str[j];
}
... | 0 | 38,247,541 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<ll> a(3);
REP(i, 3) { cin >> a[i]; };
sort(all... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<ll , ll>
#define mpi make_pair
#define F first
#define S second
#define pb push_back
bool comp1(pii a , pii b)
{
return atan2(a.S , a.... | 0 | 37,624,600 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#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())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define mid ((l+r)>>1)
const int M=3e5+20,P=1e9+7;
struct Task{
LL n,m,v,p,a[M];
LL sum[M];
void run(){
init();
sort(a+1,a+n+1);
for(int i=1;i<=n;++i){
sum[i]=sum[i-1]+a[i];
}
LL ans=n-p;
wh... | 0 | 43,170,151 |
#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(n, 0);
for (int i = 0; i < n; i++) {
c... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int SZ = 100005;
const int LIM = 1000000000;
const double EPS = 1e-9;
const int MOD = 100000008;
const int INF = ( 1 << 30 ) - 1;
const double PI = 2 * acos( 0.0 );
template <class T> T MIN(T a, T b) { return (a < b) ? a : b; }
template <class T> T... | 0 | 24,840,732 |
#include<bits/stdc++.h>
#include<unistd.h>
using namespace std;
#define pb(x) push_back(x);
typedef long long int ll;
ll mod = 998244353;
ll hmaxii=0;
vector<ll>values[2*100000+1];
ll MAXN = 2*100000+1;
ll spf[2*100000+1];
ll diff,x,y,z;
ll flag=1;ll price[1001][1001];
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a; }
void... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n; cin >> n;
vector<ll> a(n);
for(ll i = 0; i < n; i++)cin >> a[i];
vector<ll> nind;
vector<ll> sum(n);
sum[0] = a[0];
for(ll i = 1; i < n; i++)sum[i] = max(sum[i - 1], a[i]);
for(ll i = n - 1; i >= 1; i--... | 0 | 26,368,193 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string S, T;
cin >> S;
cin >> T;
if(S==T){
cout << "Yes" << endl;
return 0;
}
for(int i=0; i<S.size(); i++){
char tmp = S[S.size()-1];
for(int j=S.size()-1; j>=1; j--){
... | #include<iostream>
int main()
{
int m[100], f[100], r[100];
int count = 0;
for (int i = 0; ; i++) {
std::cin >> m[i] >> f[i] >> r[i];
count++;
if (m[i] == -1 && f[i] == -1 && r[i] == -1) {
count--;
break;
}
}
for (int i = 0; i < count; i++) {
if (m[i] == -1 || f[i] == -1)
std::cout << "F" << std... | 0 | 49,089,662 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <bitset>
#include <cstdint>
#include <initializer_list>
using namespace std;
using namespace __gnu_pbds;
#define data_set(type) tree<type,null_type,less<type>,rb_tree_tag,tree_order_... | #include <bits/stdc++.h>
using namespace std ;
int main(){
int N;
cin >> N;
int a[N];
int One=0;
for(int i=0;i<N;i++){
cin >> a[i];
if(a[i]==1){
One++;
}
}
if(One ==0){
cout << -1 << endl;
return 0;
}
int count =0;
int j=0;
... | 0 | 90,574,794 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e18;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << ((a%3==0 || b%3==0 || (a+b)%3=... | #include<bits/stdc++.h>
using namespace std;
int n, l, q;
vector<int>v;
vector<vector<int> >moves;
void preprocess(){
int cur = 1;
for(int i = 1; i <= n; i++){
while(cur <= n && v[cur] - v[i] <= l){
cur++;
}
moves[i][0] = cur - 1;
}
for(int j = 1; j <= 17; j++){
... | 0 | 87,327,540 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const int int_inf = 100000000;
const double eps = 1e-9;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a... | #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... | 0 | 7,998,989 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD=1000000007;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REP2(i,x,n) for(ll i=x; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define ipr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define fr(i, j, k) for (int i = j; i < k; i++)
#define rf(i, j, k) for (int i = j; i >= k; i--)
#define ll unsigned long long
#define int long long
#define ld long double
#define all(x) x.be... | 0 | 31,378,779 |
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=100005;
void NoSolution()
{
puts("NO");
fclose(stdin);
fclose(stdout);
exit(0);
}
int n,A[MAXN];
vector<int> adj[MAXN];
int dfs(int u,int fa=0)
{
if(adj[u].size()==1U)
return A[u];
long long sum=0;
int t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
ios::sync_with_stdi... | 0 | 70,855,280 |
#include <iostream>
#define _USE_MATH_DEFINES
#include <cmath>
#include <utility>
#include <iomanip>
const double rad60 = 60 * M_PI / 180;
void koch_curve(std::pair<double, double> p1, std::pair<double, double> p2, int n) {
if (n == 0) return;
std::pair<double, double> s, t, u;
s.first = (2.0 * p1.first + 1... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
int answer = 0;
for(int i = A; i < B+1; i++){
string j = to_string(i);
string p,q,r,s,t;
p = j[0];
q = j[1];
r = j[2];
s = j[3];
t = j[4];
if (p ... | 0 | 28,672,754 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void ... | #include<iostream>
#include<queue>
#include<limits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<math.h>
#include<iomanip>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#define ll long long
#define tc(t) wh... | 0 | 58,930,303 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | #include <iostream>
using namespace std;
int main(){
int x ;
while(1){
cin >> x ;
int total = 0;
if( x==0 )break;
int yen500 = 0;
int yen100 = 0;
int yen50 = 0;
int yen10 = 0;
int yen5 = 0;
int yen1 = 0;
x = 1000- x;
yen500 = x /500 ;
x = x%500;
yen100 = x /100;
... | 0 | 82,756,960 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).beg... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
double GetLen(double x1,double y1,double x2,double y2){
return sqrt((y2-y1)*(y2-y1)+(x2-x1)*(x2-x1));
}
double GetAn1(double x1,double y1,double x2,double y2){
return atan((y2-y1)/(x2-x1)... | 0 | 11,298,001 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
string t = s;
reverse(t.begin(), t.end());
if(s == t) {
int x = (s.size() - 1) / 2;
rep(i, x) {
if(s[i] != t[x - i - 1]) {
cout << "No"... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
usi... | 0 | 57,102,617 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T>
using Grid = vector<vector<T>>;
int main() {
ll N, K... | 0 | 15,537,067 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb(n) push_back(n)
#define GSORT(v) sort(v.begin(), v.end(), greater<int>())
#define SORT(v) ... | #include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
int main()
{
int n, m = 0;
int a[101];
memset(a, 0, sizeof(a));
while (cin >> n)
a[n]++;
for (int i = 1; i <= 100; i++)
m = max(m, a[i]);
for (int i = 1; i <= 100; i++)
if (a[i] == m)
cout << i << endl;
return 0;
} | 0 | 19,808,358 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
bool Solve() {
int n;
cin >> n;
vector<int> xs(n);
vector<int> v_count(n);
int max_d = 0;
for (int i = 0; i < n; i++) {
cin >> xs[i];
v_count[xs[i]]++;
max_d = max(xs[i], max_d);
}
if (max_d % 2 == 1) {
int k = (max_d... | #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>
#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++)... | 0 | 77,267,907 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <utility>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pai... | 0 | 73,825,302 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 29,031,272 |
#include <bits/stdc++.h>
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 RALL(v) v.rbegin(), v.rend()
#de... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 21,750,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
const double PI = acos(-1.0);
int main(){
int n;
ll k;
cin >> n >> k;
map<int,ll> m;
for(int i=0;i<n;i++){
int a,b;
cin >> a ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
string board[50];
for(int i=0;i<N;i++){
cin >> board[i];
}
vector<int> dx={0,0,1,-1};
vector<int> dy={1,-1,0,0};
bool can=true;
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
if(board[i][j]=='#'){
int c... | 0 | 62,593,344 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e3 + 5;
char mp[MAXN][MAXN];
int main() {
int a, b;
cin >> a >> b;
for (int i = 1; i <= 50; i++) {
for (int j = 1; j < 100; j++, j++) {
mp[i][j] = '.';
if (b > 1) {
mp[i][j +... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | 0 | 1,755,861 |
#include <bits/stdc++.h>
using namespace std;
string s;
long long k;
int main(){
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='7')k++;
}
if(k>0)cout<<"Yes";
else cout<<"No";
return 0;} | #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 a[5];
rep(i,5){
cin>>a[i];
}
int ans =0;
int lo=a[0];
for(int j=1;j<5;j++){
if(lo%10>a[j]%10&&a[j]%10!=0){
ans +=lo+(10-lo%10);
lo=a[j];
}
... | 0 | 31,384,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
double b;
cin >> a >> b;
long long c = b * 100 + 0.001;
long long ans = (a * c) / 100;
cout << ans << endl;
return 0;
} | #include <stdio.h>
#include <math.h>
int calc_max_sum(long a, long b){
long long inte = sqrt(a * b);
if((inte + 1) * inte < a * b){
return inte * 2 + 1;
}else if(inte * inte <= a * b){
return inte * 2;
}
}
bool is_square_number(long s){
long inte = long(sqrt(s));
if(inte * inte =... | 0 | 99,606,022 |
#include <bits/stdc++.h>
using namespace std;
int64_t solve(int64_t a, int64_t b) {
if (a > b)
swap(a, b);
int64_t q = b / a;
if (b % a != 0)
return 2LL * q * a + solve(a, b % a);
return 2LL * (q - 1) * a + a;
}
int main() {
int64_t n, x; cin >> n >> x;
int64_t ans = n + solve(x,... | #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... | 0 | 33,842,487 |
#include<stdio.h>
int main(){
char n;
scanf("%c",&n);
if (n >= 'A' && n <= 'Z'){
printf("A");
}
else{
printf("a");
}
return 0;
} | #include<bits/stdc++.h>
int main(){
int h, m, k;
scanf("%d %d", &h, &m);
int s = h*60 + m;
scanf("%d %d", &h, &m);
int g = h*60 + m;
scanf("%d", &k);
printf("%d\n", std::max(0, g-s-k));
return 0;
} | 0 | 74,547,311 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
int p = a * b;
if ((p / 2 * 2) == p) {
cout << "Even" << endl;
} else {
cout << "Odd" << endl;
}
return 0;
} | #include <iostream>
#include <queue>
#include <string>
using namespace std;
int n;
int s2i(string str){
int sum = 0;
int pos;
pos = str.find("m");
if(pos>=0){
if(pos-1>=0 && str[pos-1]>'0' && str[pos-1]<='9'){
sum += ((int)(str[pos-1]-'0'))*1000;
}else{
sum += 1000;
}
}
pos = str.find("c");
if(pos>=0... | 0 | 5,157,338 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
using namespace std;
int main() {
int N, tmp, ans = 0;
cin >> N;
vector<int> K(N);
vector<bool> A(N);
for (int i = 0; i < N; i++) {
... | 0 | 80,974,582 |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
string s;
cin>>s;
int len=s.size();
int cnt=0;
bool flag=true;;
if(s[0]!='A'){
flag=false;
}
for(int i=1;i<len;i++){
if(isupper(s[i])){
... | 0 | 45,521,893 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> dividables;
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 &&... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000001;
const int MOD = 1000000007;
signed main() {
int n,h,w,a,b,ans=0;
cin>>n>>h>>w;
for(int i=0;i<n;i++){
cin>>a>>b;
if(h<=a&&w<=b)ans++;
}
... | 0 | 85,004,051 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A , B , K ;
cin >> A >> B >> K ;
vector<int> D(110);
for(int i=1;i<=100;i++){
if(A%i==0&&B%i==0) {
D[i]=i;
}
}
sort(D.begin(),D.end());
reverse(D.begin(),D.end());
cout << D[K-1] << endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include <cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#i... | 0 | 35,979,795 |
#pragma GCC optimize("O3")
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
#include <set>
#include <stdlib.h... | #include <iostream>
#include <vector>
using namespace std;
vector<int> a(200005);
vector<int> b(200005);
vector<int> e[200005];
void dfs(int x){
b[x] = 1;
for(int &v : e[x]) {
if(v == x)
continue;
if(b[v]==0){
a[v] += a[x];
dfs(v);
}
}
return;... | 0 | 40,267,403 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const long long MOD = 1e9 +7;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
ll n,k;
cin >>n>>k;
vector<ll> v(n);
for(int i = 0;i < n; i++) cin >> v[i];
vector<ll> dp(k+1), end(k+1);
ll a... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define vecst vector<string>
#de... | 0 | 29,604,522 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)x.size()
#define int ll
signed main() {
ios_base::sync_with_stdio(0);
ci... | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const ... | 0 | 63,730,690 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | #include <iostream>
#include <deque>
using namespace std;
const int MAX = 1e5;
int gcd(int a, int b) {
if (a < b) swap(a, b);
while(b != 0) {
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int div2(int n) {
if (n == 0) return 0;
if (n < 0) n *= -1;
int ans = 0;
while((n & 1) == 0) {
ans+... | 0 | 91,403,854 |
#include <bits/stdc++.h>
using namespace std;
bool chk(char c) {
return ('2' <= c && c <= '9');
}
int conv(string s) {
int res = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'm') {
if (i == 0) res += 1000;
else {
string t = ""; t += s[i-1];
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 5,189,172 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,m,k;
cin >> n >> m >> k;
for(int i = 0; i < n+1; i++) {
for(int j = 0; j < m+1; j++) {
if(m*i+(n-i)*j-i*j==k){
cout << "Yes" << endl;
return 0;
}
}
... | 0 | 92,567,568 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n-1)/2 << '\n';
return 0;
} | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
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;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 63,035,749 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll, ll> P;
typedef std::tuple<ll, ll, ll> t3;
constexpr ll INF = 1e15;
constexpr ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } r... | #include <iostream>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <locale>
using namespace std;
int main(){
char X,Y;
cin>> X>> Y;
if(int(X) > int(Y)){
cout<<">";
}else if(int(X) < int(Y)){
cout<<"<";
}else{
cout<<"=";
}
return 0;
} | 0 | 98,591,953 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
int sum=0;
cin >> n >> k;
vector<int> vec(n);
for(int i=0; i<n; i++){
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for(int i=0; i<k; i++){
sum += vec.at(i);
}
cout << sum << endl;
} | #include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include ... | 0 | 66,692,030 |
#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 a,b,c,k;
cin >> a >> b >> c >> k;
int xa = min(k,a);
k -= xa;
int xb = min(k,b);
k -= xb;
int xc = k;
cout << xa -xc << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 21,303,962 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int n;
vector<vector<pair<int, ll> > > G;
int q, k;
vector<ll> dis;
void dfs(int i, int j) {
for(auto nexti:G[i]) {
if(nexti.first == j) continue;
... | #include <iostream>
#include <cstring>
using namespace std;
int main()
{
int n;
int count;
while (1)
{
cin >> n;
if (cin.fail()) break;
bool *isPrime;
isPrime = new bool[n + 1];
memset(isPrime, true, sizeof(bool) * (n + 1));
isPrime[0] = isPrime[1] = false;
count = 0;
for (int i = 2; i <= n; ++i)
... | 0 | 4,800,045 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int t = N,tmp = 0;
while(t > 0){
tmp += t % 10;
t = t / 10;
}
if(N % tmp == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <cstdio>
#include <cstring>
#define N 200010
#define mem(x, a) memset(x, a, sizeof x)
#define fo(x, a, b) for (int x = (a); x <= (b); x++)
#define fd(x, a, b) for (int x = (a); x >= (b); x--)
using namespace std;
int n, a[N], b[N], z[N][2];
inline int read() {
int x = 0, f = 0; char c = getchar();
while (c <... | 0 | 44,904,519 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define sz 100100
ll dp[sz][2];
inline ll mul(ll a, ll b)
{
a = ((a % MOD) + MOD) % MOD;
b = ((b % MOD) + MOD) % MOD;
return (a * b) % MOD;
}
inline ll add(ll a, ll b)
{
a = ((a % MOD) + MOD) % MOD;
b = ((b % MOD) + MOD) % MOD... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 25,820,578 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int ans=0;
for(int i=0; i<n; ++i){
int j=0;
... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
int main(){
int MATHI[10][10];
int n,a,b,c,syo;
while(1){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++) MATHI[i][j]=1000000;
MATHI[i][i]=0;
}
syo=0;
cin >> n;
if(n==0)break;
... | 0 | 18,057,836 |
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using llong = long long;
using namespace std;
int main(){
llong k,a,b,ans=0,trade,amari;
cin >> k... | #include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e14 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | 0 | 66,845,373 |
#include<iostream>
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long x,y ;
cin >> x >> y ;
int cnt = 0 ;
while(x<=y)
{
x = x*2 ;
++cnt ;
}
cout << cnt << endl ;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0,k=0;
cin>>n>>k;
lli res=(n/k);
res*=1ll*(res*res);
... | 0 | 78,235,648 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <map>
#include <numeric>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
cin>>N;
long long K=0;
f... | 0 | 48,790,769 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
int main(){
ll n, x;
cin >> n >> x;
vector<ll> city(n);
rep(i,n){
cin >> city.at(i);
city.at(i)-=x;
if(city.at(i)<0) city.a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main()
{
int n, m, v, p;
cin >> n >> m >> v >> p;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
int ans = 0;
int ok = 0, ng = n;
while(abs(... | 0 | 61,505,700 |
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <bitset>
#include <time.h>
#include <set>
#include <algorithm>
#define MODD 1000000007
#define ll long long
using namespace std;
int main() {
int N;
cin>>N;
ll x;
for(x=1;;x++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
int w, h;
cin >> w >> h;
vector<pair<ll, bool>> pqs;
rep(i, w + h) {
ll p;
cin >> p;
pqs.emplace_back(p, i < w);
}
int a = w + 1, b = h + 1;
... | 0 | 17,193,290 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | #include <bits/stdc++.h>
using namespace std;
#define vll vector<long long>
#define mll map<long long,long long>
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a>b)?b:a)
#define pb push_back
#define prll pair<long long,long long>
typedef long long ll;
typedef long double ld;
#define rep(i,a,n) for(ll i=a; i<n; i++)
... | 0 | 47,386,485 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main()
{
int n, k, x, y, ans = 0;
cin >> n >> k >> x >> y;
rep(i, n) {
if (i+1 <= k) ans += x;
else ans += y;
}
cout << ans << endl;
return 0;
} | #include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | 0 | 37,550,259 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
ll T;
ll a, b;
int main()
{
scanf("%lld", &T);
while(T--)
{
scanf("%lld%lld", &a, &b);
ll x = sqrt((double)a * b);
if(a * b < x * x) x--;
if(a * b == x * x)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 4,656,658 |
#include <stdio.h>
int main(){
int a,b[3]={0,0,0};
for(int i=0;i<10;i++){
scanf("%d",&a);
if(a>=b[2]){
if(a>=b[1]){
if(a>=b[0]){
b[2]=b[1];
b[1]=b[0];
b[0]=a;
}else{
b[2]=b[1];
b[1]=a;
}
}else{
b[2]=a;
}
}
}
for(int i=0;i<3;i++){
printf("%d\n",b[i]);
}
} | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | 0 | 73,482,277 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | #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<ll, ll> 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; } retu... | 0 | 42,066,794 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
while (cin >> N) {
if (N == 0) break;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
int ANS = 100000000;
for (int i = 0; i < N - 1; i++) {
ANS = min(ANS, A[i + 1] - A[i]);
}
cout << ANS << endl;... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll k, a, b;
cin>> k;
cin>>a>>b;
for(ll i=a; i<=b; i++)
{
if(i%k==0)
{
cout<<"OK"<<endl;
return 0;
}
}
cout<<"NG"<<endl;
return 0;
} | 0 | 94,128,368 |
#include <iostream>
#include <string>
#include <algorithm>
#include <sstream>
#include <vector>
#include <set>
#include <stack>
#include <cstdlib>
int main(void)
{
std::string commands;
short x_goal, y_goal;
std::cin >> commands >> x_goal >> y_goal;
std::vector<short> xm;
std::vector<short> ym;
... | #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... | 0 | 20,440,147 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<int,int>tack;
int n;
cin>>n;
tack[n]++;
int count=1;
while(1)
{
count++;
if(n%2==0)
{
n=n/2;
if(tack[n]!=0)
{
cout<<count<<"\... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 7,931,700 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, i;
string w[200100];
char tmp='a';
map<string, int> mp;
cin >> n;
for(i=0;i<n;i++){
cin >> w[i];
}
for(i=0;i<n;i++){
if(tmp!=w[i][0] && i!=0){
cout << "No" <<endl;
return 0;
}... | #include<iostream>
#include<vector>
#include<utility>
int main(){
size_t n;
std::cin >> n;
std::vector<std::pair<size_t, size_t>> ab(n);
for(auto&& e : ab){
std::cin >> e.first >> e.second;
}
size_t cnt = 0;
for(size_t i = 0; i < n; i++){
if((ab.at(n - i - 1).first + cnt) % a... | 0 | 20,043,869 |
End of preview. Expand in Data Studio
- Downloads last month
- 12