답안 #679039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679039	2023-01-07T09:29:57 Z	edogawa_something	Lun (COCI19_lun)	C++17	50 / 50	1 ms	300 KB

lun

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;  
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string st;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define pu push
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(ll i=0;i<n;i++)
#define forx(i,j,n) for(ll i=j;i<n;i++)
#define pb push_back
#define pob pop_back
#define all(v) v.begin(),v.end()  
#define lb lower_bound
#define ub upper_bound
#define pof pop_front
#define pow powww
#define prtll(x) printf("%lld",x)
#define prtld(x) printf("%Lf",x)
#define prtst(x) printf("%s",x)
#define prtch(x) printf("%c",x)
#define measure chrono::high_resolution_clock::now()
const ll dx[]{1,0,-1,0};
const ll dy[]{0,-1,0,1};
const ll inf=2e18;
const ll mod=1e9+7;
const ll LM=1e7+2;
const ll M=1e5+10;
const ll MM=1002;
const ll MMM=101;
const ld pi=acos(-1);
//const ll mod=998244353;
ll pow(ll r,ll to,ll m=mod){
  ll res=1;
  while(to){
    if((to&1))
    res*=r,res%=m;
    r*=r,r%=m;
    to=(to>>1);
  } 
  return res;
}
map<char,ll>mp;
ll n;
st s;
int main(){
  cin>>n>>s;
  for(char c='0';c<='9';c++)
  mp[c]=c-'0';
  forn(j,10){
  mp['x']=j;
  ll chk=0,sum=0;
  for(int i=n-2;i>=0;i--){
    if(i%2==n%2){
      if(mp[s[i]]>4)
      sum+=((mp[s[i]]*2)%10)+1;
      else
      sum+=mp[s[i]]*2;
    }
    else
    sum+=mp[s[i]];
  }
  sum*=9;
  sum%=10;
  if(sum==mp[s[n-1]]){
    cout<<j;
    return 0;
  }
  }
  return 0; 
}
/*

*/

Compilation message

lun.cpp: In function 'int main()':
lun.cpp:62:6: warning: unused variable 'chk' [-Wunused-variable]
   62 |   ll chk=0,sum=0;
      |      ^~~

Subtask #1

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	300 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct