# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704454 | delrey | Lun (COCI19_lun) | C++14 | 0 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s;
cin>>n>>s;
int x = 0;
while(s[x] != 'x')
x++;
int sum = 0;
for(int i = n - 2; i >= 0; i--)
{
if(s[i] == 'x')
continue;
int a = s[i] - '0';
if((n - 2 - i) % 2 == 0)
{
a *= 2;
if(a > 9)
a = a / 10 + a % 10;
}
sum += a;
//cout<<a<<" ";
}
//cout<<endl<<sum<<" ";
sum *= 9;
sum %= 10;
//cout<<sum<<" "<<endl;
if(x == n - 1)
{
cout<<sum<<endl;
return 0;
}
for(int i = 0; i < 10; i++)
{
int sum2 = sum, a = i;
if((n - 2 - x) % 2 == 0)
{
a *= 2;
if(a > 9)
a = a / 10 + a % 10;
}
sum2 = (sum2 + ((a * 9) % 10)) % 10;
if(sum2 == s[n - 1] - '0')
{
cout<<a<<endl;
return 0;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |