ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 2012. About Grisha N.

Wrong Answer... :(
Posted by Rafiqul Alam Chisty 24 Jan 2017 15:13
#include <stdio.h>
#include <math.h>


int main() {
        int n;
        scanf("%d",&n);
        n=12-n;
        n>=7?printf("NO"):printf("YES");
    return 0;
}
Re: Wrong Answer... :(
Posted by Guillermo Letelier 7 Apr 2018 02:25
#include <stdio.h>
int main(){
int n1,h,g;
scanf ("%d",&n1);
h=12-n1;
g=h*45;
if (g<=300){
    printf ("YES");}
    else{
    printf("NO");}
    return 0;
    }
Re: Correct Answer... :(
Posted by Md.Hamid Hosen 17 Jan 2021 23:36
/*In the name of Almighty Allah*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef set<int> si;
typedef map<string,int> msi;
typedef double dl;
typedef string  st;

#define PB push_back
#define F first
#define S second
#define MP make_pair
#define endl '\n'
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mid(l,r) ((r+l)/2)
#define left(node) (node*2)
#define right(node) (node*2+1)
#define mx_int_prime 999999937
#define CY cout<<"YES"<<endl
#define CN cout<<"NO"<<endl
#define rn return 0

const double PI = acos(-1);
const double eps = 1e-9;//10^-9
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define MOD 1000000007
#define PI 2*acos(0.0)

#define mem(a,b) memset(a, b, sizeof(a) )
#define gcd(a,b) __gcd(a,b)
#define sqr(a) ((a) * (a))
#define sw(a,b) swap(a,b)
#define sor(a) sort(a.begin(),a.end())
#define sorr(a) sort(a.begin(),a.end(),greater<int>())
#define uni(s) unique(s.begin(),s.end())-s.begin()
#define mxdex(a) max_element(v.begin(),v.end())-v.begin()
#define mindex(a) min_element(v.begin(),v.end())-v.begin()
#define mxele(a) max_element(v.begin(),v.end())
#define minele(a) min_element(v.begin(),v.end())

#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction(a) cout.unsetf(ios::floatfield); cout.precision(a); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);

typedef vector<int>::iterator vit;
typedef set<int>::iterator sit;

int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
//int dx[] = {+1, 0, -1, 0, +1, +1, -1, -1};
//int dy[] = {0, +1, 0, -1, +1, -1, +1, -1};

//Debugger

template < typename F, typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "{";
    for(auto it = v.begin(); it != v.end(); ++it) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "}";
}

template < typename T >
ostream &operator << ( ostream & os, const set< T > &v ) {
    os << "[";
    for(auto it = v.begin(); it != v.end(); ++it) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}

template < typename T >
ostream &operator << ( ostream & os, const multiset< T > &v ) {
    os << "[";
    for(auto it = v.begin(); it != v.end(); ++it) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}

template < typename F, typename S >
ostream &operator << ( ostream & os, const map< F, S > &v ) {
    os << "[";
    for(auto it = v.begin(); it != v.end(); ++it) {
        if( it != v.begin() ) os << ", ";
        os << it -> first << " = " << it -> second ;
    }
    return os << "]";
}

#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)

void faltu () {
    cerr << endl;
}

template <typename T>
void faltu( T a[], int n ) {
    for(int i = 0; i < n; ++i) cerr << a[i] << ' ';
    cerr << endl;
}

template <typename T, typename ... hello>
void faltu( T arg, const hello &... rest) {
    cerr << arg << ' ';
    faltu(rest...);
}

int main()
{
    optimize();

    int f;
    cin>>f;

    int x=240/(12-f);

    if(x<45) CN;
    else CY;

    rn;
}

Edited by author 17.01.2021 23:37