code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 30)
using namespace std;
int editdistance(string a, string b)
{
int dp[a.size() + 1][b.size() + 1];
rep(i, a.size() + 1) rep(j, b.size() + 1)
{
dp[i][j] = INF;
}
rep(i, a.size() + 1) dp[i][0] = i;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int... | 0 | 85,260,439 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n, j, num = 0;
cin >> n;
vector<int> height(n, 0);
for(int i = 0; i < n; i++)
cin >> height.at(i);
for(int i = 0; i < n;) {
if(height.at(i) == 0) {
i++; continue;
}
for(j = ... | 0 | 3,965,231 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #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>;
const ll MOD = 1e9 + 7;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 1, -1);
vector<ll> a(M);
for (int i = 0; i < M; i++)
{
cin >> a[i];
... | 0 | 91,907,267 |
#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;
struct Info{
Info(int arg_a,int arg_b){
a = arg_a;
b = arg_b;
}
int a,b;
};
int main(){
int N,... | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T... | 0 | 91,602,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[5]=='0'){
if(s[6]=='1' || s[6]=='2' || s[6]=='3' || s[6]=='4'){
cout << "Heisei" << endl;
}else{
cout << "TBD" << endl;
}
}else{
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int n;
cin >> n;
vector<unsigned long long> a(n);
for(int i = 0;i < n;i++){
cin >> a[i];
}
unsigned long long cnt = 1;
... | 0 | 33,528,306 |
#include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
double T,X;
cin>>T>>X;
double A=T/X;
cout<<A;
} | #include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#define... | 0 | 13,945,214 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a , b ;
cin>>a>>b;
int t=0 , n;
for (int x=0 ; x<=a ; ++x)
{
for (int y=0 ; y<=a ; ++y)
{
n=b-x-y;
if (n>=0&&n<=a)
{
t+=1;
}
}
}
cout<<t<<endl... | #include<bits/stdc++.h>
int main(){
int h,w,a,b;
std::cin>>h>>w>>a>>b;
for(int i=0;i<b;i++){
for(int j=0;j<a;j++){
std::cout<<"1";
}
for(int j=a;j<w;j++){
std::cout<<"0";
}
std::cout<<std::endl;
}
for(int i=b;i<h;i++){
for(int j=0;j<a;j++){
std::cout<<"0";
}
f... | 0 | 49,066,686 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,a;
cin>>n>>a;
if(n<500)
{
if(a>=n)
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
}
else
{
n=n%500;
if(n<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < n; i++)
const ll mod = 1000000007;
int main() {
int n,m;
cin >> n >> m;
int s[n];
rep(i,n) cin >> s[i];
int t[m];
rep(i,m) cin >> t[i];
ll dp[n+1][m+1];
rep(i,n+1) rep(j,m+1) dp[i... | 0 | 51,888,127 |
#include <bits/stdc++.h>
using namespace std;
int64_t calc_gcd(int64_t a, int64_t b)
{
a = a % b;
if (a == 0)
return b;
return calc_gcd(b, a);
}
int64_t calc_lcm(int64_t a, int64_t b)
{
return a / calc_gcd(a, b) * b;
}
int64_t calc_vec_lcm(const vector<int64_t> &a_vec, int64_t upper)
{
int64... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define s second
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define f first
const ll N=1e3+5;
ll bexpo(ll x,ll n){
if(n==0)return 1;
else if(n%2==0)retu... | 0 | 24,074,704 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <set>
#include <bitset>
#include <cmath>
using namespace std;
const int maxv = 10 + 5, INF = 0x3f3f3f3f;
int n, d[maxv][maxv];
int main() {
while (cin >> n && n) {
for (in... | 0 | 52,581,572 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
t = 1;
while(t--){
ll x;
cin >> x;
ll a , b;
cin >> a >> b;
for(int i = a ; i <= b ; i ++)
{
if(i % x == 0)
{cout << ... | 0 | 63,585,488 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin>>n;
int T=0,px=0,py=0;
for(int i=0;i<n;i++){
int t,x,y;
cin>>t>>x>>y;
int dt=t-T;
int dxy=abs(x-px)+abs(y-py);
if(dt... | 0 | 78,669,630 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n,a;
cin>>n>>a;
n*=n;
n-=a;
cout<<n<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 17,552,529 |
#include<bits/stdc++.h>
#include<unordered_map>
#include<tr1/unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define lin1(x) ll int ... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> v... | 0 | 6,862,091 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<utility>
#include<cstdio>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include <bitset>
using namespace std;
const int mod=1e9+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 75,753,677 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
int main() {
int V, E; cin >> V >> E;
vector<vector<long long int>>edges(V, vector<long long int>(V,... | 0 | 32,819,702 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 18) + 10;
int arr[N];
pair<int, pair<int, int>> memo[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", arr + i);
memo[i] = {arr[i], {arr[i], 0}};
}
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2,62);
int keta(int x){
for(int j = 0; ; j++){
... | 0 | 94,222,057 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; i--)
#define all(i) (i).begin(),(i).end()
#define pb push_back
#defi... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 100005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 24,470,912 |
#include <bits/stdc++.h>
#define tc(t) int t; cin>>t; while(t--)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a , b, c;
cin >> a >> b >> 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<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
... | 0 | 63,180,152 |
#include <bits/stdc++.h>
#define N 1000000
using namespace std;
typedef long long int ll;
int main()
{
int t,arr[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
scanf("%d",&t);
printf("%d\n",arr[t-1]);
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.size() < b.size()) puts("LESS");
else if(b.size() < a.size()) puts("GREATER");
else {
for(int i = 0; i < a.size(); i++) {
if(a[i] - '0' < b[i] - '0') {
puts("LES... | 0 | 67,345,596 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
sort(all(a));
rep(i,n-1){
if(a[i]==a[i+1]){
cout<<"NO"<<endl;
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b, k, cnt;
int main() {
cin >> a >> b >> k;
for (... | 0 | 31,946,991 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
char k = 'x';
if(a + b == 15)
{
k = '+';
}
else if(a * b == 15)
{
k = '*';
}
cout << k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
stack<int> densha;
for(int a; cin >> a; ){
if(a == 0){
cout << densha.top() << endl;
... | 0 | 19,593,180 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | #include<iostream>
#include<set>
#include<vector>
using namespace std;
int main(){
int n,m,k;
cin>>n>>m>>k;
set<pair<int,int> >pos;
int xx[n+1];
int yy[m+1];
vector<int>x;
vector<int>y;
int maxx=0;
int maxy=0;
for(int i=1;i<=n;++i)
xx[i]=0;
for(int i=1;i<=m;++i)
yy[i]=0;
for(int i=1;i<=k;++i){
int a,b... | 0 | 91,524,551 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin >> n){
int sum = 0;
int s[100];
if(n == 0) break;
else{
for(int i = 0; i < n; i++){
cin >> s[i];
}
sort(s, s + n);
s[0] = 0;
s[n - 1] = 0;
for(int i = 0; i < n; i++){
sum... | 0 | 89,250,071 |
#include <stdio.h>
int main() {
int t;
scanf("%d", &t);
printf("%d\n", t*(t+1)/2);
return 0;
} | #include<bits/stdc++.h>
int main(){
int n;
std::cin>>n;
std::vector<int> v(n);
for(int i=0;i<n;i++){
std::cin>>v[i];
}
long long ans=0;
int cur=0;
for (int i=0;i<n;i++){
ans+=(v[i]+cur)/2;
if (v[i]!=0)
cur=(v[i]+cur)%2;
else
cur=0;
}
std::cout<<ans<<"\n"... | 0 | 36,763,022 |
#include<bits/stdc++.h>
#define IL inline
#define _ 1005
#define ll long long
using namespace std ;
IL ll gi(){
ll data = 0 , m = 1; char ch = 0;
while(ch!='-' && (ch<'0'||ch>'9')) ch = getchar();
if(ch == '-'){m = 0 ; ch = getchar() ; }
while(ch >= '0' && ch <= '9'){data = (data<<1) + (data<<3) + (ch^48) ; ch = ge... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
int type_one(int h, int w) {
int a = h / 3;
int mi = a * w;
if (h % 3) a++;
int ma = a * w;
return ma - mi;
}
int type_two(int h, int w) {
int ... | 0 | 28,321,591 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<queue>
int n;
int a[105][105];
std::queue<int>S;
int dis[105];
int color[105];
void bfs(int k){
int i;
for(i=1;i<=n;i++){
if(i!=k&& a[k][i]==1 &&color[i]==0){
S.push(i);
dis[i]=dis[k]+1;
... | 0 | 98,446,638 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define uint unsigned long long
#define int long long
#define double long double
#define pb push_back
#... | 0 | 63,889,808 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n,u,k;
int ad;
int arr[200][200] = {0};
scanf("%d",&n);
for(int i=0;i<n;i++){
cin >> u >> k;
for(int i=0;i<k;i++){
cin >> ad;
arr[u][ad] = 1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n; cin >> n;
long long ans = 0;
if(n%2 == 0){
n /= 2;
while(n){
ans += n/5;
n /= 5;
}
}
cout << ans << endl;
} | 0 | 100,494,579 |
#include <bits/stdc++.h>
using namespace std;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; i++)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; i--)
#define vi vector<int>
#define vs vector<string>
#define all(x) (x).begin(),(x).end()
int main() {
int n,m;
cin >> n;
vs s(n);
repp(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a;
rep(i,2*n) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int ans =... | 0 | 89,188,623 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
long long ans = N-1;
int i = 1;
while (pow(i,2) <= N){
long long M = N/i;
if (i*M == N){
ans = min(ans, M + i - 2);
}
i += 1;
}
cout << ans << endl;
} | #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>
#includ... | 0 | 60,571,935 |
#define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 (1... | 0 | 84,328,586 |
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5,mod=1e9+7;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
ll INF=1e18;
ll mn=INF;
ll sum=0;
for(int i=0;i<n;i++)
{
ll x,y;
cin>>x>>y;
sum+=x... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 67,113,157 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n,m,p;
cin>>n>>m>>p;
if(n==0){
break;
}
m--;
vector<int> x(n);
int sum=0;
for(int i=0;i<n;i++){
cin>>x[i];
sum+=x[i];
}
sum*=100;
double temp=(double)sum;
temp-=temp*((double)p/100.... | 0 | 93,362,572 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
LL L, R;
cin >> L >> R;
if(R >= L+2019){
cout <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
void dout() { cerr << '\n'; }
template <typename Head, typename... | 0 | 100,752,782 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).... | #include <queue>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MP make_pair
#define ll long long
#define fi first
#define se second
using namespace std;
template <typename T>
void read(T &x) {
x = 0; bool f = 0;
char c = getchar();
for (;!isdigit(c);... | 0 | 68,161,165 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int a,b;
cin >> a >> b;
if (a * b == 15) {
cout << "*" << endl;
} else if (a + b == 15) {
cout << "+" << endl;
} else {
cout << "x" << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
const int MAX = 100000;
const int INF = 1<<29;
vector<int> G[MAX];
list<int> out;
int n;
bool V[MAX];
int indeg[MAX];
void bfs(int s){
queue<int>q;
q.push(s);
V[s]=true;
while(!q.empty()){
int u=q.front();q.pop();
out.push_... | 0 | 83,015,786 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include <iomanip>
#include<utility>
us... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
unordered_map<ll, vector<ll>> x;
for (ll i = 1; i <= n; i++) {
x[i] = vector<ll>();
}
ll a, b;
for (ll i = 0; i < m; i+... | 0 | 29,478,528 |
#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<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true... | 0 | 94,234,062 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
ll x,y,z;
cin>>x>>y;
z=y;
for(int w=1;w<x;w++) z*=y-1;
cout<<z<<endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | 0 | 49,867,901 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int n, a;
cin >> n >> a;
... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 59,071,828 |
#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(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, c... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define MOD 1000000007
#define PI 3.14159265358979... | 0 | 82,404,200 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<pair<int, int>> ans;
for (int i = 1; i < n - 1; i++){
if(a[i] >... | 0 | 15,803,764 |
#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(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
double sum = 0.0;
cin >> n;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll... | 0 | 75,180,569 |
#include<iostream>
#include<queue>
#include<bitset>
#include<algorithm>
#include<climits>
#include<vector>
#include<deque>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define fill(x,y... | #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 | 27,769,276 |
#include <iostream>
using namespace std;
int main() {
int R, G, T;
cin >> R;
cin >> G;
T = (2 * G) - R;
cout << T << endl;
} | #include <atcoder/all>
using namespace std;
using namespace atcoder;
int main()
{
int n, q;
cin >> n >> q;
dsu uf(n);
for(int i = 0; i < q; i++)
{
int t, u, v;
cin >> t >> u >> v;
if(t == 0)
{
uf.merge(u, v);
}
else
{
if... | 0 | 81,075,783 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
typedef tuple<double,ll,ll>T;
#define PI 3.14159265358979
#define MOD 1000000007
int main(){
ll X,Y,Z,K;
cin>>X>>Y>>Z>>K... | 0 | 97,547,760 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define y... | 0 | 35,665,214 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | #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 MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
c... | 0 | 19,528,872 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ll a,b;
cin >> a >> b;
ll ans = 0;
while(a <= b){
a *= 2;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0;
std::cin >> n;
std::string r = "No";
int cakes = 0;
while (1) {
const int cakes_cost = cakes * 4;
const int donuts_cost = n - (cakes_cost);
if (d... | 0 | 24,950,753 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 100010
const int mod=998244353;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,d[N],... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[])
{
int n, a, b;
string str, command, buff;
cin >> str >> n;
while (n--)
{
cin >> command >> a >> b;
if (command == "print")
{
cout << str.substr(a, b - ... | 0 | 95,502,228 |
#include<bits/stdc++.h>
typedef long long int lli;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,i;
cin>>n;
lli a[n],l;
cin>>l;
for(i=0;i<n;i++){
cin>>a[i];
}
int val=0;
int nonbreak=0;
for(i=0;i<n-1;i++){
if((a[i]+a[i+1])>=l){
val=1;
... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
string s;
... | 0 | 2,445,096 |
#include <iostream>
using namespace std;
int main () {
int n,max,min,i;
long long sum;
int date[10001] ={0};
cin >> n;
for( i=0 ; i<n ; i++){
cin >> date[i];
}
max=date[0];
min=date[0];
sum=date[0];
for( i=1 ; i<n ; i++ ){
if( max<date[i] )
max=date[i];
if( min>date[i] )
min... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | 0 | 38,481,192 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | #include<iostream>
#include<math.h>
#include<stdlib.h>
using namespace std;
int used[27],number[27];
int cnt=1;
int ln;
int n,aa=-1,bb=-1,a[10],b[10];
bool compare(int c[],int d[]){
for(int i=1;i<=n;i++) {
if(c[i]!=d[i]) return false;
}
return true;
}
void permutation(int at,int n){
if(at==n+1){... | 0 | 3,137,389 |
#include <iostream>
using namespace std;
int main()
{
int count;
int num;
while(cin >> num)
{
count = 0;
for(int a = 0; a < 10 && a <= num; ++a)
for(int b = 0; b < 10 && a + b <= num; ++b)
for(int c = 0; c < 10 && a + b + c <= num; ++c)
for... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
const int MX_N = 1e5+5;
int N, M;
vector<int... | 0 | 90,407,563 |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 | 38,750,469 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, d, x;
cin >> n >> d >> x;
vector<ll> A(n);
for (auto & a : A) cin >> a;
ll res = x;
for (auto a : A) {
res += 1 + ((d-1)/a);
}
cout << res << endl;
} | #include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#d... | 0 | 91,608,678 |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int n,b,i,j;
scanf("%d%d",&n,&b);
char s[n+1][b+1];
for(i=0; i<n; i++)
{
scanf("%s",s[i]);
}
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
if(strcmp(s[i],s[j])>0)
{
... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
char s[101], p[101], loop[201];
scanf("%s", s);
scanf("%s", p);
scanf("%s", loop);
strcpy(loop, s);
strcat(loop, s);
if( strstr(loop, p) == NULL ) printf("No\n");
else printf("Yes\n");
return 0;
} | 0 | 85,488,431 |
#include <iostream>
#include <cmath>
#include <algorithm>
#define rep(i,n) for(int i=0;i< (n);++i)
typedef long long ll;
using namespace std;
const int mod=1000000000+7;
int main() {
int N,M;
cin>>N>>M;
int A[N+1];
for(int i=0;i<=N;++i){
A[i]=1;
}
int a;
int p=-1;
for(int i=1;i<=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
int64_t ans = 0;
int64_t b_cnt = 0;
rep(i, s.size())
{
if (s[i] == 'W')
{
ans += b_cnt;
}
else
{
b_c... | 0 | 33,966,910 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<... | 0 | 91,504,344 |
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
#define MAX_V 100010
struct edge {
int to;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define F... | 0 | 45,948,562 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
usi... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N{};
cin >> N;
vector<int> num(N);
for (size_t i = 0;i < N;++i) {
cin >> num.at(i);
}
size_t i = 0,j=N-1;
int left = num.at(i), right = num.at(j);
while (i!=j) {
if (left >= right) {
j--;
if (i == j) {
break;
}
else {
... | 0 | 98,886,390 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
cout << (s == "abc" ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
int main() {
int n;cin>>n;
int ans=0;
vector<int>a(n);
rep(i,n){
cin>>a[i];
}
for (int i=n-1;i>0;i... | 0 | 94,841,337 |
#include <bits/stdc++.h>
typedef long long int ll;
#define pll pair <ll, ll>
#define pii pair <int, int>
#define f first
#define s second
#define pb push_back
#define vll vector <ll>
#define mll map <ll ,ll>
#define prtq priority_queue <long long>
#define rep(a,b) for(i=a;i<b;i++)
#define IOS ios::sync_with_stdio(0... | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, m, result = 0;
cin >> n >> m;
long long x[n], y[m];
for (long long i = 0; i < n; i++) {
cin >> x[i];
}
for (long long i = 0; i < m; i++) {
cin >> y[i];
}
long long left = ... | 0 | 72,983,443 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
int main()
{
optimize();
int n,i;
double p,t=0.0;
string st;
cin>>n;
for(i=1;i<=n;i++){
cin>>p>>st;
if(st=="BTC")
p=380000.0*p;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... | 0 | 86,348,461 |
#include<iostream>
#include<string>
#include<map>
using namespace std;
int main()
{
long long n,m,p,i,r=0,t=0;
map<long long,long long>ac,wa;
string s;
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>p>>s;
if(s=="AC")
{
ac[p]++;
if(ac[p]==1)
{
... | #include <bits/stdc++.h>
#define rep(...) overload_rep(__VA_ARGS__, rep_1, rep_0)(__VA_ARGS__)
#define rep_0(i, end) for(int i = 0; i < (end); ++i)
#define rep_1(i, fr, ba) for(int i = (fr); i <= (ba); ++i)
#define overload_rep(arg0, arg1, arg2, name, ...) name
#define all(box) box.begin(), box.end()
template <class T,... | 0 | 39,522,142 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s,k;cin>>k>>s;
int cnt=0;
for(int i=0;i<=k;i++){
for(int j=0;j<=k;j++){
if(s-i-j<=k&&s-i-j>=0){
cnt++;
}
}
}
cout<<cnt;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 10,460,445 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
voi... | 0 | 17,558,434 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int solve(string S){
int max_global = 0;
int max_current = 0;
for (int i = 0; i < S.size(); ++i) {
if(S[i] == 'R'){
max_current++;
max_global = max(max_global,max_current);
}else{
max_g... | 0 | 20,837,627 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 60,089,762 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
long long mod=1e9+7;
long n,m;
cin>>n>>m;
vector<long long> x;
vector<long long> y;
for(long i=0;i<n;i++){
long long k;
cin>>k;
x.push_back(k);
}
for(long i=0;i<m;i++)... | #include<iostream>
#include <stdio.h>
using namespace std;
int main(){
int n;
int b,f,r,v;
string m="####################";
int num[4][3][10];
int i,j,k;
for (i = 0; i < 4; i++){
for (j = 0; j < 3; j++){
for (k = 0; k < 10; k++){
num[i][j][k]=0;
}
... | 0 | 23,729,923 |
#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< vi > vvi;
typedef pair< int, int > pii;
typedef... | #include <bits/stdc++.h>
#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main()
{
int m, min, max;
while (cin >> m >> min >> max && ... | 0 | 27,246,353 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 100005
int n, p, a[N];
ll m, v;
bool cmp(int x, int y)
{
return x > y;
}
bool check(int x)
{
if(x <= p) return 1;
if(a[x] + m < a[p]) return 0;
int rv = v - (p - 1) - (n - x + 1);
if(rv < 0) return 1;
ll rs = 1ll * rv * m;
for(int i = p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vc = vector<char>;
using vvll = vector<vll>;
using vvi = vector<vi>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int,int>;
using vpii = vect... | 0 | 37,853,258 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#include <cstdlib>
#include<bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#defin... | 0 | 91,371,167 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int max_H = 0, ans = 0;
for(int i = 0;i < N;i++){
int H;
cin >> H;
if(max_H <= H){
max_H = H;
ans++;
}
}
cout << ans << endl;
return 0;
} | #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;
const int INF = 10000;
int main() {
int N; cin >> N;
vector<P> R(N);
vector<P> B(N);
bool use[N];
rep(i, N){
use[i] = false;
}
rep(i, N){
... | 0 | 53,282,349 |
#include <bits/stdc++.h>
#define pvar(x) clog << "[" << #x << ":" << x << "]\n"
using namespace std;
using ll = long long int;
void solve() {
int h, w, m, h1, w1;
cin >> h >> w >> m;
int mr = 0, mc = 0;
map<int, int> r, c;
set<pair<int, int>> s;
for (int i = 0; i < m; i++) {
cin >> h1 >> w1;
r[h1]++... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str, func;
int n;
cin >> str >> n;
for(int i=0;i<n;i++)
{
cin >> func;
if(func=="print")
{
int a, b;
cin >> a >> b;
cout << str.substr(a, b-a+1) << endl;
}
if(func=="replace")
{
int a, b;
strin... | 0 | 12,646,038 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n,k;
cin >> n >> k;
long long sum =0;
long long flag = 0;
vector<int> h(n);
rep(i,n){
cin >> h.at(i);
}
sort(h.begin(),h.end(),greater());\
if(k >= h.size()){
cout << 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int N;
cin >> N;
map<int,int> kani;
for(int... | 0 | 81,196,292 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <iostream>
#include <list>
#include <string>
using namespace std;
void display(list<int> & lst){
if (!lst.empty()){
cout << lst.front();
lst.pop_front();
}
for (auto element : lst){
cout << ' ' << element;
}
cout << endl;
}
int main()
{
ios::sync_with_stdio(f... | 0 | 96,256,037 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R << endl;
return 0;
} | #include <stdio.h>
int main(){
char cards[200];
char newCards[200];
int m, cardsLen;
int h;
while(true) {
scanf("%s",cards);
if(cards[0] == '-') break;
cardsLen = 0;
while(cards[cardsLen] != '\0') cardsLen++;
scanf("%d",&m);
for(int i=0;i<m;i++){
... | 0 | 43,009,339 |
#include<bits/stdc++.h>
#define ll long long
#define for(in1,in2,in3) for (int in1 = in2; in1 < in3; in1++)
#define inf 1e9
#define mp make_pair
#define pb push_back
#define f first
#define s second
using namespace std;
int mx,x,y,z,t,u,v,ans,n,m,o;
string s1,s2,ans1;
int main() {
cin >> x >> y;
ans = (y-x)*2+x;
cou... | #include "bits/stdc++.h"
using namespace std;
int COUNT=0;
void dfs(vector<string> map,int state[20][20],int x,int y,int W,int H){
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
if(x<0 || x>H-1 || y<0 || y>W-1)return;
if(state[x][y]!=0 || map[x][y]=='#')return;
++COUNT;
state[x][y]=1;
for(int i=0;i<4;++i)d... | 0 | 60,731,934 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #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 | 13,754,666 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> num(1e6+5,0);
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
for(int i=0;i<N;i++){
int a=A[i];
if(num[a]>=2){
continue;;
}
while(a<=1e6... | 0 | 20,279,642 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
vector<int> v;
for(unsigned int i = 0;i < 5;i++){
cin >> n;
v.push_back(n);
}
sort(v.begin(), v.end(), greater<int>());
for(int i = 0;i < v.size()-1;i++){
cout << v.at(i) <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#ifdef DEBUG
#define cek(x) cout<<x
#else
#define cek(x) if(false){}
#endif
#define fi first
#define se second
#define INF 1000000000
#define INFLL... | 0 | 80,170,012 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#de... | 0 | 77,629,829 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
... | 0 | 26,211,368 |
#include <iostream>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
ll H,W;
cin >> H >> W;
ll ans = INF*INF;
ll a=0,b=0,c=0;
for(int h = 0; h <= H; h++){
if(W%2==0) a = h*W/2,b = h*W/2;
else a = h*(W-1)/... | #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... | 0 | 54,314,290 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair < ll, ll > PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
ll k, a, b;
cin >> k >> a >> b;
if ( b - a <= 2 ) {
cout << 1 + k << endl;
}
else if ( ( k - ( a - 1 ) ) % 2 ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 29,615,356 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
while (cin >> n)
{
vector<bool> a(n + 1, true);
int cnt = n == 0 ? 0 : n - 1;
for (int i = 2; i*i <= n; ++i)
if (a[i])
for (int j = 0; i * (j + 2) <= n; ++j)
if (a[i * (j + 2)]) a[i * (j + 2)] = false, cnt--;
cout << ... | #include <bits/stdc++.h>
using namespace std;
long long dp[310][610];
int main() {
int n, k; cin >> n >> k;
vector<long long> h(n+1, 0);
for (int i = 0; i <= n+1; i++) {
for (int j = 0; j <= 2*n; j++) dp[i][j] = 1e16;
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) cin >> h[i+1];
for (in... | 0 | 33,447,830 |
#include<cstdio>
#include<iostream>
using namespace std;
bool judge(string s1, string s2) {
for (int i = 0; i < s1.size(); i++) {
if (s1[i] < s2[i]) {
return true;
} else if (s1[i] > s2[i]) {
return false;
}
}
return false;
}
int main(void) {
int N, L;
scanf("%d %d", &N, &L);
string S[100];
for (int ... | #include<cstdio>
int main() {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
if(n + 1 >= a + b && (long long)a * (long long)b >= n) {
int m = n;
for(int i=b;i>0;i--) {
printf("%d\n", i);
int from = b+1 > m-a+2 ? b+1 : m-a+2;
for(int j=from;j<=m;j++) {
printf("%d\n", j);
}
if(m >= from) m = from-1... | 0 | 63,099,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
ll ansAC = 0;
ll ansWA = 0;
vector<bool> usedAC(n, false);
vector<int> cntWA(n, 0);
for (int i = 0; i < m; i++) {
int p; string s; cin >> p >> s;
--p;
if (s == "AC") {
if (usedAC[p]) {}
else {
... | #include <iostream>
#include <cstdio>
const int MAX_KEY_LENGTH = 12;
const int N_KEY_CHARS = 4;
class Dict {
int *KEYS;
int char_to_id(char);
int to_hash(char*);
public:
Dict();
void insert(char*);
bool has(char*);
};
Dict::Dict() {
int max_hash = 0, w = 1;
for (int i = 0... | 0 | 68,829,494 |
#include <iostream>
using namespace std;
using ll = long long;
#define ALL(x) begin(x), end(x)
int main() {
int N,D,X;
cin >> N >> D >> X;
int ans{X};
int a;
for (int i = 0; i != N; ++i) {
cin >> a;
ans += (D-1)/a+1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main()
{
vector<int> dp(10030,-1);
int n, m;
cin >> n >> m;
vector<int> a(m),use={0,2,5,5,4,5,6,3,7,6};
rep(i,m){
cin >> a[i];
}
sort(a.rbegin(), a.rend());
for(au... | 0 | 26,445,345 |
#define REP(i,n) for (int i=0;i<(n);i++)
#include <iostream>
using namespace std;
int main(){
int N;
while(cin >> N && N > 0){
int a[N];
REP(i,N){
cin >> a[i];
}
int maximum = a[0];
REP(i,N){
int sum = 0;
for(int j = i; j < N; j++){
sum += a[j];
maxi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
int a;
vector<int> p(n + 1);
rep(i, n)
{
cin >> p[i] >> a;
}
p[n] = a;
vector <vector <int> > m(n, vector<int>(n));
for (... | 0 | 18,250,021 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
ll t[100005];
ll a[100005];
ll ans;
int main()
{
int n;
cin >> n;
for (int i = 0; i <= n; i++)
{
cin >> a[i];
}
t[0] = 1;
if (n == 0 && a[0] == 1)
{
cout << 1 << endl;
return 0;
... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pai acos(-1)
#... | 0 | 44,642,408 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | #include<iostream>
#include<vector>
#include<string>
#include<set>
int main(){
std::string S, T;
std::cin >> S >> T;
std::vector<int> possible;
std::set<std::string> st;
for(int i = 0; i < S.size() - T.size() + 1; i++){
int j;
for(j = 0; j < T.size(); j++){
if(S[i + j] !=... | 0 | 71,331,254 |
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long A,B,K;
cin>>A>>B>>K;
if(K<=A)
{
cout<<A-K<<" "<<B<<endl;
}
else if(K<=A+B)
{
cout<<0<<" "<<A+B-K<<endl;
}
else
{
cout<<0<<" "<<0... | 0 | 43,365,952 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int A, B, X, flag = 0;
cin >> A >> B >> X;
for (int i = 0; i <= B; i++)
{
if (A + i == X)
{
flag = 1;
break;
}
}
if (flag)
cout << "YES" << endl;
else
... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<unordered_map>
#include<utility>
#include<vector>
constexpr int IINF = (1 << 30) - 1;
constexpr long long... | 0 | 52,970,224 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
using namespace std;
typedef long... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
int ans = 0,light = 1;
for (int i = 0; i < N; ++i)
{
++... | 0 | 56,292,746 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
#define PB push_back
void Input(int*,vector<string>&);
void Bubblesort(int*,vector<string>);
void Selectionsort(int*,vector<string>);
void Output(int*,vector<string>);
int main(int argc,char* argv[]){
int n... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,m,n,c=0,mn=0x7fffffff;;
cin>>n;
long long int v[n+10];
m=0;
for(long long int i=1; i<=n; i++)
{
cin>>v[i];
c+=v[i];
}
for(long long int i=1; i<n; i++)
{
m=m+v[i];
long long int x... | 0 | 49,146,417 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int d=0,s=0,t=0;
cin>>d>>s>>t;
if(s*t<d) cout<<"No";
else cout<<"Yes";
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <iomanip>
#include <algorithm>
#include <string>
#include <queue>
#include <numeric>
using namespace std;
#define nptr nullptr
#define all(x) (x).begin(), (x).end()
#define drobucs ios_base::sync_with_... | 0 | 95,867,415 |
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define A... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int ... | 0 | 25,967,071 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.