68612023-12-19 12:40:18TDIDecimáliacpp17Wrong answer 0/1006ms5084 KiB
#include <iostream>
#include <cmath>

using namespace std;

int main()
{
    long long int n,o=0;
    cin>>n;
    int t[n];
    for (int i=0; i<n; i++)
    {
        cin>>t[i];
    }
    for (int i=n-1;i>0; i--)
    {
        if (i==n-1)
            o=t[i]*pow(10,n-1);
        if (t[i]>=pow(10,n-i))
        {
            o+=t[i]*pow(10,n-i);
        }
    }
    cout<<o;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted3ms1752 KiB
2Wrong answer3ms1992 KiB
3Accepted3ms2224 KiB
subtask20/25
4Accepted2ms2316 KiB
5Wrong answer3ms2456 KiB
6Wrong answer3ms2848 KiB
7Wrong answer3ms2864 KiB
8Wrong answer3ms3104 KiB
subtask30/26
9Wrong answer3ms3212 KiB
10Wrong answer3ms3344 KiB
11Wrong answer3ms3424 KiB
12Wrong answer3ms3640 KiB
13Wrong answer3ms3604 KiB
14Accepted3ms3612 KiB
15Wrong answer3ms3724 KiB
16Wrong answer3ms3716 KiB
subtask40/19
17Wrong answer3ms3876 KiB
18Wrong answer3ms3892 KiB
19Wrong answer3ms3892 KiB
20Wrong answer3ms3892 KiB
subtask50/30
21Wrong answer6ms4600 KiB
22Wrong answer6ms4848 KiB
23Wrong answer6ms4812 KiB
24Wrong answer6ms4808 KiB
25Wrong answer6ms4824 KiB
26Wrong answer6ms5084 KiB
27Wrong answer4ms5000 KiB
28Wrong answer3ms4432 KiB