code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <climits>
#include <numeric>
#include <queue>
#include <cmath>
#include <iomanip>
#include <arra... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
ll N,K;
scanf("%lld %lld",&N,&K);
if(K%2 == 0){
ll num = 0;
ll num2 = 0;
ll half_... | 1 | 7,919,583 |
#include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a[n];
ll b[n];
for(ll i=0;i<n;i++){
cin >> a[i];
b[i]=a[i]-i;
}
sort(b,b+n);
ll best_b = b[n/2];
ll ans=0;
for(ll i=0;i<n;i++){
ans+=abs(b[i]-best_b);
}
cout << a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
using ll = long long;
int main() {
int n;
scanf("%d", &n);
vector<ll> a(n), b(n);
rep(i, n) scanf("%lld", &a[i]), b[i] = a[i] - i;
sort(b.begin(), b.end());
ll x = b[n / 2];
ll res = 0;
rep(i... | 1 | 34,678,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI M_PI
struct Point {
double x;
double y;
void prt(){
printf("%.8f %.8f\n",x,y);
}
};
void koch(int n,Point p1,Point p2){
if(n==0) return ;
Point s,t,u;
s.x = (2*p1.x + p2.x) / 3;
s.y = (2*p1.y + p2.y) /... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include <iomanip>
using namespace std;
struct Point
{
double x;
double y;
};
struct Edge{
Point start;
Point end;
void make(Point start,Point end)
{
this->start=start;
this->end=end;
}
};
Point rot60(Point a,Point b)
{
Poi... | 1 | 37,295,891 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#def... | 1 | 54,778,543 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e14;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string T = "YAKI";
if(equal(T.begin(), T.end(), S.begin()))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 1 | 86,778,340 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1,x2,y1,y2;cin>>x1>>y1>>x2>>y2;
int tmp_x,tmp_y;
tmp_x=x2-x1;
tmp_y=y2-y1;
cout <<x2-tmp_y<<' '<<y2+tmp_x<<' ';
cout <<x1-tmp_y<<' '<<y1+tmp_x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 | 56,655,199 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <climits>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
vector<int> g[200005];
vector<long long> ans;
void d... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<tuple>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef unsigned long long i... | 1 | 29,725,273 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, clas... | #include <bits/stdc++.h>
using namespace std;
int n,k;
int a[200005],b[200005];
int main(){
cin>>n>>k;
for(int i=0;i<n;++i){
cin>>a[i];
}
if(k>50){
for(int i=0;i<n;++i){
cout<<n<<' ';
}
cout<<'\n';
return 0;
}
for(int i=0;i<k;++i){
memset(b,0,sizeof(b));
for(int i=0;i<n;++i){
int l=max(0,i-a[... | 1 | 47,298,766 |
#include<cstdio>
using namespace std;
int main(){
int n;
scanf("%d", &n);
int t[n];
int v[n+1];
for (int i = 0; i < n; i++) scanf("%d", &t[i]);
for (int i = 0; i < n; i++) scanf("%d", &v[i]);
v[n] = 0;
int time[n];
time[0] = t[0];
for (int i = 1; i < n; i++) time[i] = time[i-1] +... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <inttypes.h>
using namespace std;
int main()
{
int32_t N;
scanf("%d", &N);
int32_t t[101];
int32_t T = 0;
for (int32_t i = 0... | 1 | 29,691,985 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define inf 1000000100
int main()
{
int n;
cin >> n;
map<char ,int> mp;
while(n--)
{
string str;
cin >> str;
vi alpha(26);
for(int i = 0; str[i]; i++)
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>>sv(n,vector<int>(26));
for(int i=0;i<n;i++){
string s;
cin>>s;
for(int j=0;j<s.lengt... | 1 | 33,771,670 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
map<string, int> cards;
int n; cin>>n;
string s;
rep(i,n){
cin>>s;
cards[s]++;
}
int m; cin>>m;
rep(i,m){
cin>>s;
cards[s]--;
}
int ans = 0;
fo... | #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 rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{... | 1 | 54,769,863 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include <stdio.h>
int main() {
int n, i, j, k, l, p[101], m[101][101];
scanf("%d", &n);
for ( i = 1; i <= n; i++) {
scanf("%d", &p[i - 1]);
scanf("%d", &p[i]);
}
for ( i = 1; i <= n; i++) {
m[i][i] = 0;
}
for ( l = 2; l <= n; l++) {
for ( i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][j] = ... | 1 | 2,974,447 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void){
int n;
cin>>n;
map<int,int> m;
for(int i=0;i<n;i++){
int a;
cin>>a;
m[a]++;
}
ll n1=0,n2=0;
for(auto i:m){
if(i.second>=4){
n1=i.first,n2=i.first;
}else if(i.second>=2){
swap(n1,n2);
n1=i... | #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 | 43,898,420 |
#include<stdio.h>
int main(){
int i,j,k,n,x,count;
while(1){
count=0;
scanf("%d %d",&n,&x);
if( n==0 && x==0) break;
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) count++;
}
}
}
printf("%d\n",count);
}
return 0;
} | #include <cstdio>
using namespace std;
int main() {
while (true) {
int n, x;
scanf("%d %d", &n, &x);
if (!n && !x) return 0;
int res=0;
for (int i=1; i<=n; ++i)
for (int j=i+1; j<=n; ++j) {
int k=x-(i+j);
if (j<k && k<=n)
... | 1 | 19,211,735 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repA(i,n) for(int i=n; i>=0; i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a.size())
typedef long long ll;
typedef long double ld;
const ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
k=min(k,200);
rep(i,k){
vector<int> vec(n+1,0);
rep(i,n){
int x=v[i];
int y=max(0,i-x);
... | 1 | 2,083,866 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
for (int i = 0; i < H; i++) {
int white = 0;
for (int j = 0; j < ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int H, W; cin >> H >> W;
vector<string> ss(H);
for (int i = 0; i < H; ++i) cin >> ss[i];
vector<bool> br(H, true), bc(W, true);
for (int r = 0; r < H; ++r) {
... | 1 | 90,573,182 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long a[n];
for(int i=0;i<n;i++)cin >> a[i];
long dai = 0;
for(int i=1;i<n;i++){
if(a[i] >= a[i-1]){
continue;
}else{
dai += a[i-1] - a[i];
a[i] = a[i-1];
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
while (cin >> n) {
long long stool = 0;
int prev = 0;
for (int i = 0; i < n; ++i) {
int aux;
cin >> aux;
if (aux <= prev) {
stool += ... | 1 | 31,743,560 |
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
struct loop_info {
lint loop_len;
lint prefix_len;
lint unit;
};
lint n, x, m;
lint f(lint z) {
return z * z % m;
}
lint simple_solve(lint start, lint k) {
lint now = start;
lint res = 0;
for (int i = 0; i < k; i++) {
... | #include<map>
#include<set>
#include<cmath>
#include<climits>
#include<vector>
#include<queue>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<unordered_map>
#define mod 1000000007
#define mo 998244353
using namespace std;
#define LL long long int
int main()
{
ios_base::sync_with_stdio(false);
... | 1 | 21,700,130 |
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> rnum(n+1);
for(int i = 0; i < n; i++){
cin >> rnum[i] >> rnum[i+1];
}
vector<vector<int>> memo(n, vector<int>(n, INF));
for(int i = 0; i < n; i++) memo[i][i... | #include <iostream>
using namespace std;
int m[1000][1000];
int maxchainorder(int p[],int a){
int n=a;
for(int i=1;i<=n;i++){
m[i][i]=0;
}
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;
m[i][j]=100000000;
for(int k=i;k<=j-1;k++){
... | 1 | 74,354,556 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9+7;
const int d... | 1 | 64,634,784 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int, int>;
int main() {
int K, S, C=0;
cin >> K >> S;
for (int x=0; x<=min(K, S); x++) {
for (int y=0; y<=min(K, S); y++) {
if (S-(x+y)>=0 && S-(x+y)<=K) {
C++;
}
}
}
cout << C << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 1 | 39,486,704 |
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define replet(c) for(char c='a';c<='z';c++)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#define sqr(a) ((a)*(a))... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | 1 | 1,405,259 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
if (a == b) ans = c;
if (a == c) ans = b;
if (c == b) ans = a;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | 1 | 23,452,023 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
bool conditions(string &s) {
if (s[0... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 1 | 6,122,515 |
#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<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll long long
const int in... | 1 | 23,631,725 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#define MAXN 100001
#define NIL -1
#define INIFITY 1 << 30
using namespace std;
int n;
int len = 1;
int L[MAXN];
vector<int> A;
void longetIncreasingSubsequence(){
fill(L, L+n+1, 0);
L[0] = A[0];
for (int i = 0; i < n; ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,... | 1 | 56,854,847 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
int ans;
ans = ((N - M) * 100 + M * 1900);
for (int i = 0; i < M; i++)
{
ans *= 2;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | 1 | 78,426,246 |
#if debug
#include<iostream>
using namespace std;
int H=0;
int A[2000000+2];
void maxHeapify(int i){
int l=2*i;
int r=2*i+1;
int largest;
if(l<=H&&A[l]>A[i]){
largest=l;
}
else
largest=i;
if(r<=H&&A[r]>A[i])
largest=i;
if(largest!=i){
swap(A[largest],A[i]);
maxHeapify(largest);
}
}
int extract(){
i... | #include <iostream>
using namespace std;
struct Heap {
int *heapTable;
int length;
int curr;
Heap () {
this->heapTable = new int[20000001];
this->length = 0;
this->curr = 1;
}
void add (int valor) {
this->heapTable[this->curr] = valor;
this->curr++;
... | 1 | 51,363,252 |
#include <iostream>
using namespace std;
int main() {
int X;
int Y;
cin >> X >> Y;
for (int i = 0; i <= X; i++) {
if (2 * i + 4 * (X - i) == Y) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define FI freopen("input.txt","r",stdin)
#define FO freopen("output.txt","w",stdout)
#define PrintCase(i) printf("Case %d: ",i)
#define sc(a) scanf("%d",&a)
#define scl(a) ... | 1 | 55,273,526 |
#include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rep1(i,n) for(int i = 1; i < (n); i++)
int main(){
int n, j;
cin >> n;
int d[n];
rep(i,n) cin >> d[i];
int ans = 0;
rep(i,n)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int> vc;
int total= 0;
for(int i=0;i<n;i++){
int item;cin >> item;
vc.push_back(item);
}
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
total+=vc[i]*vc[j];
}
}
cout << total;
} | 1 | 57,820,188 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k, n;
cin>> k >> n;
vector<ll> a(2*n);
vector<ll> dis(n+1);
for(int i=0; i<n; i++){
cin>>a[i];
a[i+n] = a[i]+k;
}
ll ans = 1e18;
for(int i=0; i<n; i++){
ans = min(ans, abs(a[i+n-1] -... | 1 | 18,008,599 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 200001;
const int MOD = 1000000007;
int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] *... | 1 | 87,958,482 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << (n*(n+1))/2 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int n ;
cin>>n;
cout<<n*(n+1)/2<<endl;
return 0;
... | 1 | 38,795,591 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a , b , c;
cin >> a;
cin >> b;
cin >> c;
if ((a + b) >= c){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a, b, c;
cin >> a >> b >>c;
if(a+b >= c) cout << "Yes" << endl;
else cout <<"No" << endl;
return 0;
} | 1 | 12,202,272 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string N;
int K;
cin >> N >> K;
int L = N.length();
if (L < K) {
cout << 0 << endl;
return 0;
}
string A(L, '0');
int ans = 0;
switch (K) {
case 1:
for (int i = 0; i < L; i++) {
A = string(L, '0');
for (ch... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
string S; cin >> S;
int K; cin >> K;
int N; N = S.size();
vector<vector<ll>> dp1(N,vector<ll>(K+1,0));
vector<vector<ll>> dp2(N,vector<ll>(K+1... | 1 | 54,543,006 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define MAX_N (100010)
int main()
{
int N, M;
scanf("%d%d", &N, &... | #include <bits/stdc++.h>
using ll=long long;
using namespace std;
ll INF=1000000000000000;
ll mod=1000000007;
ll i,j,k,l;
vector<ll> sum;
void pre_process(vector<ll> &a,vector<ll> &s){
ll n=(ll)a.size();
s.assign(n+1,0);
for(i=0;i<n;i++){
s[i+1]=s[i]+a[i];
}
}
ll query(ll i,ll j,vector<ll> &s){
... | 1 | 81,866,544 |
#include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
ty... | #include <iostream>
#include<vector>
#include<algorithm>
#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()
using ll = long long;
using namespace ... | 1 | 16,530,105 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for ... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
#define let auto const&
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(... | 1 | 98,965,703 |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<functional>
#include<set>
#include<map>
#include<utility>
#define ul unsigned long long int
#define ll long long int
#define MAX 1000000+1
using namespace std;
#define F f... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 1 | 97,724,165 |
#include<stdio.h>
int main(void)
{
int x,c;
c=1;
while (scanf("%d",&x),x!=0){
if(x==0) break;
printf("Case %d: %d\n",c,x);
c++;
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int x;
int n=1;
while ( cin >> x && x!=0 )
{
cout << "Case " << n << ": " << x << endl;
n++;
}
} | 1 | 98,450,523 |
#include<iostream>
#include<bits/stdc++.h>
#include<vector>
#define vi vector<int>
#define lli long long int
#define fo(i,n) for(int i=1;i<=n;i++)
#define foo(i,n) for(int i=0;i<n;i++)
#define ff first
#define ss second
#define pb push_back
#define vii vector<lli>
#define ok ios_base::sync_with_stdio(false); cin.tie(NU... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstdlib>
#include <cstring>
#include <set>
using namespace std;
int main(void) {
int h, w, m;
cin >> h >> w >> m;
vector<int> sum_row(h, 0), sum_col(w, 0);
set<pair<int, int>> t;
for (int i = 0; i < m; i++) {
... | 1 | 36,107,899 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main(){
int s;
cin>> s;
set<int> st;
int ans = 1;
while(true){
if(st.find(s) != st.end()){
cout << ans << endl;
... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 1 | 56,497,231 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=400005;
int size[N],ne[N],tot,fi[N],zz[N],x,y,n,cnt,d[N];
void jb(int x,int y){
ne[++tot]=fi[x];
fi[x]=tot;
zz[tot]=y;
}
void dfs(int x,int y){
size[x]=1;int cnt=0;
for (int i=fi[x];i;i=ne[i])if (zz[i]!=y){
dfs(zz[i],x);
size[x]+=si... | #include <cstdio>
#define rep(i,j,k) for (i=j;i<=k;i++)
using namespace std;
const int N=1e5+5;
int n,u,v,i,j,x,End,l,r,q[N];
int En,fst[N],flg[N],dgr[N],nxt[N*2],to[N*2];
void add(int u,int v) {
En++; nxt[En]=fst[u]; fst[u]=En; to[En]=v;
}
int fs(int x) {
int j;
for (j=fst[x];j;j=nxt[j])
if (!flg[to[j]]) return t... | 1 | 9,970,969 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int n;
ll ans = 1, s = 1000000000000000000;
cin >> n;
vector<ll> a(n);
rep(i, n)
{
cin >> ans;
a[i] = ans;
if (ans == 0)
{
cout << 0;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + ... | 1 | 6,836,963 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int... | 1 | 42,732,501 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
vector<int> v {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1};
int a, b;
cin >> a >> b;
if(find(v.begin(), v.end(), a) < find(v.begin(), v.end(), b)){
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int a,b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
else if (a == 1) cout << "Alice" << endl;
else if (b == 1) cout << "Bob" << endl;
else if (a > b) cout <... | 1 | 32,859,380 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s, ans = "No";
cin >> s;
set<int> buf;
for (int i = 0; i < 4; i++) {
buf.insert(s[i]);
}
if (buf.size() == 2) {
ans = "Yes";
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | 1 | 42,249,177 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,t,sum = 0;
bool frag = false;
string s,X;
vector<int> minute;
vector<string> name;
cin >> N;
for(int i = 0;i<N;i++){
cin >> s >> t;
minute.push_back(t);
name.push_back(s);
}
cin >> X;
for(int i = 0; i<N;i++){
if(frag){sum ... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 1 | 20,740,159 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s; cin >> s;
int n = s.size();
for(int left=0;left<n;left++) {
int right = left;
map<char, int> mp;
while(right < n && right-left <... | #include <iostream>
using namespace std;
pair<int, int> getResult(const string &s){
const size_t sSize = s.size();
pair<int, int> range = {-1, -1};
if(sSize < 2){
return range;
}
if(sSize == 2){
if(s[0] == s[1]){
range.first = 1;
range.second = 2;
}
return range;
}
for(int i = ... | 1 | 100,653,531 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <uti... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | 1 | 10,896,519 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main()
{
string num;
while (1)
{
int i, ans = 0;
cin >> num;
if (num == "0")
break;
for (i = 0; i < num.length(); i++)
ans += num[i] - '0';
printf("%d\n", ans);
}
} | #include<iostream>
using namespace std;
int main(){
char x[1000][1001] = { "a" };
int check;
int a[1000] = {};
for (int i = 0; i < 1000; i++){
cin >> x[i];
if (x[i][0] == '0'){
break;
}
for (int i2 = 0; i2 < 1001; i2++){
if (x[i][i2] != '\0' && x[i][i2] != 'a'){
a[i] += x[i][i2] - '0';
}
}
... | 1 | 17,544,047 |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
const int dx[] = { 1, -1, 0, 0, 1, 1, -1, -1 };
const int dy[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
const char dir[] = {'D', 'U', 'R', 'L'};
void Fast() { cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); }
void File()
{
#ifndef ON... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
using VB = vector<bool>;
using VVB = vector<VB>;
#def... | 1 | 93,926,600 |
#include <stdio.h>
main()
{
int a,b,c,d;
scanf("%d %d %d %d", &a,&b,&c,&d);
int e,f,g,h;
scanf("%d %d %d %d", &e,&f,&g,&h);
int S,T;
S = a + b + c + d;
T = e + f + g + h;
if (S>T) printf("%d\n",S);
else printf("%d\n",T);
} | #include <iostream>
using namespace std;
#define A 0
#define B 1
int main(){
int info[2], math[2], science[2], english[2];
cin >> info[A] >> math[A] >> science[A] >> english[A];
cin >> info[B] >> math[B] >> science[B] >> english[B];
cout << max(info[A]+math[A]+science[A]+english[A], info[B]+math[B]+scie... | 1 | 90,562,701 |
#include <cstdio>
long long x[100000], s[100000];
long long const p = 1000000007;
long long prodsum(int n) {
int i;
for (i = 0; i < n; i++)scanf("%lld", &x[i]);
for (i = n - 1; i > 0; i--)x[i] -= x[i - 1];
s[0] = 0;
for (i = 1; i <= n / 2; i++)s[i] = s[i - 1] + n - 1 - 2 * (i - 1);
for (i = n - 1; i >= n / 2; i--... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int emod(long long x, long long p = mod) {
return (x % p + p) % p;
}
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
vector<long long> x(n); for (int i = 0; i < n; i++) cin >> x[i];
vector<long long>... | 1 | 21,425,524 |
#include <iostream>
int main()
{
char c;
std::cin >> c;
if (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o')
{
std::cout << "vowel";
}
else
{
std::cout << "consonant";
}
std::cout << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
char c;
cin >> c;
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
cout << "vowel" ... | 1 | 10,747,761 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
int main(){
ll M; cin >> M;
ll ans = 0, S = 0;
vector<ll> D(M), C(M);
for(int i = 0; i < M; i++){
cin >> D[i] >> C[i];
ans += C[i]; S += D[i]*C[i];
}
cout << ans-1+(S-1)/9 <<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a)... | 1 | 17,832,736 |
#include<cstdio>
#include<iostream>
using namespace std;
int num[1000000];
int main()
{
int n, k, ans = 0, sans=0;
while (1)
{
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++)
{
scanf("%d", &num[i]);
}
for (int i = 0; i < n - k; i++)
{
for (int j = i; j < i + k; ... | #include <iostream>
using namespace std;
int main()
{
while(1)
{
int n,k; cin >> n >> k ;
if(n==0 && k==0) break;
int* a=new int[n]; int sum=0; int max=0;
for(int i=0;i<n;i++) cin >> a[i] ;
for(int i=0;i<k;i++) sum+=a[i];
max=sum;
for(int i=k;i<n;i++)
{
sum=sum+a[i]-a[i-k];
if(sum>max) max=sum;
... | 1 | 95,819,257 |
#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... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n; cin >> n;
long long p_total = 0;
long long zero = 0;
vector<long long> a(n + 1)... | 1 | 64,302,173 |
#include <cstdio>
const int kMaxN = 2000000;
const int kMaxAi = 10000;
void CountingSort (int A[], int B[], int k, int n) {
int i;
int C[k + 1] = {};
for (i = 0; i < n; ++i) { ++C[A[i]]; }
for (i = 1; i < k + 1; ++i) { C[i] += C[i - 1]; }
for (i = n - 1; i > -1; --i) {
B[C[A[i]] - 1] = A[i];
--C[A[i]]... | #include<iostream>
#include<string>
#include<math.h>
#include<iomanip>
using namespace std;
int main(){
int n;
cin >> n;
int *a = new int[n];
int *b = new int[n];
int c[10001];
for(int i = 0; i <= 10000; i++){
c[i] = 0;
}
for(int i = 0; i < n; i++){
cin >> a[i];
c[a[i]]++;
}
for(int i = ... | 1 | 89,750,259 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<string> X;
for(;;){
string s;
cin >> s;
if(s == "0") break;
X.push_back(s);
}
for(int i = 0; i < X.size(); i++){
int sum = 0;
string x = X.at(i);
for(int j = 0; j < x.size(); j++){
... | #include<stdio.h>
int main(){
char a[1001]={0};
int c[1001]={0};
int b=0,d=0,i;
while(1){
scanf("%s",a);
if(a[0]=='0'){
break;
}
while(a[b]!=0){
c[d]+=a[b]-'0';
b++;
}
d++;
b=0;
}
for(i=0;i<d;i++){
printf("%d\n",c[i]);
}
} | 1 | 41,684,585 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N, M;
cin >> N >> M;
vector<int> H(N);
for(int i = 0; i < N; i++){
cin >> H.at(i);
}
int A, B;
vector<bool> good(N);
for(int i = 0; i < N; i++){
good.at(i) = true;
}
for(int i = 0; i < M; i++){
cin >> A >> B;
if(H.at(A... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<ll>>;
int main(void)
{
ll n,m;
cin >> n >> m;
ll a,b;
vector<ll> h(n),ma(n,0);
for(int i=0;i<n;i++)
{
cin >> h[i];
}
for(int i=0;i<m;i++)
{
cin >> a... | 1 | 71,912,621 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <bitset>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define ALL(g) (g).begin(), (... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vs... | 1 | 26,057,379 |
#include<stdio.h>
#include<queue>
#include<math.h>
#include<time.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<map>
#include<stack>
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a))
#define lowbit(a) a&(-a)
#define PI acos(-1)
#define shortime(a) std::io... | #include<iostream>
#include<string>
#include<cstdio>
#include <cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#i... | 1 | 25,864,270 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += A.at(i);
}
sort(A.begin(), A.end());
int count = 0;
for (int i = N-1; i >= 0; i--) {
if (A.at(i) * 4 * M >= sum) {
c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main(void)
{
int n, m; cin >> n >> m;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
if (4 * a[n - m]... | 1 | 8,808,464 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A;
double B;
cin >> A >> B;
long long int C = B*100+0.1;
A = A * C;
A /= 100;
cout << A << endl;
} | 1 | 44,181,715 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
int n, m;
cin >> n >> m;
v1 a(n+1, 0);
v1 b(n+1, 0);
rep(i, m){
int ... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>>vec(n,vector<int>(2));
int p;
string s;
rep(i,m){
cin>>p>>s;
if(s=="AC"){
... | 1 | 17,300,897 |
#include<iostream>
using namespace std;
long N,a,b=10;
int main(){
cin>>N;
if(N&1){
cout<<0<<endl;
return 0;
}
while(b<=N){
a+=N/b;
b*=5;
}
cout<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define M 1000000007
int gcd(int a,int b){
if(b==0){
return(a);
}
return(gcd(b,a%b));
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
int d=10;
int ans=0;
if(n%2!=0){
cout << ... | 1 | 53,414,840 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
#define coYes cout << "Yes" << endl
#define coYES cout << "YES" << endl
#define coyes cout << "yes" << endl
#define coNo cout << "No" << endl
#define coNO cout ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | 1 | 50,029,675 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
set<ll> a2(a.begin(),a.end());
if(a2.size() == n){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | 1 | 4,246,396 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <numeric>
using namespace std;
int main()
{
while (1)
{
char ch[1000];
char* pch;
pch = ch;
memset(ch, 0... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string number;
while (cin >> number, number != "0") {
int sum = 0;
for (int i = 0; i < number.size(); i++) {
sum += number[i] - '0';
}
cout << sum << endl;
}
return 0;
} | 1 | 45,296,302 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << (x) << '\n'
#define fi first
#define se second
char s[MAXN];
void run(){
cin >> s + 1;
int x = 0;
for(int i = 1; s[i]; i++)
x += s[... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | 1 | 27,051,496 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
int fb=0, ea=0, n=0;
string s;
int ans = 0;
rep(i, 0, N) {
cin >> s;
if(s[0] == 'B') {
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int nab=0,nea=0,nfb=0,eafb=0;
for(int i=0;i<n;i++) {
string s;
cin >> s;
if(*s.begin()=='B'&&s[s.size()-1]!='A') nfb++;
if(*s.begin()!='B'&&s[s.size()-1]=='A') nea++;
if(*s.begin()=='B'&&s[s.size()-1]=='A') eafb++;
... | 1 | 16,827,782 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n, l, out_l, out_r;
string s;
cin >> n >> s;
l = out_l = out_r = 0;
rep(i, n)
{
if (s[i] == ')')
{
if (out_r > 0)
out_r--;
if (l ==... | 1 | 71,475,821 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
string S;
cin >> S;
int N = S.size();
string key = "keyence";
bool yes = true;
for(int i = 0; i < 7; i++) {
if(S[i] != key[i]) {... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
string S;
cin >> S;
bool flg = false;
for(int n = 0; n <= S.size()-1; n++){
for(int m = 0; m <= S.size()-n; m++){
string T = S;
if... | 1 | 34,383,175 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
vector<ll>to[100005];
int main(void) {
ll n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; i++) {
ci... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> graph(n+1);
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
queue<int> que;
que.push(1);
vector<int> seen(n+1, -1);
seen[1] = 1;
vector<in... | 1 | 32,787,488 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,m;
cin>>n>>m;
vector<string> s(m);
vector<int>p(m);
for(int i=0;i<m;i++) cin>>p[i]>>s[i];
int val[n+1]={0};
int cor[n+1]={0};
for(int i... | #include <bits/stdc++.h>
#include <limits.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> ac(n);
vector<int> wa(n);
int p;
string s;
int ansa = 0;
rep(i, m) {
cin >> p >> s;
if(... | 1 | 5,347,606 |
#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, k;
cin >> a >> b >> k;
cout << max(a - k, 0LL) << " " << max(b - ma... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
ll a,b,k;
cin >> a >> b >> k;
ll ans_a = max((ll)0,a-k);
k = max((ll)0,k-a);
ll ans_b = max((ll)0,b-k);
cout << ans_a << " " << ans_b << endl... | 1 | 31,007,728 |
#include <stdio.h>
#include <string.h>
int dp[51][5];
void init() {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 0; i <= 50; ++i) {
for (int j = 1; j <= 4; ++j) {
for (int t = 0; t < 10 && t <= i; ++t) {
dp[i][j] += dp[i-t][j-1];
}
}
}
}
int main() {
int n;
init();
whi... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)... | 1 | 64,626,326 |
#include<stdio.h>
int a[10000]={1,1};
int kaishi(int n){
if(a[n])return a[n];
a[n]=kaishi(n-1)+kaishi(n-2);
return a[n];
}
int main(){
int n;
scanf("%d",&n);
printf("%d\n",kaishi(n));
return 0;
} | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... | 1 | 10,505,095 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 1 | 63,923,734 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
const LL inf = 112345678901234567;
LL get_max(std::vector<LL>v)
{
LL res = 0;
rep(i, v.size()) res = std::max(res, v[i]);
return res;
}
LL get_min(std::vector<LL>v)
{
LL res = inf;
rep(... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
... | 1 | 88,387,406 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S, T;
cin>>S>>T;
int ans = 1001;
int l1 = S.length(), l2 = T.length();
for (int i=0; i<=(l1-l2); i++) {
int c = 0;
for (int j=0; j<l2; j++) {
if (S[i+j] != T[j]) c++;
}
ans = min(ans, c);
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define ... | 1 | 1,620,302 |
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
int main(void) {
int N, v[100... | #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 | 46,122,502 |
#include<bits/stdc++.h>
#define M ll(1e9 + 7)
#define maxn 2003
using namespace std;
typedef long long ll;
int n, m;
int a[maxn];
int b[maxn];
ll dp[maxn][maxn];
int main(){
ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
#define ll long long int
#define mod (long long)(1e9+7)
#define endl '\n'
#define ENGZ ios::sync_with_stdio(0);ios_base::sync_with_stdio(0);cin.tie(0) , cout.tie(0) ;
#define pi (acos(-1))
#define F first
#define S second
ll fp(ll n , ll p )
{
... | 1 | 17,945,235 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <string>
#include <climits>
#include <utility>
#define REP(i, n) for (int (... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; ... | 1 | 21,699,592 |
#include <iostream>
using namespace std;
int main (void) {
int a, b, c, d, ttl;
cin >> a >> b >> c >> d;
if (a < b) {
ttl += a;
} else {
ttl += b;
}
if (c < d) {
ttl += c;
} else {
ttl += d;
}
int ans = ttl;
cout << ans << endl;
} | #include <iostream>
int main() {
int a, b, c, d; std::cin >> a >> b >> c >> d;
std::cout << (std::min(a, b) + std::min(c, d))<< std::endl;
return 0;
} | 1 | 24,589,809 |
#include <cstdio>
#include <vector>
using namespace std;
int main(){
int n, k;
while( scanf("%d %d", &n, &k), n && k ){
vector<int> data(n);
for( int i=0; i<n; i++ ){
scanf("%d", &data[i]);
}
int ans = 0;
int sum = 0;
for( int i=0; i<k; i++ ) sum += data[i];
for( int i=k; i<n; i++ ){
sum += data[i... | #include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef double db;
ll n,k;
ll val[100000];
ll sum[100000];
int main()
{while(... | 1 | 69,566,960 |
#include <iostream>
using namespace std;
int main()
{
int n;
n=10000;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
if(x>y){
cout<<y<<" "<<x<<endl;}
else if(x==0&&y==0)
{return 0;}
else{
cout<<x<<" "<<y<<endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
while(cin >> a >> b && (a > 0 || b > 0))
if (a < b) cout << a << " " << b << "\n";
else cout << b << " " << a << "\n";
} | 1 | 42,378,335 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
const ll MOD = (ll)pow(10,9)+7;
int main(){
int s;
cin >> s;
vector<vector<ll>> pas(2001,vector<ll>(2001));
pas[0][0] ... | #include <iostream>
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p)
{
long long int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p... | 1 | 35,930,313 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 69,688,419 |
#include <bits/stdc++.h>
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define vll vector<long long int>
#define all(v) v.begin(),v.end()
const ll MOD = 1e9 + 7;
const ll INF = 10000000000000000;
const ll MAX_N = 1e5 + 7;
usin... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | 1 | 65,648,368 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main(void)
{
int n;
int house[4][3][10] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
int b, f, r, v;
cin >> b >> f >> r >> v;
house[b-1][f-1][r-1] += v;
}
for (int b = 0; b < 4; b++) {
for (int f = 0; f < 3; f++) {
for (int r = 0; r < ... | #include <iostream>
using namespace std;
int main()
{
int ndata, b, f, r, v;
int rm[4][3][10];
for(int i = 0; i < 4 ; i++) {
for(int j = 0; j < 3 ; j++)
for (int k = 0; k < 10; k++)
rm[i][j][k] = 0;
}
cin >> ndata;
for (int i = 0; i < ndata; i++) {
cin >> b >> f >> r >> v;
rm[b-1][f-1][r-1] += v;
}
... | 1 | 60,533,334 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
int main()
{
int n, k, num, ans, sam;
while(cin >> n >> k)
{
if(!n && !k) break;
queue<int> que;
ans = 0;
sam = 0;
for(int i = 0; i < n; i++)
{
cin >> num;
que.push(num);
sam += num;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
while(n!=0||k!=0){
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
vector<int> S(n+1);
S[0] = 0;
for(int i=0;i<=n;i++){
S[i] = S[i-1] + a[i-1];
}
int max = 0;
int tmp = 0;
for(int i= 0;... | 1 | 53,582,111 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <fstream>
#include <cst... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 1 | 86,860,129 |
#include <algorithm>
#include <iostream>
using namespace std;
int a[ 210 ];
int main()
{
int n;
cin >> n;
for ( int i = 0; i < 2 * n; i++ )
{
cin >> a[ i ];
}
sort( a, a + 2 * n );
long long int ans = 0;
for ( int i = 0; i < 2 * n; i += 2 )
{
ans += min( a[ i ], a[ i ... | #include<iostream>
#include<bits/stdtr1c++.h>
#include<vector>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define zn(a,b,c) for(ll a=b;a<c;a++)
#define nz(a,b,c) for(ll a=b;a>c;a--)
using namespace std;
double nthRoot(int A, int N)
{
double xPre = rand() % 10;
... | 1 | 80,452,600 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
vector<int> A(N+1);
vector<int> B(N);
for(int i=0;i<=N;i++)cin>>A[i];
for(int i=0;i<N;i++)cin>>B[i];
ll a=0;
for(int i=0;i<N;i++){
int x=min(A[i],B[i]);
a+=x;
B[i]-=x;
x=m... | 1 | 23,377,851 |
#include <iostream>
using namespace std;
int main() {
int H1, M1, H2, M2, K, ans;
cin >> H1 >> M1 >> H2 >> M2 >> K;
ans = H2 * 60 + M2 - (H1 * 60 + M1);
if (ans - K < 0) cout << 0 << endl;
else cout << ans - K << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | 1 | 27,663,649 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n; cin >> n;
vector<ll> a(n);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 1 | 72,083 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
signed main() {
... | 1 | 100,359,924 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) ((x).size()))
typedef long long ll;
typedef long double ld;
ll n, x;
ll f(ll a, ll b) {
return b % a == 0 ? (2 * b / a - 1) * a : 2 * a * (b / a) + f(b % a, a);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setpre... | 1 | 16,210,028 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.