code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<long long> S(N+1);
S.at(0) = 0;
for(int i=0;i<N;i++){
cin >> A.at(i);
S.at(i+1) = S.at(i) + A.at(i);
}
map<long long, long long> cnt;
for(int i=0;i<N+1;i++){
cnt[S.at(i)] ++;
}
l... | #include <complex>
#include <cmath>
#include <vector>
#include <cstdio>
#include <iostream>
using namespace std;
typedef complex<double> xy_t;
double dot_product(xy_t a, xy_t b) { return (conj(a)*b).real(); }
double cross_product(xy_t a, xy_t b) { return (conj(a)*b).imag(); }
xy_t projection(xy_t p, xy_t b) { return b*... | 0 | 19,284,340 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
string s[n], ans = "";
for(int i=0; i<n; ++i) cin >> s[i];
sort(s, s+n);
for(int i=0; i<n; ++i) ans += s[i];
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int d;
cin >> d;
string ans = "Christmas";
int n = 25 - d;
for (int i = 0; i < n; i++) {
ans += " Eve";
}
cout << ans << endl;
return 0;
} | 0 | 42,902,363 |
#include <iostream>
#include <string>
const int MAX_X = 1100;
const int MAX_Y = 1100;
int main() {
std::string X;
std::string Y;
int q;
int answers[160];
std::cin >> q;
int dp[MAX_X][MAX_Y];
for(int p=0; p<q; ++p) {
std::cin >> X;
std::cin >> Y;
for(int i=0; i<MAX_X; ++i) {
for(int j=0; ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#defin... | 0 | 85,301,443 |
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <limits>
using ll = long long;
using ld = long double;
ll MOD = 1e9 + 7;
using namespace std;
... | #include <bits/stdc++.h>
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 fibonatti(long long d){
long long count = 0;
... | 0 | 22,241,848 |
#include<stdio.h>
#include<string.h>
int main(){
int n;
char s[1000];
scanf("%d",&n);
scanf("%s",s);
if(n>=strlen(s)){
printf("%s\n",s);
}else{
for(int i=0; i<=n; i++){
if(i==n){
puts("...");
}else{
printf("%c",s[i]);
}
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1<<30... | 0 | 61,105 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#define debug(x) cerr << #x << ':' << x << end... | #include<bits/stdc++.h>
int d[11],n,m,i,a,b,s,e;
int main(){
while(true) {
memset(d,0,sizeof(d));s=0;
std::cin>>n>>m;if(!n){break;}
for(i=0;i<n;i++){std::cin>>a>>b;d[b]+=a;}
for(i=10;i>=0;i--){e=std::min(d[i],m);m-=e;s+=i*(d[i]-e);}
printf("%d\n",s);}
} | 0 | 94,980,940 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<double,double>> vp(N);
for(int i=0;i<N;i++){
cin>>vp[i].first>>vp[i].second;
}
double ans=0;
for(int i=0;i<N;i++){
double gx=vp[i].first,gy=vp[i].second;
for(int k=0;k<4;k++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 200000
#define mod1 1000000007
#define mod2 1000000009
#define mod3 998244353
#define endl '\n'
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
void Google(ll tt){
cout<<"Case #"<<tt<<": ";
}
int main()
{
IO
clock_t begin =... | 0 | 4,820,387 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<double> a(n);
rep(i,n) cin >> a[i];
double ans=0;
rep(i,n){
ans += 1... | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | 0 | 40,494,434 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define bitcount(x) __builtin_popcount(x)
#define bitcountll(x) __builtin_popcountll(x)
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n, k;
cin >> n >> k;
ll a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll ans = 100000000000;
for(int bit = 0; bit < (1 << n-1); bit++){
ll d = 0;
ll b[n];
for(int i = 0; i <... | 0 | 95,974,928 |
#include <stdio.h>
#define MAX 16
int main(void){
int w,h,n;
int ng[MAX][MAX], num[MAX][MAX];
while (scanf("%d%d",&w,&h), w){
for (int i=0;i<w;i++){
for (int j=0;j<h;j++){
ng[i][j] = num[i][j] = 0;
}
}
scanf("%d", &n);
for (int i=0;i<n;i++){
int x,y;
scanf("%d%d",&x,&y);
ng[x-1][y-1] = 1;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pii pair<int,int>
const long long MOD=1000000007;
long long mgcd(long long x,long long m){
if(x==m) return m;
return mgcd(m,x%m);
}
int main(){
string s;
cin>>s;
... | 0 | 5,383,916 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cin.ignore();
cout << 1 << '\n';
return 0;
}
vector<string> s(n);
for (auto &si:s) {
cin >> si;
si += si.substr(0,... | 0 | 14,987,628 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N,Y;
cin>>N>>Y;
for(int i=0;i<=N;i++){
for... | #include <bits/stdc++.h>
const int N = 7;
char s[N][N];
int main(){
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; ++ i){
scanf("%s", s[i]);
}
int cnt = 0;
for (int i = 0; i < 1 << n; ++ i){
for (int j = 0; j < 1 << m; ++ j){
int ccnt = 0;
... | 0 | 21,724,905 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool ans = false;
for(int c=0;4*c<=N;c++){
for(int d=0;7*d<=N-4*c;d++){
if(4*c+7*d==N) ans = true;
}
}
if(ans) cout <<"Yes"<<endl;
if(!ans) cout <<"No" <<endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K; cin >> N >> K;
string S; cin >> S;
vector<int> nums;
if (S[0] == '0') nums.push_back(0);
for (int i = 0; i < S.size();) {
int j = i;
while (j < S.size() && S[j] == S[i]) ++j;
... | 0 | 85,511,834 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, ... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=998244353;
int GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | 0 | 38,109,338 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
map<string, ll> ana;
vector<string> s(n);
for(int i = 0; i< n; i++){
... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 29,037,153 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
string a;
cin>>a;
for(int i=0;i<12;i++){
if(i==4) cout<<" ";
cout<<a[i];
}
cout<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | 0 | 28,215,910 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, d, x;
cin >> n >> d >> x;
int sum = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
sum += 1 + (d - 1) / a;
}
cout << sum + x << '\n';
return 0;
} | #include<bits/stdc++.h>
#define LL long long
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPA(i,n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define PII pair<int,int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define PDD pair<double, double>
#define MOD ((int)1e9 + ... | 0 | 100,049,560 |
#include<bits/stdc++.h>
using namespace std;
#define nl cout<<'\n';
int main()
{
int p,q,r;
cin>>p>>q>>r;
cout<<min((p+q),min((p+r),(q+r)));
nl;
return 0;
} | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 41,781,089 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N){
long long ans = N * (N - 1) / 2;
cout << ans << endl;
}
int main(){
long long N;
scanf("%lld",&N);
solve(N);
return 0;
} | #include <iostream>
using namespace std;
unsigned long long dp[17][17];
bool able[17][17];
int main(void){
int n, m;
while(cin >> n >> m, n && m){
for(int i = 0; i < 17; i++)
for(int j = 0; j < 17; j++){
dp[i][j] = 0;
able[i][j] = true;
}
int c;
cin >> c;
while(c--){
int i, j;
... | 0 | 76,884,552 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
bool noC(string in) {
int count = 0, n = in.size();
for (int i = 2; i < n - 1; ++i) {
if (in[i] == 'C')count++;
}
return (count == 1);
}
bool noUp(string in) {
in... | #include<cstdio>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
using namespace std;
#define MAXN 1005
struct node{
int x,y,step;
node(int x=0,int y=0,int step=0):x(x),y(y),step(step) {}
};
char mp[MAXN][MAXN];
int vis[MAXN][MAXN];
int w,h,n;
int dir[10... | 0 | 22,415,438 |
#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
map<int, string> t;
enum NodeType{ROOT = 0,INTERNALNODE = 1,LEAF = 2};
struct type_name{
map<int, string> type_map;
type_name(){
type_map[ROOT] = "root";
type_map[INTERNALNODE] = "internal node";
type_map[... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int num1, num2;
cin >> num1, cin >> num2;
vector<string> strvec(num1);
for(int i = 0; i < num1; i++) {
cin >> strvec[i];
}
sort(strvec.begin(), strvec.end());
for(int i... | 0 | 18,663,819 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define rep(a, b, i) for(int i = a; i < b; i++)
#define repi(a, b, i) for(int i = a; i > b; i--)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define __ ios_base::sync_with_st... | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf... | 0 | 95,665,993 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
#define REP(i, n) for(int i = 0; i < n; ++i)
#define FOR(i, t, n) for(ll i = t; i <= (ll)n; ++i)
struct edge {
int from, to;
ll cost;
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(int size) ... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T... | 0 | 14,944,185 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
#define INF (1e9)
int main() {
ll A, B, M, ans = 0;
cin >> A >> B >> M;
vi a(A), b(B);
ll minA = INF, minB = INF;
for (ll i = 0; i < A; i++) {
cin >> a[i];
minA = min(mi... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< string > vs;
typedef vector< vi > vvi;
typedef ... | 0 | 5,604,028 |
#include<algorithm>
#include<cmath>
#include<climits>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ty... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
using lli = long long int;
using ll = long long ;
using ld=long double;
using d= double;
bool isPrime(ll n){if(n<2)return false;for(ll i=2;i*i<=n;++i){if(n%i==0){return false;}}return t... | 0 | 25,354,819 |
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
bool app[30];
bool flug = false;
for(int i = 0; i< 26;++i){
app[i] = false;
}
for(int i = 0;S[i] != '\0';++i){
app[S[i]-'a']= true;
}
for(int i = 0;i<26;++i){
if(!app[i]){
cout << (cha... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using names... | 0 | 15,174,577 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int st,en;
for (int i = 0; i < N; i++) {
cin >> st >> en;
sum+= en-st+1;
}
cout << sum << endl;
} | #include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<functional>
using namespace std;
#define INF 1<<21
#define MOD 1000000007
int main() {
int n;
string s1, s2;
int x, y;
int mul;
cin >> n;
for (int i = 0; i < n; i++) {
x = 0; y = 0;
cin >> s1 >> ... | 0 | 95,243,959 |
#include <bits/stdc++.h>
using namespace std;
int n,k;
long double ans;
int main() {
cin>>n>>k;
for (int i=1; i<=n; i++) {
if (i<k) {
int ind=i,cnt=0;
while (ind<k) {
ind*=2; cnt++;
}
ans+=(1/(((long double)(n))*((long double)(1<<cnt))));
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
double pi = acos(-1.0);
const double EPS=1e-9;
#define MOD ll(1e9L+7)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define t() ll tt;cin>>tt;while(tt--)
#define t2() ll tt2; cin>>tt2; for(ll tti=1;tti<=tt2;tti+... | 0 | 40,415,756 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | 0 | 96,835,254 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> max_sushi(N, 0);
priority_queue<pair<int, int>> pq;
for(int i = 0; i < N; i++){
int t, d;
cin >> t >> d;
t--;
max_sushi[t] = max(d, max_sushi[t]);
pq.push(make_pair(d, t));
}
vector<int> a(N, ... | #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | 0 | 21,351,343 |
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB pus... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 86,064,635 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cstdio>
#include<cmath>
#include<deque>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<tuple>
#include<utility>
#include<vector>
using namespace std;
typedef long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | 0 | 14,621,895 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int dp[100010];
cin >> n;
for(int i=1;i<=n;i++) dp[i] = INT_MAX;
dp[0] = 0;
for(int i=1;i<=n;i++){
int d = 1;
while(d <= i){
dp[i] = min(dp[i],dp[i-d] + 1);
d *= 6;
}
d = 1;
while(d <= i){
dp[i] = min(dp[i],dp[i-d] + 1);
d *= 9;... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
#include <set>
#include <utility>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <sstream>
#include <list>
#include <map>
#include <functional>... | 0 | 12,058,433 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
for (int i=1; i<20000; i++){
int x,y;
x = i*0.08;
y = i*0.1;
if (x==a && y==b){
cout << i;
return 0;
}
}
cout << -1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin >> n;
char s[n];
rep(i,n)cin>>s[i];
int ans=n;
for(int i=1;i<n;i++){
if(s[i]==s[i-1]){
ans--;
}
}
cout<<ans<<endl;
} | 0 | 53,351,556 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const ll N = 1e6, inf = 1e9;
ll tree[2 * N], lazy[2 * N], ar[N];
void pushDown(ll node, ll s, ll e)
{
if(lazy[node])
{
ll l = 2 * node, r = 2 * node + 1;
if( s != e)
{
ll mid = (s + e)/2;
... | #include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
int main() {
int H, W;
cin >> H >> W;
vector<... | 0 | 45,743,638 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int n, k, a[maxn], dp[maxn][maxn];
bool check(int x) {
memset(dp, 0, sizeof dp);
if(x == 1) {
dp[2][0] = 1; dp[2][a[2]] = 1;
for (int i = 3; i <= n; ++i)
for (int j = 0; j <= k; ++j) {
dp[i][j] = dp[i - 1][j];
if(j >= a[i]) dp[i][j] ... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct Vertex
{
int id = 0;
vector<int> adjList;
};
int tt = 0;
void bfs(vector<Vertex> &V, vector<int> &dist, int i)
{
queue<Vertex> mq;
mq.push(V[i]);
dist[i] = 0;
while(!mq.empty()) {
Vertex tmpV = mq.front();... | 0 | 33,300,512 |
#include<bits/stdc++.h>
#define ll long long int
#define w(x) int x; cin>>x; while(x--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin>>n;
string s,t;
ci... | #include <bits/stdc++.h>
#define ub(b,val) upper_bound(b+1,b+n+1,val)-b
#define ll long long
using namespace std;
const int N = 1e5 + 123, MAXN = 1e9;
ll n, m, v, p;
ll a[N], b[N], ans, c[N];
bool check (int in) {
ll k = 0, id = (n - p + 1);
if (b[in] + m < b[id])return 0;
k += (p - 1) * 1ll * m + (in - 1) ... | 0 | 9,235,826 |
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> a(n+1);
for (int i = 0; i <= n; ++i) cin >> a[i];
vector<long long> s(n + 1);
s[n] = a[n];
for (int i = n - 1;... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int i = (m); i < (n); i++)
#define rep(i,n) REP(i,0,n)
#define NIL -1
using namespace std;
typedef long long ll;
typedef long long int lli;
static const int MOD = 10000007;
static const int MAX = 100005;
int N, L;
int main(){
cin >> N;
vector<ll> a(N);
rep(i, N) {... | 0 | 94,981,251 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if ... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstr... | 0 | 2,736,443 |
#include <stdio.h>
void printSquareF(unsigned int High, unsigned int Wide);
int main(int argc, const char * argv[]) {
unsigned int w = 1, h = 1;
while (!(h == 0 && w == 0)) {
scanf("%d %d", &h, &w);
if(!(h == 0 && w == 0)){
printSquareF(h, w);
}
}
return 0;
}
void pri... | #include<vector>
#include<cstdio>
#define MAX 10000
using namespace std;
const int WHITE = 0,GRAY =1,BLACK = 2;
vector<int> G[MAX];
int color[MAX] = {WHITE};
vector<int> L;
void visit(int n){
if(color[n] != BLACK){
color[n] = BLACK;
for(auto itr = G[n].begin();itr != G[n].end();++itr){
v... | 0 | 88,396,288 |
#include <iostream>
#include <limits>
#include <algorithm>
using namespace std;
int c[100][100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, t;
int M[101];
cin>>n;
cin>>M[0]>>M[1];
for(int i=2; i<=n; i++) {
cin>>t>>M[i];
}
for(int l=1; l<n; l++) {
for... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n; cin >> n;
if(n == 0) break;
vector<int> S(n), T(n);
vector<int> table(3600*24, 0);
for(int i=0; i<n; i++){
for(int j=0; j<2; j++){
string time; cin >> time;
i... | 0 | 32,006,990 |
#include<cstdio>
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
char s[MAXN*2];
int main(void)
{
int n;
scanf("%d%s",&n,s+1);
if(s[1]=='W' || s[n<<1]=='W')
{
printf("0");
return 0;
}
ll ans=1, t=1, last=1;
for(int i=2; i<=(n*2); ++i)
{
if(s[i]!=s[i-1])
{
if(last) ++t;
els... | #include<iostream>
#include<string>
#include<stack>
using namespace std;
int main() {
while(1) {
string s;
getline(cin, s);
if (s == ".") break;
string b = "";
for (int i = 0; i < s.size(); ++i) {
char c = s[i];
if (c == '(' || c == ')' || c == '[' || ... | 0 | 55,828,573 |
#include<bits/stdc++.h>
#define fi first
#define se second
typedef long long ll;
using namespace std;
class shortest_path{
public:
explicit shortest_path(int n):vertex(n),INF(0){}
shortest_path(int n,ll inf):vertex(n),INF(inf){
v2.resize(static_cast<unsigned long>(vertex));
for(int i=0;i<vertex;... | #include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main() {
int n, x;
int count = 0;
while (1)
{
cin >> n >> x;
if (n == 0 && x == 0) {
break;
}
for (int i = 1; i <= n; i++)
{
for (int j = i+1; j <= n; j++)
{
for (int k = j+1; k <= n; k++)
{
if (i + j + k == x... | 0 | 16,503,137 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> r(n),b(n);
vector<bool> rok(n,false),bok(n,false);
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
r[i]=make_pair(y,x);
}
for(int i=0;i<n;i++){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
using namespace std;
int inf = 0x3f3f3f3f;
int maps[50][50];
void floyd(int k,int n)
{
for(int t =k; t<=n; t++)
for(int i = k; i<=n; i++)
for(int j = k; j<=n; j++)
if(map... | 0 | 58,794,736 |
#include <iostream>
#include <algorithm>
using namespace std;
static const int N = 100;
int main() {
int n, p[N + 1], m[N + 1][N + 1];
scanf("%d", &n);
for ( int i = 1; i <= n; i++ ) {
cin >> p[i - 1] >> p[i];
}
for ( int i = 1; i <= n; i++ ) m[i][i] = 0;
for ( int l = 2; l <= n; l++ ) {
for ( int i = 1; i ... | #pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#define LL long long
using namespace std;
int a, b;
int main()
{
int t;
cin>>t;
while... | 0 | 29,229,448 |
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long LL;
const int MAXN = 100010;
int n, m, size, flag, cnt1, cnt2, cnt3, col[MAXN];
LL ans;
vector < int > G[MAXN];
inline void dfs(int x, int c)
{
size++;
col[ x ] = c;
for( auto y : G[ x ] )
if( col[ y ] == -1 ) dfs( y, c ^ 1 );
e... | #include<string>
#include<vector>
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<functional>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define ... | 0 | 1,754,363 |
#include<bits/stdc++.h>
using ll = int_fast64_t;
#define REP(i,b,e) for(ll i=b; i<e; i++)
const int MOD = 1e9+7;
const int MAX = 1e5+10;
ll fac[MAX], finv[MAX], inv[MAX];
void combinit(){
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
REP(i, 2, MAX){
fac[i] = fac[i-1]*i % MOD;
inv[i] = MOD - inv[MOD%i]*(MOD/i)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ul unsigned long long int
#define ld long double
#define f(t) for(ll i =0;i<t;i++)
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
#define inf 4e18
#define EPS 1e-3
... | 0 | 28,459,092 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string S;cin>>S;
for(int i=1;i<S.size();i++)
{
bool check=true;
if((S.size()-i)%2==1)continue;
for(int j=0;j<(S.size()-i)/2;j++)if(S[j]!=S[j+(S.size()-i)/2])check=false;
if(check){printf("%d",S.size()-i);return 0;}
}
} | #include <iostream>
using namespace std;
int main(){
int n,x;
int counter = 0;
while(true){
cin >> n >> x;
if(n == 0 && x == 0)break;
for(int i = 1; i <= (n - 2); i++)
for(int j = (i + 1); j <= (n - 1); j++)
... | 0 | 97,111,881 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;cin>>N;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
int64_t ans=A.at(0)-1;int64_t a=2;
for(int i=1;i<N;i++){
if(A.at(i)==a)a++;
else
ans+=(A.at(i)-1)/a;
}cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<string> w(n);
set<string> s;
for (int i = 0;i < n;i++)
{
cin >> w[i];
s.insert(w[i]);
}
bool ok = true;
char back_ward;
for (int i = 0;i < n-1;i++)
{
... | 0 | 60,408,237 |
#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;
int main() {
ll n,m;
cin >> n >> m;
vec a(n);
for(ll i=0;i<n;i++) {
cin >> a[i];
}
a[0]%=m;
for(ll i=0;i<n-1;i++) {
(a... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
const long long MOD = 1000000007;
int main(){
in... | 0 | 48,086,103 |
#include <bits/stdc++.h>
using namespace std;
char a;
int main() {
cin>>a;
char b=a+1;
cout<<b;
} | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
double rad2deg(double rad) {
return rad * 360.0 / (2.0 * M_PI);
};
int main() {
int a, b, x;
cin >> a >> b >> x;
if (x == (a * a * b)) {
cout << 0 << endl;
return 0;
}
double theta;
if (true) {
... | 0 | 96,835,714 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int k = 1;
while (k * n % 360 != 0) k++;
cout << k << "\n";
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
static const int INF = INT_MAX;
s... | 0 | 78,739,676 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,R,S,P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
int Ans = 0;
int chk = 0;
for(int i = 0; i < K; i++){
chk = 0;
for(int j = i; j < N; j += K){
if(j >= K && T.at(j - K) == T.at(j) && chk%2 =... | #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);
static const int INF = 1e9... | 0 | 100,753,495 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define mem(a, b) memset(a, b, sizeof(a))
#define MOD 1000000007
#define MAX (int) 1e9
#define PI 3.141592653589793238462643383279502884
template <typename T, typename U>
T max(... | 0 | 42,607,166 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <map>
using namespace std;
const unsigned long long BASE = 1e9 + 7;
int main()
{
int n;
cin >> n;
int * b = new int[n];
int sum = 0;
for (int i = 0; i < n - 1... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | 0 | 69,230,573 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
ll a = 0;
if(x > 0){
if(y <= -x){
a = - y - x + 1;
}
else if(y >= x){
a = y - x;
}
else if(... | #include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <cassert>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <numeric>
#include <time.h>
#include <stack>
#include <bitset>
#define prev asasd... | 0 | 60,807,194 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int k;
cin>>k;
string s;
cin>>s;
if(s.length()<=k)cout<<s<<endl;
else{
rep(i,k)cout<<s[i];
cout<<"..."<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int i=0,j,c=0,p,h[1000010],m=1,max=0;
int n;
cin >> n;
for(i=1;i<=n;i++)
{
if(i%2!=0)
{
for(j=1;j<=i;j++)
{
if(i%j==0)
{
c++;
... | 0 | 22,399,006 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename ... | 0 | 4,096,037 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(void){
int n;
ll m=0,t;
vector<ll> v;
cin>>n;
for(int i=1;m<10000000;i++){
m+=i;
v.push_back(m);
}
for(int i=0;i<v.size();i++){
if(n<=v[i]){
m=i+1;
t=v[i]-n;
... | 0 | 71,926,343 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,P;
int x = 0;
cin >> A >> P;
x = (A*3 + P)/2;
cout << x <<endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n, k = 0;
string s[200], a[100], b[100], w;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> w;
s[i] = w;
a[i] = w[w.size() - 1];
b[i] = w[0];
}
for(int j = 0; j < n; j++)
{
for... | 0 | 36,795,980 |
#include<bits/stdc++.h>
using namespace std;
bool solve(int X, int Y){
return ((Y-2*X)%2 == 0) && ((Y-2*X)/2 >= 0) && (X-(Y-2*X)/2 >= 0);
}
int main(){
int X, Y;
cin >> X >> Y;
if(solve(X, Y)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define _start ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ss second
#define ff first
#define ll long long
#define int long long
#define mk make_pair
#define ld long double
#define vi vector<int>
#define pi... | 0 | 47,940,616 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
string s;
cin >> s;
bool flag = false;
if(s == "a") flag = true;
if(s == "i") flag = true;
if(s == "u") flag = true;
if(s == "e") flag = true;
if(s == "o") fl... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int a = 0;
int b = 0;
int mina = 0;
int maxb = 0;
rep(i, n){
if(s.at(i) == '('){
... | 0 | 71,454,860 |
#include <iostream>
using namespace std;main(){int a,b,c;cin>>a>>b>>c;char d[2][4]={"No","Yes"};cout<<d[a<b?b<c:0]<<endl;} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define mp ... | 0 | 25,322,742 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=918... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 84,024,675 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0... | #include<bits/stdc++.h>
#include<algorithm>
#include <fstream>
#include <sstream>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define is insert
#define rep1(i,a,b) for(long long i=a;i<=b;i++)
#define mp make_pair
#define mh make_heap
#defi... | 0 | 83,068,182 |
#include <iostream>
using namespace std;
int main(void)
{
int x, y, a, b;
cin >> x >> y;
a = (4 * x - y) / 2;
b = (y - 2 * x) / 2;
if (y % 2 == 0 && 4 * x - y >= 0 && y - 2 * x >= 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T>... | 0 | 5,106,946 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define print(x) cout << x << "\n";
int main()
{
string s, t;
cin >>... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 36,290,403 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... | #include<iostream>
#include<cstring>
#include<math.h>
using namespace std;
const int MAX = 1000000;
int prime(int n)
{
int ans = 0;
bool prime[MAX];
memset(prime, 0, sizeof(prime));
for (int i = 2; i < n;i++)
{
for (int j = 2; j <= n / i; j++)
{
if (i*j <= n)
prime[i*j] = 1;
}
}
for (int i = 2; i... | 0 | 23,556,033 |
#include<iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
long long ans = k;
for (int i = 1; i < n; i++) {
ans = ans * (k - 1);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = (int)s.size();
if (n < 26) {
map<char, bool> mp;
for (auto&& c : s) {
mp[c] = true;
}
... | 0 | 5,619,419 |
#include<bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
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... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 27,043,418 |
#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;}... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | 0 | 17,742,476 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;... | #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... | 0 | 42,233,409 |
#include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu",... | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | 0 | 29,969,124 |
#include<iostream>
#include<bits/stdc++.h>
#include<string>
using namespace std;
typedef long long int ll;
void solve()
{
int N,L,i;
cin>>N>>L;
string S[N];
for(i=0;i<N;i++) cin>>S[i];
sort(S,S+N);
for(i=0;i<N;i++) cout<<S[i];
return;
}
int main()
{
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bo... | 0 | 87,438,895 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
vector<int> A(n);
std::cin >> n;
for(int i=0; i < n; i++)
{
int v;
std::cin >> v;
A.push_back(v);
}
int C[10001] = {0};
vector<int> B(n, 0);
for(int i=0; i < n; i++)
{
C[A[i]]++;
}
for(int i=1; i < 10001; i++)
{
C[... | #include <iostream>
using namespace std;
int main(){
int n, x, c;
while(true){
cin >> n >> x;
if ((n | x) == 0)
break;
c = 0;
for(int i=1;i<n-1;++i){
for(int j=2;j<n;++j){
for(int k=3;k<n+1;++k){
if(i<j&&j<k&&i+j+k==x)
c++;
}
}
}
cout<<c<<endl;
}
return 0;
} | 0 | 44,943,920 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #include "bits/stdc++.h"
using namespace std;
bool dp[2][16001];
int main() {
string s;
cin >> s;
int x, y;
cin >> x >> y;
vector<int> X, Y;
int pos = 0;
while (pos < s.size() && s[pos] == 'F') pos++, x--;
bool moveX = 1;
int d = 0;
while (pos < s.size()) {
if (s[pos] == 'F') {
d++;
}
else {
if (m... | 0 | 38,693,464 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a <= c) ... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#define rep(i, n) for(... | 0 | 5,204,912 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n,k,count=0;
string s;
vector<int>si,so;
cin >> n >> k>>s;
char c=s[0];
if(c=='0')
si.push_back(0);
rep(i,n){
if (c==s[i]) {
count++;
} else {
if (c == '0')
so... | 0 | 33,366,649 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m, v, p;
scanf("%d %d %d %d", &n, &m, &v, &p);
vector<ll> arr(n);
for (int i = 0; i < n; ++i) scanf("%lld", &arr[i]);
sort(begin(arr), end(arr));
vector<ll> psums(n + 1);
for (int i = 0; i < n; ++i) psums[i + 1] = psums[i] + ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
bool IsPrime(long long int num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
... | 0 | 6,673,554 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t n, x, m;
cin >> n >> x >> m;
vector<int64_t> A(m, -1), S(m + 1, 0);
int64_t ai = x;
for (int i = 1; i <= m; i++)
{
if (A.at(ai) == -1)
{
A.at(ai) = i;
S.at(i) = S.at(i - 1) + ai;
ai = ai * ai % m;
if (ai == 0 ... | #include<stdio.h>
int main(){
int n,m=100000,s=0;
scanf("%d",&n);
for(int t=0;t<n;t++){
m=m*1.05;
if(m%1000!=0){
s=m%1000;
m=m+1000-s;
}
}
printf("%d\n",m);
return 0;
} | 0 | 74,319,081 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
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; }
vector<long l... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<long long int> v;
for (int x = 0; x < n; ++x){
long long int q; cin >> q;
v.push_back(q);
}
sort(v.begin(), v.end());
if (k >= v.size()){
cout << ... | 0 | 85,360,566 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define print(ele) cout << ele << endl
#define print... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vec;
typedef unordered_map<int,int> hash;
#define long long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(x) (int)x.size()
#define F first
#define S second
#define pb push_back
#define mp make_pair
... | 0 | 48,964,338 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static In... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1e9+7;
const int INF=1001001001;
int ... | 0 | 15,847,501 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define modP 1000000007
#define MAX_N 200002
using nam... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
#define endl '\n'
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
const ll siz = 1e5 + 7;
vector < pi> adj[siz];
ll n, k, q;
vector<ll>dis(siz, 1e15);
ve... | 0 | 621,876 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n = 5;
vector<int> time(n);
rep(i,n) cin >> time[i];
vector<int> N_time(n);
rep(i,n){
if(time[i]%10==0) ... | #include<bits/stdc++.h>
using namespace std;
#define INF (1<<20)
typedef pair<int,int> P;
vector<P> edge[10];
int dijkstre(int pos){
int min_cost[10];
fill_n(min_cost,10,INF);
priority_queue<P,vector<P>,greater<P> > que;
que.push(P(0,pos));
while(!que.empty()){
P p = que.top(); que.pop();
int cost = p... | 0 | 69,233,334 |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 80,824,503 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i-... | 0 | 87,397,513 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void... | 0 | 74,432,433 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string A,B;
cin>>A>>B;
char a=0;
char b=0;
if(A.length()>B.length()){
cout<<"GREATER";
return 0;
}
else if(A.length()<B.length()){
cout<<"LESS";
return 0;
}
for(size_t i=0;i<=A.length()-1;i++){
a=A[i];
b=B[i];... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 59,370,160 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
int GCD(int a,int b){
if(b == 0)return a;
return GCD(b,a%b);
}
int main(void){
int N,M,X,Y;
cin >> N >> M >> X >> Y;
int x[N],y[M];
for(int i=0;i<N;i++)cin>>x[i];... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 47,775,451 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> a(N);
int k;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (i == 0) {
k = 1;
}
else {
if (a[i-1] == a[i]) {
k++;
... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int i... | 0 | 60,901,938 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
set<string> S;
vector<string> vec(N);
for(ll i=0;i<N;i++) {
cin>>vec[i];
}
for(ll i=0;i<N;i++) {
if(S.count(vec[i])) {
cout<<"No"<<endl;
return 0;
}
S.insert(vec[i]);
}
for(ll ... | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 4,865,994 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
int rest = A-B;
if(rest>C){
cout << 0 << endl;
}else{
cout << C-rest << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void){
string s;
int ans=0;
bool finished = false;
cin >> s;
int l=s.size()-1;
for(int i=l-2;i>=0;i-=2)
{
int tmp=0;
for(int j=(i-1)/2;j>=0;j--)
{
if(s[j] != s[i-tmp]){
bre... | 0 | 19,293,121 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,k;
... | #include<bits/stdc++.h>
#define speed_up ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ara(A,N) sort(A,A+N)
#define rev(A,N) sort(A,A+N,greater<long long>())
using namespace std;
int main()
{
speed_up;
int n, cnt = 0, st = 0, mx, i, j, mx2;
cin>>n;
int a[n];
int b[n] =... | 0 | 86,905,858 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) (cerr << #x << " = " << x << endl;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF ... | 0 | 90,990,076 |
#include <iostream>
#include <assert.h>
#include <vector>
#include <unordered_map>
#include <queue>
#include <climits>
#include <cmath>
#include <algorithm>
#include <unordered_set>
using namespace std;
constexpr int64_t MOD = 1e9 + 1;
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int64_t N,X,M;
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | 0 | 41,733,426 |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 77,046,132 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <algorithm>
#include <limits.h>
#include <cmath>
#include <time.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define SQ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll ans = 0;
vector<ll> o(5);
rep(i,5) {
cin >> o[i];
}
ll min = 10;
... | 0 | 31,048,192 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<int> T(N);
vector<int> S(N);
for (int i = 0;i < N;i++) {
cin >> T[i];
}
for (int i = 0;i < N;i++) {
cin >> S[i];
}
vector<int> mxs(1, 0);
for (int i = 0;i < N;i++) {
while (T[i]) {
mxs.push_back(S[i... | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int numbers[3];
for (int i = 0; i < 3; ++i)
{
cin >> numbers[i];
}
sort(numbers, numbers + 3);
printf("%d %d %d\n", numbers[0], numbers[1], numbers[2]);
return 0;
} | 0 | 67,404,755 |
#include<iostream>
using namespace std;
int main(){
int n;
int sum;
int s;
int max,min;
while(cin >> n){
if(n==0){ break; }
sum = 0;
max=0,min=1000;
for(int i=0; i<n; i++){
cin >> s;
if(s>max){ max=s; }
if(s<min){ min=s; }
sum += s;
}
sum -= max+min;
cout <<... | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
double x1, y1, x2, y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt(pow((x2 - x1), 2.0) + pow((y2 - y1), 2.0));
cout << fixed << setprecision(4) << d << endl;
} | 0 | 366,430 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.