70072023-12-26 17:31:55BenedekMartonOszthatóság 37-telcpp11Wrong answer 36/403ms3508 KiB
#include <iostream>
#include <queue>
using namespace std;

int main()
{
    long long int n;
    cin >> n;
    queue <int> q;
    while(n/10>=n%10*11 and n!=0)
    {
        n=n/10-n%10*11;
        q.push(n);
    }
    if(n%37==0)
    {
        cout << "IGEN";
    }
    else
    {
        cout << "NEM";
    }
    cout << endl;
    while(!q.empty())
    {
        cout << q.front() << " ";
        q.pop();
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/40
1Accepted0/03ms1808 KiB
2Accepted0/03ms2016 KiB
3Accepted3/33ms2260 KiB
4Accepted3/33ms2316 KiB
5Accepted3/33ms2556 KiB
6Accepted3/33ms2812 KiB
7Accepted3/33ms2808 KiB
8Accepted3/33ms2880 KiB
9Accepted3/33ms2944 KiB
10Accepted3/33ms3068 KiB
11Accepted3/33ms2952 KiB
12Accepted3/33ms3076 KiB
13Accepted3/33ms3088 KiB
14Accepted3/33ms3296 KiB
15Wrong answer0/23ms3380 KiB
16Wrong answer0/23ms3508 KiB