code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 10000;
int main(){
int k,n;
cin>>k>>n;
vector<int> arr(n+1);
for(int i = 0; i < n; i++) cin>>arr[i];
int res = INT_MAX;
arr[n] = k+arr[0];
for(int i = 0; i < n; i++){
res = min(res, k - (arr[i+1]-arr[i])... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int K, N;
cin >> K >> N;
int A[N];
for (int i = 0; i < N; i++) cin >> A[i];
int maxDist = K - A[N - 1] + A[0];
for (int i = 1; i < N; i++) {
maxDist = max(maxDist, A[i] - A[i - 1]);
}
cout << K - maxDist << endl;
retu... | 1 | 64,037,952 |
#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 (){
... | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll m,n;
cin >> m >> n;
l... | 1 | 11,202,112 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
int res = 0;
if(a < b) res += a;
else res += b;
if(c < d) res += c;
else res += d;
cout << res << endl;
return 0;
} | #include <iostream>
#include <algorithm>
typedef long long LL;
using namespace std;
int main() {
LL a;
LL b;
LL c;
LL d;
cin >> a >> b >> c >> d;
LL ans=min(a,b)+min(c,d);
cout << ans << endl;
return 0;
} | 1 | 30,413,873 |
#include <stdio.h>
int main(){
int jamb;
int menitb;
int jamt;
int menitt;
int belajar;
int rumus;
scanf("%d %d %d %d %d", &jamb,&menitb,&jamt,&menitt,&belajar);
rumus=((jamt*60)+menitt)-((jamb*60)+menitb)-belajar;
printf("%d", rumus);
return 0;
} | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#define eb emplace_back
#define pb push_back
#... | 1 | 84,481,133 |
#include<bits/stdc++.h>
#include <cctype>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define PRY cout<<"YES\n"
#define PRN cout<<"NO\n"
#define SETP(sp) fixed<<setprecision(sp)
#define PB pus... | #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 rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 | 36,932,295 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main(void) {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans +... | 1 | 29,360,696 |
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#def... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
ll k;
cin... | 1 | 63,491,674 |
#include <stdio.h>
#include <string.h>
int main(){
int k;
char str[105];
scanf("%d", &k);
getchar();
scanf("%s", str);
int len = strlen(str);
if(len <= k) {
printf("%s\n", str);
} else {
for(int i = 0; i < k; i++) {
printf("%c", str[i]);
}
printf("...\n");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e5 + 5;
#define INF 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | 1 | 78,610,913 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | # include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
unordered_set<ll>SET;
unordered_map<ll,int>byk;
const int N=2e5+5;
int arr[N];
ll ps[N];
ll kombin(ll x){
return x*(x-1)/2;
}
int main(){
io... | 1 | 54,236,975 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int x; cin >> x;
int y = x / 100;
if(y * 100 <= x && x <= y * 105){
cout << 1 <<... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<bool>dp(101000);
int x;
cin>>x;
for(int i=100;i<=105;i++) dp[i]=true;
for(int i=100;i<100001;i++){
if(dp[i]==true){
dp[i+100]=true;
dp[i+101]=true;
dp[i+102]=true;
dp[i+1... | 1 | 48,444,270 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vecto... | 1 | 23,422,979 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long long INF = 1001001001;
const long long MOD = 1000000007;
const double EPS = 1e-10;
ll GCD(ll a,ll b){
return b?GCD(b,a%b):a;
}
ll LCM(ll a,ll b){
if(a==0)return b;
if(b==0)return a;
return a/GCD(a,b)... | #include <iostream>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include<cctype>
#include... | 1 | 48,551,454 |
#include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
using namespace std;
int n,i,f[500005];
long long sum;
string st;
int main(){
cin>>st;n=st.size();
rep(i,n){
if(st[i-1]=='<') f[i]=max(f[i],f[i-1]+1);
}
rep(i,n){
if(st[n-i]=='>') f[n-i]=max(f[n-i],f[n-i+1]+1);
}
rep(i,n+1){
sum+=f[i-1];
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
string str;
cin>>str;
int n=str.size();
int arr[n+1]={0};
for(int i=0;i<n;i++)
{
if(str[i]=='<'){
... | 1 | 30,636,302 |
#include <cstdio>
long long mod = 1000000007;
long long big(long long b, long long p){
if (p == 1) return b;
long long h = big(b, p / 2);
long long res = (h * h) % mod;
if (p % 2 == 1) res = (res * b) % mod;
return res;
}
int main(){
long long n, k;
scanf("%lld %lld", &n, &k);
long long a[n];
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main () {
long long N,K;
cin >> N >> K;
vector<long long>A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<long long>counta(N,0);
vector<long long>countb(N,0);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(... | 1 | 79,849,969 |
#include <bits/stdc++.h>
using namespace std;
bool dp[8001][40000];
int solve(vector<int> a, int x){
fill((bool*)dp, (bool*)(dp+8001) , 0);
dp[0][20000] = 1;
int n = a.size();
for(int i = 0;i < n;i++){
for(int j = 0;j < 40000;j++){
if(j+a[i] < 40000)dp[i+1][j+a[i]] = max(dp[i+1][j+a[i]], dp[i][j]);
if(j-a[i... | #include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int a[8007];
bool dp[8007][16007];
int main()
{
string s;
cin>>s;
int fx,fy,i,j;
cin>>fx>>fy;
int m=0,k=0;
for(i=0;i<s.size();i++)
{
if(s[i]=='T')
{
k++;
a[k]=m;
m=0;
}
else
m++;
}
k++;
a[k]=m;
dp[1][a[1]+8000]=1;... | 1 | 16,264,232 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <set>
#include <deque>
using namespace std;
typedef long long LL;
const int inf = 1 << 30;
const LL INF = 1LL << 60;
const int MaxN = 100000;
int n;
int ans[505][505];
int main()
... | #include<bits/stdc++.h>
#define LL long long
#define RG register
#define R RG int
using namespace std;
vector<int>c[400];
int main(){
R n,now=0;
cin>>n;
R d=(1+sqrt(1+8*n))/2;
if(d*(d-1)!=2*n)return puts("No"),0;
printf("Yes\n%d\n",d);
for(R i=1;i<=d;++i){
printf("%d",d-1);
for(R j=1;j<i;++j)
printf(" %d",... | 1 | 74,508,718 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;
int counter1[100005];
int counter2[100005];
int len1,len2;
int main(){
int n;
cin>>n;
if(n%2){
len1 = n/2+1;
len2 = n/2;
}
else{
len1 = n/2;
len2 = n/2;
}
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
for(int i=0; i<n; i+=2... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | 1 | 45,299,503 |
#include <iostream>
using namespace std;
int main () {
int a , b , c , count;
cin >> a >> b >> c ;
for (int i=a;i<=b;i++) {
if ( c%i==0 ) {
count = count + 1;
}
}
cout << count << endl;
return 0;
} | #include <stdio.h>
using namespace std;
int main(){
int a,b,c,count = 0;
scanf("%d %d %d",&a,&b,&c);
for(int i = a; i <= b; i++){
if(c%i == 0) count++;
}
printf("%d\n",count);
} | 1 | 58,248,369 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define PI 3.141592653589793238
#define all(a) a.begin(),a.end()
#define dbg(n) cout<<#n<<' '<<n<<endl;
#define dbg_v(v) cout<<#v<<":";for(int i=0;i<(in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
for (auto&& e : p) {
cin >> e;
}
for (auto&& e : q) {
cin >> e;
}
for (auto&& e : r) {
... | 1 | 72,527,771 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, x, j, k;
while(cin >> n >> x && (n || x)) {
if(x > 3*n - 3) {
cout << "0\n";
continue;
}
int count = 0;
int kmax = min(n+1, x-2);
for(k = max(3,x-2*n+3); k < kmax; ++k) {
int jmax = min(k, x-k);
for(j ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int n,x,cnt;
int i,j,k;
scanf("%d",&n); scanf("%d",&x);
while(n!=0||x!=0){
cnt=0;
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
for(k=j+1;k<=n;k++){
if(i+j+k==x) cnt++;
... | 1 | 3,964,936 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
#define IOS ios::sync_with_stdio(false)
const int maxn = 3e5 + 5;
int r[maxn], c[maxn];
map<pii, bool> mp;
vector<int> vr, vc;
void solve() {
int h, w, m;
scanf("%d... | #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 h, w, m;
cin >> h >> w >> m;
vector<int> hs(h), ws(w);
set<P> s;
rep(i, m) {
int r, c;
cin >> r >> c;
--r; --c;
hs[r]++; ws[c]++;
... | 1 | 47,203,846 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
int main(){
int n,z,w;
cin>>n>>z>>w;
int a[20005];
rep(i,n) cin>>a[i];
if(n-2>=0) cout<<max(abs(w-a[n-1]),abs(a[n-1]-a[n-2]));
else cout<<abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Z,W;
cin >>N>>Z>>W;
vector<int>a(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
if(N==1){
cout<<abs(a.at(0)-W)<<endl;
}else{
int kotae=max(abs(a.at(N-1)-W),abs(a.at(N-2)-a.at(N-1)));
cout<<kotae<<endl;
}
return 0;
} | 1 | 63,072,703 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int w,h,p;
vector< pair<int,int> > v;
cin>>w>>h;
for(int i=0;i<w;i++)cin>>p,v.push_back(make_pair(p,1));
for(int i=0;i<h;i++)cin>>p,v.push_back(make_pair(p,2));
sort(v.begin(),v.end());
w++,h++;
int ans=0;
for(int i=0;i<... | 1 | 67,864,413 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main()
{
int a,b,c;
cin>>a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a==b && b==c && a==c){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 1 | 71,673,600 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<10) ... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | 1 | 47,711,724 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cctype>
#include<cstring>
#include<utility>
const int inf=0x7fffffff;
typedef long long int ll;
using namespace std;
int main()
{
#ifdef DEBUG
freopen("in", "r... | #include<iostream>
long long calc_sum(int n, int a[]){
long long sum=0;
for(int i=0; i<n; i++) {
sum += a[i];
}
return sum;
}
int seek_answer(int n, int a[], int minmax[]){
minmax[0] = a[0];
minmax[1] = a[0];
for(int i=1; i<n; i++) {
if(minmax[0] > a[i]) {
minmax[0] = a[i];
}
if(minmax[1] < a[i]) {
... | 1 | 40,734,636 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
ll n;
cin >> n;
vector<ll> t(n), x(n), y(n);
rep(i, n){
cin >> t[i] >> x[i] >> y[i];
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | 1 | 40,424,168 |
#include <iostream>
#include <vector>
using namespace std;
void chmin(int &a, int b) {
if (a > b) a = b;
}
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> ans(h, vector<int>(w, 1e6));
ans[0][0] = (s[0][0]... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<cstring>
#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_... | 1 | 64,847,715 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | 1 | 68,461,667 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
ll A, B, C, K;... | #include <bits/stdc++.h>
using namespace std;
long long a , b , c , k , sum;
int main(){
cin >> a >> b >> c >> k;
sum = a - b;
if(k % 2 == 0)cout << sum << endl;
else cout << -sum << endl;
} | 1 | 93,361,823 |
#include <iostream>
#include <string>
using namespace std;
class Dice{
public:
int *arr;
Dice(int arr2[]){arr = arr2;}
void roll(char direction){
int temp;
switch(direction){
case 'N':
temp = arr[0]; arr[0] = arr[1]; arr[1] = arr[5]; arr[5] = arr[4]; arr[4] = temp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
class Dice{
public:
int val[6];
Dice(int a[]){
copy(a,a+6,val);
}
int side(){
return val[2];
}
bool match(int f, int u){
return (val[0] == f && val[4] == u);
... | 1 | 37,527,508 |
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=50;
int n,a[N+9];
string s[N+9],t;
void into(){
cin>>n;
for (int i=1;i<=n;++i)
cin>>s[i]>>a[i];
cin>>t;
}
int ans;
void Get_ans(){
int flag=0;
for (int i=1;i<=n;++i){
ans+=flag*a[i];
if (s[i]==t) flag=1;
}
}
void work(){
Get... | 1 | 97,640,386 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
ll n,k,m=1e9+7,ans=0,k1,k2;
cin>>n>>k;
k1=((k*(k+1))/2)%m;
k2=((k*(k-1))/2)%m;
ll a[n+1];
for(ll i=1;i<=n;i++)
cin>>a[i];
ll b[n+1]={0},c[n+1]={0};
b[1]=0;
for(ll i=2;i<=n;... | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
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) ... | 1 | 80,993,659 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
for(auto x : s) {
sum = (sum + x - '0')%9;
}
cout << (sum ? "No" : "Yes");
} | #include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long int
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define sz(z) (int)z.size()
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define rev(i,a,b) for(int i=a... | 1 | 75,539,813 |
#include<algorithm>
#include<cmath>
#include<complex>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<deque>
#include<functional>
#include<iostream>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<string>
#include<vector>
#define REP(i, n) for(int i = 0; i < n; i++)
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int tmp = 1;
for(int i; i<N; i++){
int a, b;
a = tmp * 2;
b = tmp + K;
if (a<b){
tmp = a;
}
else{
tmp = b;
}
}
cout << tmp << endl;
} | 1 | 44,915,497 |
#include <bits/stdc++.h>
using namespace std;
#define sync ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define rep(i,n) for(int i=0; i<int(n); ++i)
#define repp(i,a,n) for(int i=a; i<int(n); ++i)
#define sz(x) int((x).size())
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define mp make... | #include<bits/stdc++.h>
using namespace std;
int h,w,m,h1,w1,maxr,maxc,row[300005],col[300005];
vector<int> vr;
vector<int> vc;
set<pair<int,int> > st;
int main(){
cin>>h>>w>>m;
for(int i=1;i<=m;i++){
cin>>h1>>w1;
st.insert(make_pair(h1,w1));
row[h1]++;
if(row[h1]==maxr){
vr.push_back(h1);
}
if(row[h1]... | 1 | 57,575,736 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
const ll INF = 1e16;
void solver(int N, string const &s, string const &t, int &ans){
int cnt{};
auto iter_t = t.begin();
auto iter_s = s.begin();
while(iter_s != s.end()){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string s, t; cin >> s >> t;
int m=s.size(); int l=t.size();
string s_ref="";
string t_ref="";
int d=0;
for(int i=0; i<min(m,l); i++){
s_ref = s[m-1-i] + s_ref;
t_ref = t_ref + t[i];
if(s_ref==t_... | 1 | 890,593 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int common = min(b, d) - max(a, c);
common = (common >= 0) ? common : 0;
cout << common << endl;
return EXIT_SUCCESS;
} | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | 1 | 65,530,728 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i <... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
{
cin >> V.at(i);
}
int res = 0;
for (int p = 1; p <= K && p <= N; p++)
{
for (int pl = 0; pl <= p; pl++)
{
int pr = p... | 1 | 55,849,976 |
#include <iostream>
#include <string>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
string s; cin >> s;
int ans = 0;
for (int i = 0; i < n-1; i++)
{
if(s[i] == s[i+1]) continue;
ans++;
}
cout << ans+1 << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
string b;
cin>>b;
int c=1;
for(int i=1;i<n;i++){
if(b[i-1]!=b[i]){
c++;
}
}
cout<<c;
return 0;
} | 1 | 81,864,823 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
char a,b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b;
if(a==b)
cout<<"H";
else
cout<<"D";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
const ll mod = 1000000007;
ll gcd(ll a,... | 1 | 38,693,492 |
# include <iostream>
# include <math.h>
using namespace std;
int main()
{
int X, N;
cin >> X >> N;
int* p;
p = new int[N];
for (int i = 0; i < N; i++)
{
cin >> p[i];
}
bool found = true;
int output = 0;
for (int i = 0; i < N; i++)
{
if (p[i] == X)
{
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, N;
cin >> X >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) cin >> p.at(i);
for (int i = 0; i <= 50; i++) {
bool flag1 = true;
bool flag2 = true;
for (int j = 0; j < N; j++) {
if (X - i == p.at(j)) {
flag1 = fa... | 1 | 27,355,332 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#d... | #include<bits/stdc++.h>
using namespace std;
set<int> dcare;
int solve(){
int n,target,up,down,temp;
cin>>target>>n;
for(int i=0;i<n;i++){
cin>>temp;
dcare.insert(temp);
}
up=target;down=target;
if(dcare.count(target)==0) return(target);
while(1){
up++;down--;
if(dcare.count(down)==0) retu... | 1 | 94,677,893 |
#include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <functional>
#include <queue>
#include <math.h>
#include <cmath>
#include <unordered_map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
const string YES = "Yes";
const string ... | #pragma warning(disable:4996)
#include <stdio.h>
int main()
{
double d, t, s;
scanf("%lf %lf %lf", &d, &t, &s);
if (d / s > t) printf("No");
else printf("Yes");
} | 1 | 92,895,358 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 1000000007
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
cin>>s;
int n=s.size();
int sum =0;
for(int i=0;i<n;i++){
sum+=(s[i]-'0');
}
if(sum%9)
cout<<"No"<<endl;
else
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
char c;
c = getchar();
long long int ans = 0;
while(c!='\n'&&c){
... | 1 | 50,460,952 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void) {
int n = 0;
while (cin >> n) {
if (n == 0) {
break;
}
int A[1000];
for (int i = 0; i < 1000; i++) {
A[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void solve()
{
int n;
while (cin >> n, n)
{
vector<int> a(n);
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
sort(a.begin(), a.end());
int minv = a[1] - a[0];
for (int i = 1; i < n - 1; ++i)
{
minv = min(minv, a[i + 1... | 1 | 55,382,063 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename K,typename V>
using umap = unordered_map<K,V>;
template <typename V>
using uset = unordered_set<V>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | 1 | 25,193,438 |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
#include <numeric>
using namespace std;
using ll = long long;
#define rep_init... | #pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | 1 | 40,281,118 |
#include <iostream>
using namespace std;
int main(){
int n=1000 ,m ,coin=0;
while( true ){
cin >> m;
if( m == 0 ){
break;
}
n -= m;
if( n >= 500 ){
coin += n / 500;
n %= 500;
}
if( n >= 100 ){
coin += n / 100;
n %= 100;
}
if( n >= 50 ){
coin +... | #include <iostream>
using namespace std;
int main() {
while(true){
int x;
cin>>x;
if(x==0){
break;
}
int ans=0,change=1000-x,money[6]={500,100,50,10,5,1};
for(int i=0;i<6;i++){
int n=change/money[i];
ans+=n;
change-=money[i]*n;
}
cout<<ans<<endl;
}
return 0;
} | 1 | 14,417,227 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using pii = pair... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<iomanip>
#include<deque>
using namespace std;
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define rep2(i,j,n) for(int i=(j);i<=... | 1 | 76,454,230 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[4],b[4],c,d;
int main(){
c=0;d=0;
for(int i=0;i<4;i++){cin>>a[i];c+=a[i];}
for(int i=0;i<4;i++){cin>>b[i];d+=b[i];}
cout<<max(c,d)<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int Ai,Am,As,Ae;
int Bi,Bm,Bs,Be;
int S,T;
cin >> Ai >> Am >> As >> Ae >> Bi >>Bm >> Bs >> Be;
S=Ai+Am+As+Ae;
T=Bi+Bm+Bs+Be;
if(S>=T){
cout << S << endl;
}
else{
cout << T << endl;
}
return 0;
} | 1 | 78,645,573 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int dx[4] = {-1, 1, ... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 1 | 25,246,565 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
vector<int> l(n + 1);
l[0] = 2;
l[1] = 1;
for (int... | #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... | 1 | 100,833,738 |
#include <iostream>
using namespace std;
int main() {
int A[9];
for (int i = 0; i < 9; i++) cin >> A[i];
int N; cin >> N;
int b[N];
for (int i = 0; i < N; i++) cin >> b[i];
bool flag[9];
for (int i = 0; i < 9; i++) flag[i] = false;
for (int i = 0; i < N; i++){
for (int j = 0; j < 9; j++){
if (... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 1 | 55,713,852 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | #include <iostream>
#define _USE_MATH_DEFINES
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <math.h>
using namespace std;
int main()
{
int S, W;
std::cin >> S >> W;
if (W >= S) {
std::cout << "unsafe";
}
else {
std::cout << "safe";
}
return 0;
} | 1 | 28,468,333 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double a,b;
cin>>a>>b;
if(a>b)cout<<"GREATER"<<endl;
else if(a<b)cout<<"LESS"<<endl;
else cout<<"EQUAL"<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | 1 | 49,354,690 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
char fi[110][110];
int main(){
int h,w;
cin>>h>>w;
rep(i,h){
rep(j,w){
cin>>fi[i][j];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> a(H, vector<char>(W));
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> a.at(i).at(j);
}
}
int row = H;
int col = W;
vector<int> memorow;
... | 1 | 10,230,704 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
long long a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
if(i > 0) a[i] += a[i-1];
}
sort(a, a + n);
long long res = 0;
int id = 0;
while (id < n)
{
long long cnt = upper_bound(a, a + n, a[id]) - a - id;
if(a[id] == 0) res += ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 1 | 8,655,208 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];... | 1 | 76,725,090 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> list(5);
int t,j=0,mw=0;
for(int i=0; i<5; i++) {
cin >> list.at(i);
t = 10-(list.at(i)%10);
if(j < t && t != 10) {
j = t;
mw = i;
}
}
int ans=0,x;
for(int i=0; i<5; i++) {
if(i != mw) {
x = list.at(i... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> v(5);
vector<int> num(5);
for(int i=0; i<5; i++){
cin >> v[i];
num[i]=i+1;
}
int ans=-1;
do{
int temp=0;
for(int i=0; i<5; i++){
temp=ceil((double)temp/10)*10+v[num[i]-1];
}
if(ans<0) ans=temp;
else ans=mi... | 1 | 76,174,100 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include<iostream>
#include<string>
int main() {
int a, b, c; std::cin >> a >> b >> c;
int mod = a%b;
int plus = a;
a += plus;
bool f;
while(1) {
if(a%b == c) {
f = true;
break;
} else if(a%b == mod) {
f = false;
break;
}
... | 1 | 54,630,335 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i=0; i<N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end());
long long S=0;
for (int i=K; i<N; i++) {
S+=V[i];
}
cout << S << endl;
} | 1 | 51,774,721 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int a[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
int c = 0;
for(int i = 0; i < n; i++){
if(a[i] == c... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> a(N);
int cnt = 0, num = 1;
for(in... | 1 | 24,333,230 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> P;
vector<vector<int>> City(n+1);
for(int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
City[p].push_back(y);
P.push_back(make_pair(p, y));
}
for(int i =... | #include <bits/stdc++.h>
using namespace std;
struct StCity
{
StCity() : m_nPref(0), m_nYear(0) { }
int m_nPref;
int m_nYear;
};
void input(int& rnPrefSiz, vector<StCity>& rvoCity)
{
int nCitySiz;
cin >> rnPrefSiz >> nCitySiz;
rvoCity.resize(nCitySiz);
for (StCity& roCity : rvoCity)
{
cin >> roCity.... | 1 | 58,450,015 |
#include <iostream>
using namespace std;
int main()
{
string N;
cin >> N;
int num = stoi(N);
int *aN = new int[num];
string a;
int inNum;
for(int i = 0; i < num; ++i)
{
cin >> a;
inNum = stoi(a);
aN[i] = inNum;
}
int result;
int temp;
int counter =... | #include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int n,c;
int a;int b=1e9;
cin >> n;
vector<int> v;
for (int i=0;i<n;++i){
cin >> c;
... | 1 | 25,390,880 |
#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<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
ll a, b;
cin >> a >> b;
rep(i, 3) {
if (a != i + 1 && b != i + 1) {
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout<<(6-a-b)<<"\n";
} | 1 | 55,390,593 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> abc(3);
for(int i=0;i<3;i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
cout << abc[2]*10+abc[1]+abc[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a, b, c; cin >> a >> b >> c;
int x1 = stoi(a + b) + stoi(c);
int x2 = stoi(b + a) + stoi(c);
int x3 = stoi(b + c) + stoi(a);
int x4 = stoi(c + b) + stoi(a);
int x5 = stoi(c + a) + stoi(b);
int x6 = stoi(a + c) + stoi(b);
cou... | 1 | 97,425,391 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
char C;
cin >> C;
char ans = (char)((int)C +1);
cout << ans << endl;
} | #include<stdio.h>
int main(){
char C;
scanf("%c", &C);
printf("%c", C + 1);
return 0;
} | 1 | 28,518,243 |
#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++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
string str;
long long cnt = 0;
long long all = 0;
cin >> num >> str;
vector<int> r;
vector<int> g;
vector<int> b;
for (int i = 0; i < num; i++) {
if (str.at(i) == 'R')
r.push_back(i);
else... | 1 | 71,679,231 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | 1 | 31,191,888 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
string con[15] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main() {
string s;
int n;
cin >> n;
for(int q = 0; q < n; ++q){
cin >> s;
string ans("");
P cnt;
cnt.first = cnt.second = 0;
for(int i = 0; i < ... | 1 | 31,987,726 |
#include <stdio.h>
int main(){
int a;
scanf("%d", &a);
char str[a];
scanf("%s", str);
int flag = 1;
if(a%2 != 0){
flag = 0;
}
else{
for(int i = 0, j=a/2; i<a/2; i++, j++){
if(str[i] != str[j]){
flag = 0;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 1 | 54,444,478 |
#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t,int64_t> pll;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};
#define rep(i,a,b) for (int64_t i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
#define ALL(a) begin(a),end(a)
#define ... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 1 | 95,468,265 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum_a = 0, sum_b = 0;
rep(i, n) sum_a += a[i];
rep(i, n) sum_... | 1 | 11,529,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll compute(int ind, set<int> &st){
auto rit = st.upper_bound(ind);
auto lit = st.upper_bound(ind); lit--;
int r1 = *rit; rit++;
int l1 = *lit;
if(rit == st.end()){
lit--; int l2 = *lit;
r... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
const int man = 2e5+10;
#define IOS ios::sync_with_stdio(0)
template <typename T>
inline T read(){T sum=0,fl=1;int ch=getchar();
for(;!isdigit(ch);ch=getchar())if(ch=='-')fl=-1;
for(;isdigit(ch);ch=getchar())sum=sum*10+ch-'0';
return sum*fl;}
template... | 1 | 53,342,151 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <map>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int cnt[n];
fill(cnt, cnt+n, 0);
for (int i=0, a; i<n; i++) {
cin >> a;
cnt[a-1]++;
}
int rui[... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | 1 | 63,159,259 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define for0(n) for(i=0; i<(n); i++)
#define for1(n) for(i=1; i<=(n); i++)
#define PI acos(-1)
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
double _,i,j,n,a,b,e,k,u,t,x=1,m,y,q,f=1,c=0,d=0,l,p,z,o,r,g;
string ss,s;
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, x;
cin >> a >> b >> x;
double y = (2 * (x / a)) / b;
if (y < a)
cout << fixed << setprecision(10)
<< atan(b / y) * 180 / (atan(1.0) * 4) << endl;
else {
y = (2 * (x / a)) / a - b;
cout << fix... | 1 | 97,579,498 |
#include <bits/stdc++.h>
using namespace std;
const int nax=1e5+5;
const int mod=1e9+7;
#define ll long long
void add_self(int &a,int b)
{
a+=b;
if(a>=mod)
a-=mod;
}
void sub_self(int &a,int b)
{
a-=b;
if(a<0)
a+=mod;
}
int main()
{
int n,k;
cin >> n >> k;
vector<int> dp(k+1);
dp... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | 1 | 23,621,716 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
#define all(v) v.begin() ;v.end()
#define endl "\n";
void fast() {
cin.tie(0);
cin.sync_with_stdio(0);
}
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
#define int long long
#define For(i,x,y) for(int i = x; i <= y; ++i)
#define FOR For
#define rev_For(i,x,y... | 1 | 85,754,055 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int w, h, n;
cin >> w >> h >> n;
int grid[w][h];
memset(grid, 0, sizeof(grid));
for (int i = 0; i < n; ++i) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
for (int i ... | 1 | 33,094,544 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string alp = "abcdefghijklmnopqrstuvwxyz";
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
int main(){
long long A,B;
cin >> A >> B;
cout << A*B-A-B+1 << endl;
return 0;
} | 1 | 40,388,871 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
const int INF = 1e9 + 1;
const ll LLINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int H, W;
cin >> H >> W;
ll ans = LLINF;
for(int h = 1; h < H... | 1 | 91,707,032 |
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 1 | 82,218,626 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B) {
if (A == 1) {
cout << "Alice" << endl;
return 0;
}
cout << "Bob" << endl;
} else if (A > B) {
if (B == 1) {
cout << "Bob" << endl;
return 0;
}
cout << "Alice" << en... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if ((A + 12) % 14 > (B + 12) % 14) cout << "Alice" << endl;
else if ((A + 12) % 14 < (B + 12) % 14) cou... | 1 | 85,511,388 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> d(n);
for(int i=0;i<n;i++) cin >> d[i];
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
ans+=d[i]*d[j];
}
}
cout << ans/2;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | 1 | 4,797,008 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 1 | 81,995,219 |
#include<iostream>
#include<vector>
#include<string>
#include<map>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inl... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 1 | 12,208,743 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <cmath>
#include <numeric>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pii pair<int, int>
#define vi vector<int>... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 1 | 31,569,474 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=2e9;
const ll INF=1e18;
using P=pair<int,int>;
int dx[4]={1,0,-1,0},dy... | 1 | 5,730,997 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
long long int temp,*a;
long long int sum=0;
cin>>n;
a=new long long int[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
sum-=2*a[0];
temp=abs(sum);
for(int i=1;i<n-1;i++)
{
sum-=2*a[i];
if(temp>abs(sum))
temp=abs(sum);... | #include <iostream>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <cstring>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll ... | 1 | 97,060,599 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
int64_t e=0;
cin >> n >> k;
vector<int64_t>h(n);
for(int i=0;i<n;i++){
cin >> h.at(i);
}
sort(h.begin(),h.end());
if(k<=n){
for(int i=0;i<n-k;i++){
e+=h.at(i);
}
cout << e << endl;
}
else{
cout << 0 << endl;
}
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main ()
{
ll i,j,k,n,c=0;
vector<ll> v;
cin>>n>>k;
for(i=0;i<n;i++)
{ll q; cin>>q; v.push_back(q);}
if(k>=n)
{
cout<<0;
}
else
{
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
... | 1 | 8,209,668 |
#include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll MOD = 1000000007;
const ll N = 300... | #include <bits/stdc++.h>
#define len(x) ((int)(x).size())
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<pair<int, bool>> contest_result(105000, make_pair(0, false));
int WA_count = 0;
int AC_count = 0;
while (M--) {
int p;
string S;
... | 1 | 47,471,253 |
#define scanf_s scanf
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX 200
int main(void)
{
int n,a, b, c,x, sum, cou = 0;
scanf_s("%d", &n);
for (int i = 0; i < n; ++i) {
scanf_s("%d %d %d", &a, &b, &c);
if (a > b) {
x = a; a = b; b = x;
}
if (b > c) {
x = b; b = c; c = x;
}
... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
for (cin >> n; n; n--) {
int a, b, c;
cin >> a >> b;
if (a < b) {
int tmp = b;
b = a;
a = tmp;
}
cin >> c;
if (a < c) {
int tmp = c;
c = a;
a = tmp;
}
cout << (pow(a, 2) == pow(b, 2) + pow(c, 2) ? "YES" : "... | 1 | 798,971 |
#include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<(int)(n);i++)
#define FORR(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
using namespace std;
typedef long long ll;
void solve(){
char c;
int cnt[26]={};
while(cin>>c){
c=tolower(c);
cnt[c-'a']++;
}
FOR(i,26){
char cc='a'+i;
cout<<cc<<" : "<<cnt[i]<<endl;... | #include<stdio.h>
#include<ctype.h>
int main(void)
{
char ddcnt[27]="abcdefghijklmnopqrstuvwxyz";
char ch;
int dcnt[27]={0};
while ( scanf("%c", &ch) != EOF ){
ch=tolower(ch);
int num=ch-'a';
dcnt[num]++;
}
for(int i=0;i<26;i++)
printf("%c : %d\n",ddcnt[i],dcnt[i]);
return 0;
} | 1 | 87,145,538 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string a,b;
cin>>a>>b;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string a,b;
cin >> a >> b;
int c = 0;
if(a.size() > b.size()) cout << "GREATER" << endl;
else if(a.size() < b.size()) cout << "LESS" << endl;
else{
for(int i=0; i<a.size(); i++){
if((int)a[i] > (int)b[i]){
c+... | 1 | 93,611,653 |
#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 solve(vector<int> v1, vector<int> v2) {
map<int, int> mp1;
for (auto x : v1) mp1[x]++;
int max_idx1, max_v1 = 0;
for (auto x : mp1) {
if (max_v1 < x.second) {
... | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 1 | 34,644,299 |
#include<bits/stdc++.h>
using namespace std;
int n,m;
double ans;
int main(){
int x=1;
cin>>n>>m;
for(int i=1;i<=n;i++){
int k=max(0.0,ceil(log2(1.0*m/i)));
ans+=1.0/((1<<k)*n);
}
printf("%.10lf",ans);
} | #include<iostream>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
double m = 1;
double ans = 0;
for (int i = n; i > 0; i--) {
if (i * m >= k) ans += 1 / (m * n);
else {
while (i * m < k) m *= 2;
ans += 1 / (m * n);
}
}
prin... | 1 | 4,603,596 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | 1 | 88,633,208 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int gcd(int a, int b) {
int r = a % b;
while (r != 0) {
a ... | #include<bits/stdc++.h>
using namespace std;
signed main()
{
int x;
cin>>x;
cout<<360/(__gcd(360, x))<<endl;
} | 1 | 16,891,244 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int euclid(int x, int y){
if(min(x, y) == 0) return max(x, y);
else return euclid(max(x, y)% min(x, y) , min(x, y)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
ll gcd(ll a,ll b){
if(a%b==0) return b;
return gcd(b,a%b);
}
int main(){
ll n,x;
cin>>n>>x;
vector<ll> dat(n);
rep(i,n){
ll... | 1 | 52,261,082 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.