Codeforces Round #257 (Div. 2) 450B - Jzzhu and Sequences Solution

 





 

Problem Link:  https://codeforces.com/problemset/problem/450/B

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long  t,x,y,n,nv,v,m=1000000007;
    cin>>x>>y>>n;
    long long a[]={x-y,x,y,y-x,-x,-y};
    v=n%6;
    nv=a[v];
    cout<<(nv%m+m)%m<<endl;
}





















 

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.