Test Greedy: Difference between revisions

From Algopedia
Jump to navigationJump to search
 
(No difference)

Latest revision as of 10:20, 18 November 2019

Badescu Ioana

A. Helpful Maths

#include <iostream>
#include <string.h>
using namespace std;
char s[100];
int k,n;
int v[4];
int main()
{
    cin.getline(s,100);
    k=strlen(s);
    for(int i=0; i<=k; i++)
        if(s[i]=='1')
            v[1]++;
        else if(s[i]=='2')
            v[2]++;
        else if(s[i]=='3')
            v[3]++;
    n = v[1] + v[2] + v[3];
    for(int i=1; i<=3; i++)
        while(v[i])
        {
            cout<<i;
            v[i]--;
            n--;
            if(n)
                cout<<"+";
        }
    return 0;
}

Cofas Sebastian

A. Hungry Student Problem

#include <iostream>

using namespace std;

int main() {
    int n, i, k, cnt;
    cin>>n;
    for (int i = 0; i < n; ++i) {
        cin>>k;
        cnt=k/7;
        if ( k%7==0 )
            cout<<"YES\n";
        else {
            while ( cnt>=0 && ( k-(cnt*7))%3!=0 )
                cnt--;
            if ( cnt<0 )
                cout<<"NO\n";
            else
                cout<<"YES\n";
        }
    }
    return 0;
}