code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int a,b;
double C,c;
double S,L,h;
cin >> a >> b >> C;
double PI = acos(-1);
C = C * PI / 180;
S = a * b * sin(C) / 2;
c = sqrt( a*a + b*b - 2*a*b*cos(C) );
L = a + b + c;
h = b * sin(C);
printf ("%lf\n%lf\n%lf",... | #define _USE_MATH_DEFINES
#include <iostream>
#include <cmath>
#include<iomanip>
using namespace std;
double rad(int x);
int main() {
int a, b, C;
cin >> a >> b >> C;
double S, L, h;
S = 0.5*a*b*sin(rad(C));
L = sqrt(a*a + b*b-2*a*b*cos(rad(C)))+a+b;
h = S * 2 / a;
cout <<setprecision(20)<< S <<endl;
cout << L ... | 1 | 91,593,669 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=2e9;
const ll INF=5e18;
typedef pair<int,int> P;
int main() {
cin.... | 1 | 36,375,057 |
#include<bits/stdc++.h>
using namespace std;
bool comp(vector<int> a, vector<int> b){
return a[0] < b[0];
}
int time(string str){
int s = (int)str[7] - '0' + ((int)str[6] - '0')*10;
int m = (int)str[4] - '0' + ((int)str[3] - '0')*10;
int h = (int)str[1] - '0' + ((int)str[0] - '0')*10;
return s + 6... | #include <bits/stdc++.h>
using namespace std;
int toNum(string s){
int time = 0;
time += (s[0] - '0') * 10 * 3600;
time += (s[1] - '0') * 3600;
time += (s[3] - '0') * 10 * 60;
time += (s[4] - '0') * 60;
time += (s[6] - '0') * 10;
time += (s[7] - '0');
return time;
}
int main(){
int n... | 1 | 32,966,239 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
int solve(int arr[],int n){
int res=0;
for (i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if(a <= c && c <= b) printf("Yes\n");
else printf("No\n");
} | 1 | 35,779,990 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <assert.h>
#include <numeric>
#include <math.h>
#include <climits>
#include <stack>
#include <iomanip>
#include <sstream>
using namespace std;
template <typename T>
inline bool sign(T A) {
return (A>0)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 1 | 51,407,244 |
#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;
typedef long long ll;
int main() {
int x, y; cin >> x >> y;
string ans = "No";
if (y % 2 == 1) {
cout << ans << endl;
return 0;
}
if (2 * x <= y && y <= 4 * x) ans = "Yes";
cout << ans << endl;
return 0;
} | 1 | 65,943,373 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<string>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
sort(a.at(i).begin(),a.at(i).end());
}
sort(a.begin(),a.end());
long long cnt=0,count=0;
string copy=a.at(0);
for(int i=0;i<n;i++){
if(a.at(i)==copy){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<string> s(100000);
map<string, int> mp;
long long ans =0;
for(int i=0; i<n; i++){
cin >> s[i];
sort(s[i].begin(), s[i].end());
if(mp.count(s[i])){
ans += mp[s[i]];
mp[s[i]... | 1 | 23,222,262 |
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#define MAX_N 1001
int solve(std::string s,std::string t){
int dp[MAX_N][MAX_N]={0};
int n,m;
n=s.size();
m=t.size();
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(s[... | #include <iostream>
#include <algorithm>
#define MAX_N 1001
using namespace std;
int n,m;
string s,t;
int dp[MAX_N+1][MAX_N+1];
void solve(){
for(int i=0;i<n;i++)
for(int j=0;j<m;j++){
if(s[i]==t[j]) dp[i+1][j+1]=dp[i][j]+1;
else dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
}
cout<<dp[n][m]<<endl;
}... | 1 | 16,895,262 |
#include <iostream>
using namespace std;
int main()
{
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
}
else if (a == 'C') {
cout << 'G' << endl;
}
else if (a == 'G') {
cout << 'C' << endl;
}
else {
cout << 'A' << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
char c;
cin >> c... | 1 | 29,195,355 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N=110,K=100100,mod=1e9+7;
int a[N];
int dp[N][K];
int n,k;
main(){
cin.tie(0);cin.sync_with_stdio(0);
cin>>n>>k;
for(int i=0;i<n;++i)cin>>a[i];
dp[0][0]=1;
dp[0][1]=-1;
for(int i=0;i<=n;... | #include<iostream>
#include <iosfwd>
#include<limits.h>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <algorithm>
#include <limits>
#include<stdio.h>
#include <queue>
#include <stack>
#include <math.h>
#include<string.h>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <set... | 1 | 75,620,239 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | #include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}... | 1 | 20,913,362 |
#include <iostream>
class data
{
private:
int x;
int y;
public:
void set_x(int x)
{
this->x = x;
}
void set_y(int y)
{
this->y = y;
}
int get_x(void)
{
return this->x;
}
int get_y(void)
{
return this->y;
}
void swapping(void)
... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 3000;
int main() {
for (int i = 0; i < MAX_N; i++) {
int x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
break;
} else {
if (x < y) {
cout << x << " " << y << endl;
} else... | 1 | 12,785,364 |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define shalaby ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);cerr.tie(0);
#define mod 100000000
using namespace std;
inline int D()
{
int t;
scanf("%d",&t);
return t;
}
inline ll llD()
{
ll t;
scanf("%lld",&t);
return ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define loop(i, n) for(int i = 0 ; i < n ; ++i)
#define rloop(i, n) for(int i = int(n)-1 ; i >= 0 ; --i)
#define loopOne(i, n) for(int i = 1 ; i <= n; ++i)
#define range(i, a, b) for(int i = int(a) ;... | 1 | 35,751,252 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long INF = (1LL<<62);
typedef long long L... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | 1 | 24,702,976 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int x,sum = 0,ans = 0;
cin >> x;
while(true){
sum += x;
ans++;
if(sum%360 == 0){
cout << ans << endl;
return 0;
}
}
} | 1 | 46,629,162 |
#include<bits/stdc++.h>
#define INF 0x7f7f7f7f
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int cost[100][100];
int main() {
int v, e; scanf("%d%d", &v, &e);
memset(cost, 0x7f, sizeof(cost));
rep(i, v)cost[i][i] = 0;
rep(i, e) {
int s, t, d; scanf("%d%d%d", &s, &t, &d);
cost[s][t] = d;
}
rep(k, v... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10);
}
#define... | 1 | 52,915,014 |
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#define rep(i ,n) for(int i=0;i<(int)(n);++i)
#define repr(i ,n) for(int i=n;i>(int)(n);--i)
#define rep1(i ,n) for(int i=1;i<=(int)(n);++i)
#define ALL(a) a.begin(), a.end()
#define RSORT(a) sort(ALL(a),greater<>())
#define SORT(a) sort(ALL(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a[100000];
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
int dp[100000];
int inf=1111111111;
for(int i=0;i<100000;i++)dp[i]=inf;
int ans=0;
for(int i=0;i<n;i++){
int lb=-1,ub=99999;
while(ub-lb>1){
int m=(lb+ub)/2;
if(dp[m]<a[i]... | 1 | 51,185,461 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef pair<ll,l... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 1 | 79,033,587 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7, N = 2005;
int n, dp[N], s;
int solve(int sum) {
if (sum > s) return 0;
if (sum == s) return 1;
int res = 0, &ans = dp[sum];
if (~ans) return ans;
for (int i = 3; i <= s; i++) {
res += (solve(sum + i))... | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
constexpr long long INFLL = 1e18;
constexpr long long aPN = 1e9 + 7;
using namespace std;
using ll = long long;
using P ... | 1 | 75,845,835 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(NULL);
int a,b;
cin>>a>>b;
cout<<((a*3)+b)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<int, int, int> T;
constexpr int INF ... | 1 | 9,289,569 |
#include <iostream>
using namespace std;
long long calc(long long n)
{
if(n%2 == 0)
{
return n^((n/2)%2);
}
else
{
return ((n+1)/2)%2;
}
}
int main()
{
long long a,b;
cin >> a >> b;
cout << (calc(b)^calc(a-1)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | 1 | 43,764,066 |
#include <bits/stdc++.h>
#define LL long long
#define mp make_pair
#define pb push_back
#define INF (1<<29)
using namespace std;
typedef pair<int,int>pii;
int n,m;
vector<pii>G[200010];
int col[200010];
int vis[200010];
bool dfs(int x,int co){
if(vis[x]!=-1)return col[x]==co;
vis[x]=1;
col[x]=co;
for(pii i:G[x]){
... | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int src, dst;
long long weight;
Edge(int f, int t, long long w) {
src = f;
dst = t;
weight = w;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
bool conflict(Graph &g) {
int n = g.size();
vector<long long> dist(n);
vecto... | 1 | 4,438,360 |
#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++)
using ll = long long;
int digits(ll n) {
int cnt = 0;
while (n) {
cnt++;
n /= 10;
}
return cnt;
}
int main() {
ll N;
cin >> N;
ll an... | #include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=1010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
retur... | 1 | 47,738,763 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int ans;
vector<int> a(3);
rep(i, 3) cin >> a[i];
sort(a.rbegin(), a.rend());
int m = a[0];
int... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int x = max({a, b, c});
if(x%2 != (a+b+c)%2){
... | 1 | 48,203,046 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,a[201000];
bool check(int k){
map<int,int> mp;
for(int i=2;i<=n;i++)
if(a[i]<=a[i-1]){
while(mp.size()&&(--mp.end())->first>a[i]) mp.erase(--mp.end());
mp[a[i]]++;
int now=a[i];
while(now>0&&mp[now]>=k) mp.erase(now),mp[--now]++;
... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define LL long long
#define fgx cerr<<"--------------"<<endl;
#define dgx cerr<<"=============="<<endl;
inline int read(){
int x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(... | 1 | 51,864,798 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> num;
ll d,a,b, k, c,m,mod=1e9+7;
ll DP[20][2520][2];
int mxlids,cnt;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define All(a) (a).begin(),(a).end()
void solve(){
ll a,b,c,d,tmp;
cin >>a>>b>>c>>d;
tmp=max({a*c,a*d,b*c,b*d});
cout<<tmp<<endl;
}
int main(){
solve();
return 0;
} | 1 | 66,619,584 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,k;
cin >>h>>w>>k;
long long maisuu=0;
for(int i=0;i<=h;i++){
for(int j=0;j<=w;j++){
maisuu=i*w-j*i+(h-i)*j;
if(maisuu==k){
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
return 0;
} | 1 | 62,294,398 |
#include <iostream>
using namespace std;
#define int long long
const int N = 1e5+5, LOGN = 20, INF = 1e18+9;
int n, q, u, v, dist;
int a[N], jump[LOGN][N];
void init()
{
for (int i = 1; i <= LOGN; i++)
for (int j = 1; j <= n; j++)
jump[i][j] = jump[i-1][jump[i-1][j]];
}
int solve(int u, int v)
{... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(),v.... | 1 | 25,462,377 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ss(x) (int) x.size()
#define sz(x) (int) x.size()
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <=... | #include <bits/stdc++.h>
#define Maxn 507
#define inf 100007
using namespace std;
int n,p;
char s[Maxn];
int f[Maxn][30];
int main()
{
scanf("%s",s+1);
scanf("%d",&p);
n=strlen(s+1);
for (int i=n+1;i<=3*n;i++)
s[i]=s[i-n];
for (int i=1;i<=3*n;i++)
for (int j=1;j<=26;j++)
... | 1 | 57,470,331 |
#include <iostream>
#include <time.h>
#include <math.h>
using namespace std;
int main(){
string s, t;
int cnt = 0;
cin >> s >> t;
for (int i = 0; i < s.size(); i++){
if (!(s[i] == t[i])){
s[i] = t[i];
cnt++;
}
}
cout << cnt << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int res = 0;
string a, b;
cin >> a >> b;
for (int i = 0; i < a.length(); ++i)
res += (a[i] != b[i]);
cout << res << '\n';
return 0;
} | 1 | 8,343,068 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | #include<vector>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 100010
#define int long long
#define debug cout<<__LINE__<<" "<<__FUNCTION__<<"\n"
inline int read(){
int x=0,y=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')y=-1;ch=getchar();}... | 1 | 100,792,196 |
#include <cstdio>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
int N, K;
int main()
{
scanf( "%d%d", &N, &K );
printf( "%d\n", N-K+1 );
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 1 | 92,572,400 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,s;
cin>>n>>s;
if(n>s)
cout<<"safe";
else
cout<<"unsafe";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fill fill_n
#define pf push_front
#define pb push_back
#define FOR(i,l,r) for(int i=l;i<r;i++)
#define ROF(i,r,l) for(int i=r;i>=l;i--)
#define comp(v) (v).begin(),(v).end()
#define ff first
#define ss second
#define infile freopen("input.txt", ... | 1 | 76,695,176 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc011_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 1 | 41,760,792 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector <string> s(H);
for (int ii = 0; ii < H; ++ii){
cin >> s[ii];
}
vector<vector<int>> dp(H, vector <int> (W, 0));
dp[0][0] = (s[0][0]=='.') ? 0 : 1;
for (int h = 1; h < H... | #include<bits/stdc++.h>
using namespace std;
#define int long long
char s[110][110];
int dp[110][110];
const int inf = 1000;
signed main(void){
int h,w; cin >> h >> w;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> s[i][j];
dp[i][j] = inf;
}
}
dp[0][0] = 0;
for(int x = 0;... | 1 | 92,847,608 |
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
int main(void);
std::string rev_string(std::string str);
int main(){
std::string str = "";
std::cin >> str;
std::cout << rev_string(str) << std::endl;
return 0;
}
std::string rev_string(std::string str){
int i;
int len = str.length();
for ... | #include <iostream>
#include <string>
auto main () -> int
{
std::string s;
std::getline (std::cin , s);
for (auto ite = s.rbegin (); ite != s.rend (); ++ ite)
{
std::cout << * ite;
}
std::cout << std::endl;
} | 1 | 40,084,343 |
#include<bits/stdc++.h>
#define M 1000000007
#define pi ld(acos(-1.0))
#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 repp(i,a,b) for(int i=a;i<=(int)(b);i++)
#define Repp(i,a,b) for(int i=a;i>=(int)(b);i--)
#define cs ios_base::sync_with_stdio(0);cin.tie(0);cout.tie... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 1 | 16,983,945 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll cnt = 0;
rep(i,N-1){
ll n = (A[i]+A[i+1]) / 2;... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | 1 | 29,292,319 |
#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 all(x) (x).begin(),(x).end()
#define setout(n,x) setw(n) << setfill(x)
#define Fixed fixed << setprecision(10)
#define int long long
using pii = pair<int,int>;
constexpr int INF = 0x3f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int ans = 0;
int N, H, W;
cin >> N >> H >> W;
while(N--) {
int A, B;
cin >> A >> B;
if(A >= H && B >= W) ans++;
}
cout << ans << end... | 1 | 95,645,218 |
#include<bits/stdc++.h>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
using ll=long long;
int main()
{
int n,m;
cin >> n >> m;
priority_queue<ll> s;
for(int i=0;i<n;i++)
{
int a;
cin >> a;
s.push(a);
}
for(int i=0;i<m;i++)
{
int ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec)... | 1 | 27,746,404 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int main() {
#ifdef FASTIO
cin.tie... | #include <bits/stdc++.h>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
const int maxn = 5e5 + 1;
using namespace std;
int n;
string s;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
int n = s.... | 1 | 90,770,895 |
#include <bits/stdc++.h>
#define oo 0x3f3f3f3f
#define long long long
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(9), cout << fixed;
int h, w, n;
cin >> h >> w >> n;
vector<pair<i... | #include<bits/stdc++.h>
using namespace std;
int h,w,n,cou;
set<pair<int,int> > s;
long long grid[12];
int main()
{
int a,i,j;
int r,c;
scanf("%d %d %d",&h,&w,&n);
int ha = h-2,wa = w-2;
grid[0] = ((long long)ha * (long long)wa );
for(a=1;a<=n;a++)
{
scanf("%d %d",&r,&c);
if(r+2<=h && c-2>=1)
{
cou = 0... | 1 | 9,059,579 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
type... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn=10005;
int n,m;
bool vis[maxn];
vector<int>G[maxn];
vector<int>ans;
void dfs(int u) {
vis[u]=1;
for (int v:G[u])
if (!vis[v]) dfs(v);
ans.pb(u);
}
int main() {
cin>>n>>m;
for (int i=0;i<m;i++) {
int u,v... | 1 | 71,276,858 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
double b;
cin >> R;
cin >> G;
if (R < 0) {
exit (1);
}
if (G > 4500) {
exit (1);
}
if (G <= 0) {
b = -1 * R;
} else {
b = 2 * G - R;
}
cout << b << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | 1 | 49,794,715 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define mod 1000000007
#define inf 1e12
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int32_t main() {
IOS;
int h, w, m;
cin >> h >> w >> m;
vector<int> row(h, 0), col(w, 0);
set<pair<int, int>> target;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W, M;
cin >> H >> W >> M;
vector<int> rows(H, 0);
vector<int> cols(W, 0);
set<pair<int, int> > st;
for (int i=0; i<M; i++)
{
int h, w;
cin >> h >> w;
h--;
w--;
rows[h]++;
cols[w]... | 1 | 81,959,992 |
#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() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
if(a >= k) {
cout << k << endl;
return 0;
} else if(a + b >= k) {
cout << a << endl;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if (a >= k) {
ans += k;
a -= k;
k... | 1 | 98,425,737 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a,b,c;cin>>a>>b>>c;
int ans=c-(a-b);
if (ans>0) cout<<ans<<endl;
else cout<<0<<endl;
} | 1 | 40,718,641 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class Head,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n; cin>>n;
vector<ll> v(n);
vector<ll> dp(n,1);
int val=sqrt(n);
vector<int> primes(n+1,1);
primes[0]=primes[1]=0;
ll ans=1;
iota(v.begin(),v.end(),1);
for(int i=2;i*i<=n;i++){
if(primes[i]){
for(int j=i;j<=n;j+=... | 1 | 71,768,396 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
ll n, m;
vector<ll> x, y, z;
ll llmax(ll x, ll y)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
rep(i, 0, n) cin >> x[i] >> y[i] >> z[i];
ll ans = 0;
for(int i = 0; i < 8; i++){
... | 1 | 71,444,891 |
#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 <set>
#include <stdlib.h>
#include <string... | #include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition)... | 1 | 29,704,638 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
vec par(2e5+10);
map<ll,ll> si;
void init(ll n) {
for(ll i=0;i<n;i++) {
par[i]=i;
si[i]++;
}
}
ll root(ll x) {
if(par[x]==x) {... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 1
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
lli convert[26];
signed main... | 1 | 72,644,378 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
str... | 1 | 10,707,805 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
typedef pair<int,int> P;
typedef vector<int> V;
int main(){
while( 1 ){
int a, b, n;
cin >> a >> b;
cin >> n;
if( a == 0 && b == 0 ) break;
vector< V > map( a, V(b));
for( int i = 0; i < a; i++ ){
for( int j = 0; j < b; j++ ){
... | 1 | 32,734,705 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define endl "\n"
#define mp(a,b) make_pair(a,b)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
typedef unsigned long long ull;
bool sortbysecc(const pair<int,int> &a, const pair<int,int> &b){
retu... | 1 | 91,902,649 |
#include<stdio.h>
int main()
{
int a,s,y,t;
while(1){
scanf("%d %d",&a,&s);
if(a == 0 && s == 0)
break;
for(y=0;y<a;y++){
for(t=0;t<s;t++){
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int H, W;
while(true){
cin >> H >> W;
if(H==0&W==0) break;
else {
for(int i=0; i<H; i++){
for(int j=0; j<W; j++)cout << "#";
cout << endl;
}
cout << endl;
}
}
} | 1 | 10,221,507 |
#include <bits/stdc++.h>
#define REP( i , nn ) for(int i = 0 ; i < (int) nn; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 1 | 73,264,661 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int a,int b){return (int64_t)a*b/gcd(a, b);}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return false;}return ... | 1 | 13,029,129 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
vector<int> nums(N);
for (int i = 0; i < nums.size(); i++) {
cin >> nums[i] ;
}
sort(nums.begin(), nums.end());
int res = 0 ;
for (int i = 0; i < K; i++) {
res += nums[i];
}
cout <... | #include<bits/stdc++.h>
#include<climits>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define pqmaxi priority_queue<int>
#define pqmini ... | 1 | 8,963,994 |
#include <bits/stdc++.h>
using namespace std;
long long N, K;
vector<long long> sumV(100001);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
string s;
cin >> s;
for(int i = 0; i < 19; i++){
if(i == 5 || i == 13){
cout << " ";
} else{
cout << s[i]... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string s1, s2;
s1 = s.replace(5, 1, " ");
s2 = s1.replace(13, 1, " ");
cout << s2 << endl;
} | 1 | 1,062,194 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 1 | 71,590,712 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
using namespace std;
#define ll long long int
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, n) for(int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
using vi = vector<int>;
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, m;
cin >> n >> m;
int64_t ans;
if(2*n < m){
ans = n + (m - 2*n)/4;
}
else{
ans = m / 2;
}
cout << ans << endl;
} | 1 | 23,421,839 |
#include<cmath>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstdio>
#include<map>
#include<utility>
#include<list>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fori(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
const i... | #include <iostream>
#include <queue>
using namespace std;
class pos
{
public:
int x;
int y;
pos(int,int);
};
pos::pos(int a,int b)
{
x=a;y=b;
}
int main()
{
int w,h;
int g[21][21];
while(1)
{
cin>>w>>h;
if(w==0&&h==0) break;
for(int i=0;i<h;i++)
for(int j=0;j<w;j++)
g[i][j]=-1;
int psx,psy;
bo... | 1 | 69,072,675 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
double condition = 0.0;
bool kaibun(string S, int start, int length)
{
string tmp1, tmp2;
tmp1 = S.substr(start, length);
tmp2 = tmp1;
reverse(tmp2.begin(), tmp2.end(... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(long long i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
string s;
cin >> s;
int sl = s.length();
int sw = 0;
froop1(0,sl / 2){
if(s[i] != s[sl - i - 1]){
cout << "No" << endl;
return 0;
}
}
... | 1 | 71,030,091 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll h, w, dp[1007][1007];
char grid[1007][1007];
int main() {
cin >> h >> w;
for(ll i = 1; i <= h; ++i) {
for(ll j = 1; j <= w; ++j) cin >> grid[i][j];
}
dp[1][1] = 0;
bool ok = 1;
for(ll i = 1; i <= h; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int mxn=1e3+10;
ll dp[mxn][mxn];
char grid[mxn][mxn];
ll n,m;
inline ll add(ll a,ll b){
return (a%mod + b%mod)%mod;
}
int main(){
ll i,j;
cin >> n >> m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
cin >> grid[i][j];
}
}
... | 1 | 42,174,411 |
#include <iostream>
using namespace std;
int main()
{
int count[101] = {0},value,max;
while(cin >> value)
{
count[value]++;
}
max = count[0];
for(int i=0;i<100;i++)
{
if(max < count[i]) max = count[i];
}
for(int i=0;i<100;i++)
{
if(max == count[i]) cout<<i<<endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(){
map<int,int> mp;
int a;
while(cin>>a){
mp[a]++;
}
int ans=0;
for(int i=0;i<101;i++){
int b=mp[i];
ans=max(ans,b);
}
for(int i=0;i<101;i++){
if(mp[i]==ans)cout<<i<<endl;
}
return 0;
} | 1 | 38,173,018 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,sum=0;
cin>>a>>b>>c>>k;
while(k&&a){
sum++;
a--;
k--;
}
while(k&&b){
b--;
k--;
}
while(k&&c){
sum--;
c--;
k--;
}
cout<<sum<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | 1 | 39,171,311 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
vector<int> vec;
while (cin >> n) {
vec.push_back(n);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < vec.size(); i++) {
if (i > 0)
cout << ' ';
cout << vec... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3], minv;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 2; j > i; j--) {
if (a[j - 1] > a[j]) {
swap(a[j - 1], a[j]);
}
}
}
for (int i = 0; i < 3; i++) {
cout << a[i];
if (i ... | 1 | 62,387,336 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
vector<vector<pair<ll,ll>>> to(200000);
vector<ll> dis(200000);
void dfs(ll a,ll c,ll p = -1){
dis[a] = c;
for(auto r:to[a]){
if(r.first == p) continue;
dfs(r.first,c+r.second,a);
}
}
int main(){
... | 1 | 71,069,957 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
using ll = long long;
int main(){
ll N, M; std::cin >> N >> M;
std::vector<ll> a, b, c, d;
for(int i=0; i<N; ++i){
ll buf; std::cin >> buf; a.push_ba... | #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 endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 1 | 94,746,455 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
cout<<(m > n ? 0 : n-m+1)<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 1 | 31,154,011 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,b;
cin>>n;
int a[n+1];
long long ans=0;
for(int i=0;i<n+1;i++)cin>>a[i];
for(int i=0;i<n;i++){
cin>>b;
ans+=min(a[i],b);
b=max(0,b-a[i]);
ans+=min(a[i+1],b);
a[i+1]=max(0,a[i+1]-b);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<long> A(N+1); for (int i =0; i<N+1; i++) cin >> A.at(i);
vector<long> B(N); for (int i =0; i<N; i++) cin >> B.at(i);
long count =0;
for (int i =N; i>=1; i--) {
if (B.at(i-1) >= A.at(i)) {
count += A.at(i); B.at(i-1) -... | 1 | 63,544,869 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define isSu... | #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 | 54,898,548 |
#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>;
void fail() {
cout << -1;
exit(0);
}
int main() {
int n;
cin >> n;
++n;
vector<ll> a(n), b(n);
for (ll& i : a) cin >> i;
if (n == 1) return cout ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
Int power(Int a, Int n){
Int MOD = 1e9+7;
if(a == 0) return 0;
if(n == 0) return 1;
Int res = 1;
while(n > 0){
if(n %... | 1 | 18,161,074 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 2e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 3e-16;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(... | #include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
string S,T;
cin>>S>>T;
int count=0;
for(int i=0;i<3;i++){
if(S[i]==T[i]){count++;}
}
cout<<count<<endl;
return 0;} | 1 | 39,450,733 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
char a;
cin >> a;
if (isupper(a))
cout << 'A' << endl;
else
cout << 'a' << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define ff first
#define ss second
#define vi vector<ll>
#define mod 1000000007
#define MOD 1000000007
#define full(a) a.begin(),a.end()
#define inf INT_MAX
#define... | 1 | 70,653,678 |
#include <bits/stdc++.h>
using namespace std;
vector<int> next_int_vector(int n) {
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v.at(i);
}
return v;
}
int main() {
int n;
cin >> n;
long ans = 0;
for (int i = 1; i <= n; ++i) {
long y = n / i;
ans += y * (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define sd second
#define ft first
#define ios \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int MAX = 1e7 + 5;
int32_t main()
{
ios;
... | 1 | 49,650,268 |
#include <iostream>
using namespace std;
int a[194];
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> a[i];
int sum = 0;
for(int i = 1; i <= n; ++i) {
for(int j = i + 1; j <= n; ++j) {
sum += a[i] * a[j];
}
}
cout << sum;
} | #include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
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
const ll MOD=100000007;
const ll INF=1000000101001;
int main(){
int n;cin>>n;
int d[n];
rep(i,n)cin>>d[i];... | 1 | 48,459,593 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define INF 0xfffffff
using namespace std;
int map[1100][1100];
int main()
{
int n,m,k,i,j,a,b,c,sum1;
while(scanf("%d",&n),n)
{
for(i=0;i<1100;i++)
for(j=0;j<1100;j++)
{
map[i][j]=INF;
map[i][i]=0;
}
int Max=0;
for(i=0;i<n;i++)
{
scanf(... | #include <vector>
#include <cstdio>
using namespace std;
const int MAX_V = 10;
const int MAX_E = 45;
const int INF = 100000000;
int dist[MAX_V][MAX_V];
int main() {
while (true) {
int n; scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < MAX_V; i++) {
for (int j = 0; j < MAX_V; j++) dist[i][j] ... | 1 | 7,766,686 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main(){
int n, q; cin >> n >> q;
dsu data(n);
while (q--) {
int t, u, v; cin >> t >> u >> v;
if (t) cout << (data.same(u,v) ? 1 : 0) << "\n";
else data.merge(u,v);
}
return 0;
} | 1 | 5,159,629 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
string s, t;
cin >> s >> t;
int cnt = 0;
for(int i = 0; i < min(s.size(), t.size()); i++){
if(s[i] != t[i]) cnt++;
}
cout << cnt << endl... | 1 | 40,196,568 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
ll m;
cin>>n>>m;
ll p=(n*(n-1))/2 + (m*(m-1))/2;
cout<<p;
}
int main()
{
ios_base::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
int f(int n) { return (n*(n-1))/2; }
int main() {
int N, M; cin >> N >> M;
cout << f(N) + f(M) << endl;
} | 1 | 14,600,413 |
#include<bits/stdc++.h>
const int MN=200000+5;
using namespace std;
typedef long long ll;
template<typename T>inline T&IN(T&in){
in=0;char c=getchar();int f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))in=in*10+c-'0',c=getchar();
return in*=f;
}
int n;ll ans=1;
int nxt[MN],to[MN],h[MN],cnt,w[... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<deque>
#include<cctype>
#include<cstdlib>
#include<cstring>
using namespace std;
int read()
{
char tmp;
int f(1),x(0);
for(tmp=getchar();!isdigit(tmp);tmp=getchar()) if(tmp=='-') f=-1;
for(;isdigit(tmp);tmp=getchar()) x=x*10+tmp-'0';
r... | 1 | 64,136,291 |
#include<cstdio>
#include<cstring>
int main() {
char ch1[101], ch2[101], ch3[201] = {};
scanf("%s %s",ch1, ch2);
strcat( ch3, ch1);
strcat( ch3, ch1);
if( strstr( ch3, ch2) == NULL) printf("No\n");
else printf("Yes\n");
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
string str1, str2;
cin >> str1 >> str2;
int len1 = str1.length();
int len2 = str2.length();
for(int i = 0; i < len1 ; i ++){
bool nomatch = false;
for(int j = 0; j < len2; j ++){
... | 1 | 32,480,953 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>
#include <functional>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
typedef long long int lli;
#define N 100... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<... | 1 | 97,038,953 |
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int c=0,u=0,d=0,l=-1;
string str;
for(int i=0;i<n;i++){
cin>>str;
if(str=="lu"||str=="ru"){
if(l==0)
c++;
l=0;
}
... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include <cstring>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<stack>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vecto... | 1 | 59,079,937 |
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include <climits>
#include<fstream>
using... | #include <stdio.h>
int main(){
int c, i, j, k, n, x;
scanf("%d %d",&n, &x);
while(n != 0 ){
c=0;
for(i=1;i <= n-2;i++){
for(j=i+1;j <= n-1;j++){
for(k=j+1;k <= n;k++){
if(i+j+k == x){
c++;
}
}
}
}
printf("%d\n",c);
scanf("%d %d... | 1 | 11,827,368 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int A,B,M;
cin>>A>>B>>M;
vector<int> vA(A),vB(B);
int minA=INT_MAX,minB=INT_MAX;
rep(a,0,A){... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int a, b, m;
... | 1 | 12,900,656 |
#include<iostream>
#define ll long long
int main(){
ll n;
std::cin >> n;
n--;
ll res = (n*(n+1))/2;
std::cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 1 | 14,762,998 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
ll A, B, K;
cin >> A >> B >> K;
cout << max(A - K, (ll)0) << ' ' << max(B - max((K - A), (ll)0), (ll)0) << e... | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T... | 1 | 11,399,785 |
#include <iostream>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int i = 1;
while(true){
int x;
std::cin >> x;
if(x==0) break;
std::cout << "Case " << i++ << ": " << x << "\n";
}
return 0;
} | #include <stdio.h>
int main(){
int i,x;
for(i=1;i<=1000000;i++){
scanf("%d",&x);
if(x==0){
break;
}
printf("Case %d: %d\n",i,x);
}
return 0;
} | 1 | 39,388,111 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define ff(i, c, n) for (ll i = c; i < n; i++)
#define fr(i, c, n) for (ll i = c; i >= n; --i)
#define INF 1e9 + 7
ll modpow(ll a, ll b, ll c)
{
ll res = 1;
while (b > 0)
{
... | 1 | 66,674,730 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<ll>A,B,C;
for(ll i=0;i<a;i++){
ll now;
cin>>now;
A.push_back(now);
}
for(ll i=0;i<b;i++){
ll now;
cin>>now;
B.push_back(now);
}
for(ll ... | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(false);
cin.tie(0);
#endif
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<int> red(a);for(auto &i:red)cin>>i;
vector<int> gre(b);for(auto &i:gre)cin>>i;
... | 1 | 41,766,611 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<pair<int,int>> pr(n);
rep(i,n){
int a;cin>>a;
pr[i]=make_pair(a,i+1);
}
sort(all(pr));
rep(i,n)cout<<pr[i].second<<" ";... | 1 | 68,901,749 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin >> s;
string ans = "NO", t="keyence";
int c = 0, sn = s.size(), tn = t.size();
int r = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
int n=s.size();
for(int i=0; i<=n; i++) {
for(int j=0; j<=n; j++) {
string t=s;
if(t.erase(i,j)=="keyence") {
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO... | 1 | 75,600,422 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
priority_queue<ll> q;
ll all=0;
for(int i=0; i<n; i++){
ll a;
cin >> a;
q.push(a);
all += a;
}
ll discount = 0;
for(int i=0; i<m; i++){
ll use;
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
ll n, m, a , ans = 0;
cin >> n >> m;
priority_queue<ll> que;
for(int i = 0; i < n; ++... | 1 | 63,105,539 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | #include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pii;
int main()
{
ll mx, my;
scanf("%lld%lld", &mx, &my);
vector<pii>vec;
for (int i = 0; i < mx; i++)
{
ll z;
scanf("%lld", &z);
vec.push_back(make_pair(z... | 1 | 20,575,506 |
#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;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int m... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X; cin >> X;
int G = lcm(360, X);
printf("%d\n", G / X);
} | 1 | 59,518,707 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(... | 1 | 80,272,910 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
int a, b, c, d;
int start, finish;
cin >> a >> b >> c >> d;
start = max(a, c);
finish = min(b, d);
if (start < finish) cout << finish - start;
else cout << '0';
} | #include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int st=max(A,C),en=min(B,D);
int ans=en-st;
if(ans<0)ans=0;
cout<<ans<<endl;
return 0;
} | 1 | 39,109,167 |
#include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
bool check(string s, string dore, int cp) {
int len_dore = dore.size();
for(int i = 0; i < len_dore; i++) {
if(s.at(i + cp) != dore.at(i)) {
return false;
}
}
return true;
}
int main() {
string s;
... | 1 | 23,037,502 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.